./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-broom/sll-nested-sll-lst-data.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-broom/sll-nested-sll-lst-data.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6c22cd9939cf4e0054fcfe90f9b6c0796fdde4127b9efff81228419797dcb062 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-25 00:11:06,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-25 00:11:06,980 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2023-11-25 00:11:06,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-25 00:11:06,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-25 00:11:07,011 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-25 00:11:07,012 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-25 00:11:07,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-25 00:11:07,014 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-25 00:11:07,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-25 00:11:07,015 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-25 00:11:07,015 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-25 00:11:07,016 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-25 00:11:07,017 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-25 00:11:07,017 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-25 00:11:07,018 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-25 00:11:07,018 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-25 00:11:07,019 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-25 00:11:07,019 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-25 00:11:07,020 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-25 00:11:07,021 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-25 00:11:07,021 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-25 00:11:07,022 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-25 00:11:07,023 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-25 00:11:07,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-25 00:11:07,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-25 00:11:07,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-25 00:11:07,025 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-25 00:11:07,026 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-25 00:11:07,030 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-25 00:11:07,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-25 00:11:07,032 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-25 00:11:07,033 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-25 00:11:07,033 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-25 00:11:07,033 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-25 00:11:07,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-25 00:11:07,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-25 00:11:07,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:11:07,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-25 00:11:07,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-25 00:11:07,035 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-25 00:11:07,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-25 00:11:07,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-25 00:11:07,036 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-25 00:11:07,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-25 00:11:07,036 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6c22cd9939cf4e0054fcfe90f9b6c0796fdde4127b9efff81228419797dcb062 [2023-11-25 00:11:07,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-25 00:11:07,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-25 00:11:07,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-25 00:11:07,334 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-25 00:11:07,335 INFO L274 PluginConnector]: CDTParser initialized [2023-11-25 00:11:07,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/memsafety-broom/sll-nested-sll-lst-data.i [2023-11-25 00:11:10,564 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-25 00:11:10,899 INFO L384 CDTParser]: Found 1 translation units. [2023-11-25 00:11:10,900 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/sv-benchmarks/c/memsafety-broom/sll-nested-sll-lst-data.i [2023-11-25 00:11:10,963 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/data/e427e34b8/8777548c698849238ede15063c5b1fd1/FLAG5a0da5572 [2023-11-25 00:11:10,982 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/data/e427e34b8/8777548c698849238ede15063c5b1fd1 [2023-11-25 00:11:10,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-25 00:11:10,995 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-25 00:11:10,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-25 00:11:10,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-25 00:11:11,004 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-25 00:11:11,005 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:11:10" (1/1) ... [2023-11-25 00:11:11,006 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c2f12f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:11:11, skipping insertion in model container [2023-11-25 00:11:11,007 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:11:10" (1/1) ... [2023-11-25 00:11:11,104 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-25 00:11:11,503 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:11:11,516 INFO L202 MainTranslator]: Completed pre-run [2023-11-25 00:11:11,571 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:11:11,603 INFO L206 MainTranslator]: Completed translation [2023-11-25 00:11:11,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:11:11 WrapperNode [2023-11-25 00:11:11,604 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-25 00:11:11,605 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-25 00:11:11,606 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-25 00:11:11,606 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-25 00:11:11,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:11:11" (1/1) ... [2023-11-25 00:11:11,630 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:11:11" (1/1) ... [2023-11-25 00:11:11,659 INFO L138 Inliner]: procedures = 125, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2023-11-25 00:11:11,660 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-25 00:11:11,661 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-25 00:11:11,661 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-25 00:11:11,661 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-25 00:11:11,672 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:11:11" (1/1) ... [2023-11-25 00:11:11,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:11:11" (1/1) ... [2023-11-25 00:11:11,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:11:11" (1/1) ... [2023-11-25 00:11:11,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:11:11" (1/1) ... [2023-11-25 00:11:11,691 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:11:11" (1/1) ... [2023-11-25 00:11:11,695 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:11:11" (1/1) ... [2023-11-25 00:11:11,698 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:11:11" (1/1) ... [2023-11-25 00:11:11,700 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:11:11" (1/1) ... [2023-11-25 00:11:11,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-25 00:11:11,705 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-25 00:11:11,705 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-25 00:11:11,706 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-25 00:11:11,707 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:11:11" (1/1) ... [2023-11-25 00:11:11,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:11:11,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:11:11,764 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-25 00:11:11,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-25 00:11:11,812 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero_internal [2023-11-25 00:11:11,813 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero_internal [2023-11-25 00:11:11,813 INFO L130 BoogieDeclarations]: Found specification of procedure create_internal [2023-11-25 00:11:11,813 INFO L138 BoogieDeclarations]: Found implementation of procedure create_internal [2023-11-25 00:11:11,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-25 00:11:11,813 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2023-11-25 00:11:11,814 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2023-11-25 00:11:11,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-25 00:11:11,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-25 00:11:11,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-25 00:11:11,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-25 00:11:11,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-25 00:11:11,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-25 00:11:11,983 INFO L241 CfgBuilder]: Building ICFG [2023-11-25 00:11:11,985 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-25 00:11:12,409 INFO L282 CfgBuilder]: Performing block encoding [2023-11-25 00:11:12,538 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-25 00:11:12,539 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-25 00:11:12,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:11:12 BoogieIcfgContainer [2023-11-25 00:11:12,541 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-25 00:11:12,544 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-25 00:11:12,544 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-25 00:11:12,548 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-25 00:11:12,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 12:11:10" (1/3) ... [2023-11-25 00:11:12,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d64305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:11:12, skipping insertion in model container [2023-11-25 00:11:12,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:11:11" (2/3) ... [2023-11-25 00:11:12,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d64305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:11:12, skipping insertion in model container [2023-11-25 00:11:12,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:11:12" (3/3) ... [2023-11-25 00:11:12,551 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-nested-sll-lst-data.i [2023-11-25 00:11:12,573 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-25 00:11:12,574 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2023-11-25 00:11:12,647 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-25 00:11:12,655 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@579046ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-25 00:11:12,656 INFO L358 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2023-11-25 00:11:12,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 41 states have (on average 2.292682926829268) internal successors, (94), 86 states have internal predecessors, (94), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-25 00:11:12,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-25 00:11:12,665 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:11:12,666 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-25 00:11:12,666 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-25 00:11:12,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:11:12,672 INFO L85 PathProgramCache]: Analyzing trace with hash 7451596, now seen corresponding path program 1 times [2023-11-25 00:11:12,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:11:12,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120123180] [2023-11-25 00:11:12,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:12,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:11:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:12,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:11:12,964 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:11:12,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120123180] [2023-11-25 00:11:12,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120123180] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:11:12,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:11:12,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-25 00:11:12,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350859753] [2023-11-25 00:11:12,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:11:12,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:11:12,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:11:13,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:11:13,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:11:13,034 INFO L87 Difference]: Start difference. First operand has 96 states, 41 states have (on average 2.292682926829268) internal successors, (94), 86 states have internal predecessors, (94), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:11:13,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:11:13,262 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2023-11-25 00:11:13,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:11:13,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-25 00:11:13,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:11:13,277 INFO L225 Difference]: With dead ends: 94 [2023-11-25 00:11:13,278 INFO L226 Difference]: Without dead ends: 93 [2023-11-25 00:11:13,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:11:13,286 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:11:13,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 119 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:11:13,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-25 00:11:13,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-11-25 00:11:13,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 41 states have (on average 2.1707317073170733) internal successors, (89), 83 states have internal predecessors, (89), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-25 00:11:13,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2023-11-25 00:11:13,351 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 4 [2023-11-25 00:11:13,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:11:13,351 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2023-11-25 00:11:13,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:11:13,352 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2023-11-25 00:11:13,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-25 00:11:13,353 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:11:13,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-25 00:11:13,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-25 00:11:13,354 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-25 00:11:13,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:11:13,355 INFO L85 PathProgramCache]: Analyzing trace with hash 7451597, now seen corresponding path program 1 times [2023-11-25 00:11:13,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:11:13,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81398354] [2023-11-25 00:11:13,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:13,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:11:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:13,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:11:13,523 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:11:13,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81398354] [2023-11-25 00:11:13,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81398354] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:11:13,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:11:13,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-25 00:11:13,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238875367] [2023-11-25 00:11:13,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:11:13,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:11:13,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:11:13,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:11:13,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:11:13,529 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:11:13,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:11:13,708 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2023-11-25 00:11:13,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:11:13,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-25 00:11:13,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:11:13,714 INFO L225 Difference]: With dead ends: 91 [2023-11-25 00:11:13,714 INFO L226 Difference]: Without dead ends: 91 [2023-11-25 00:11:13,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:11:13,721 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:11:13,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 124 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:11:13,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-25 00:11:13,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-11-25 00:11:13,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 81 states have internal predecessors, (87), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-25 00:11:13,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2023-11-25 00:11:13,749 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 4 [2023-11-25 00:11:13,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:11:13,750 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2023-11-25 00:11:13,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:11:13,750 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2023-11-25 00:11:13,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-25 00:11:13,751 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:11:13,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:11:13,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-25 00:11:13,752 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zero_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-25 00:11:13,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:11:13,753 INFO L85 PathProgramCache]: Analyzing trace with hash -638742698, now seen corresponding path program 1 times [2023-11-25 00:11:13,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:11:13,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695314442] [2023-11-25 00:11:13,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:13,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:11:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:13,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:11:13,898 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:11:13,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695314442] [2023-11-25 00:11:13,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695314442] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:11:13,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:11:13,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-25 00:11:13,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583933132] [2023-11-25 00:11:13,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:11:13,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:11:13,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:11:13,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:11:13,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:11:13,902 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-25 00:11:14,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:11:14,002 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2023-11-25 00:11:14,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:11:14,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-25 00:11:14,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:11:14,004 INFO L225 Difference]: With dead ends: 90 [2023-11-25 00:11:14,004 INFO L226 Difference]: Without dead ends: 90 [2023-11-25 00:11:14,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:11:14,006 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:11:14,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 117 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:11:14,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-25 00:11:14,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-11-25 00:11:14,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 41 states have (on average 2.097560975609756) internal successors, (86), 80 states have internal predecessors, (86), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-25 00:11:14,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2023-11-25 00:11:14,015 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 11 [2023-11-25 00:11:14,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:11:14,016 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2023-11-25 00:11:14,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-25 00:11:14,017 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2023-11-25 00:11:14,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-25 00:11:14,018 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:11:14,018 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:11:14,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-25 00:11:14,018 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zero_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-25 00:11:14,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:11:14,019 INFO L85 PathProgramCache]: Analyzing trace with hash -638742697, now seen corresponding path program 1 times [2023-11-25 00:11:14,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:11:14,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481494353] [2023-11-25 00:11:14,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:14,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:11:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:14,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:11:14,125 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:11:14,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481494353] [2023-11-25 00:11:14,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481494353] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:11:14,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:11:14,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-25 00:11:14,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259016084] [2023-11-25 00:11:14,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:11:14,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:11:14,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:11:14,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:11:14,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:11:14,128 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-25 00:11:14,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:11:14,230 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2023-11-25 00:11:14,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:11:14,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-25 00:11:14,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:11:14,232 INFO L225 Difference]: With dead ends: 89 [2023-11-25 00:11:14,232 INFO L226 Difference]: Without dead ends: 89 [2023-11-25 00:11:14,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:11:14,234 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:11:14,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 122 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:11:14,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-25 00:11:14,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-11-25 00:11:14,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 41 states have (on average 2.073170731707317) internal successors, (85), 79 states have internal predecessors, (85), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-25 00:11:14,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2023-11-25 00:11:14,243 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 11 [2023-11-25 00:11:14,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:11:14,243 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2023-11-25 00:11:14,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-25 00:11:14,243 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2023-11-25 00:11:14,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-25 00:11:14,244 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:11:14,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:11:14,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-25 00:11:14,245 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting create_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-25 00:11:14,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:11:14,246 INFO L85 PathProgramCache]: Analyzing trace with hash -2076283540, now seen corresponding path program 1 times [2023-11-25 00:11:14,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:11:14,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888837740] [2023-11-25 00:11:14,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:14,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:11:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:14,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:11:14,358 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:11:14,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888837740] [2023-11-25 00:11:14,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888837740] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:11:14,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:11:14,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-25 00:11:14,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011218570] [2023-11-25 00:11:14,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:11:14,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-25 00:11:14,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:11:14,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-25 00:11:14,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-25 00:11:14,361 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-25 00:11:14,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:11:14,550 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2023-11-25 00:11:14,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-25 00:11:14,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2023-11-25 00:11:14,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:11:14,553 INFO L225 Difference]: With dead ends: 91 [2023-11-25 00:11:14,553 INFO L226 Difference]: Without dead ends: 91 [2023-11-25 00:11:14,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-25 00:11:14,555 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 12 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:11:14,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 176 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:11:14,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-25 00:11:14,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2023-11-25 00:11:14,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 41 states have (on average 2.0) internal successors, (82), 76 states have internal predecessors, (82), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-25 00:11:14,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2023-11-25 00:11:14,565 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 14 [2023-11-25 00:11:14,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:11:14,565 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2023-11-25 00:11:14,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-25 00:11:14,566 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2023-11-25 00:11:14,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-25 00:11:14,566 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:11:14,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:11:14,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-25 00:11:14,567 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting create_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-25 00:11:14,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:11:14,568 INFO L85 PathProgramCache]: Analyzing trace with hash -2076283539, now seen corresponding path program 1 times [2023-11-25 00:11:14,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:11:14,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877933199] [2023-11-25 00:11:14,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:14,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:11:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:14,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:11:14,918 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:11:14,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877933199] [2023-11-25 00:11:14,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877933199] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:11:14,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:11:14,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-25 00:11:14,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335149305] [2023-11-25 00:11:14,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:11:14,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:11:14,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:11:14,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:11:14,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:11:14,921 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-25 00:11:15,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:11:15,142 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2023-11-25 00:11:15,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-25 00:11:15,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2023-11-25 00:11:15,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:11:15,144 INFO L225 Difference]: With dead ends: 90 [2023-11-25 00:11:15,144 INFO L226 Difference]: Without dead ends: 90 [2023-11-25 00:11:15,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-25 00:11:15,146 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 6 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:11:15,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 261 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:11:15,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-25 00:11:15,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2023-11-25 00:11:15,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 41 states have (on average 1.975609756097561) internal successors, (81), 75 states have internal predecessors, (81), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-25 00:11:15,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2023-11-25 00:11:15,153 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 14 [2023-11-25 00:11:15,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:11:15,153 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2023-11-25 00:11:15,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-25 00:11:15,154 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2023-11-25 00:11:15,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-25 00:11:15,155 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:11:15,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:11:15,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-25 00:11:15,155 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-25 00:11:15,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:11:15,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1442796777, now seen corresponding path program 1 times [2023-11-25 00:11:15,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:11:15,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158207796] [2023-11-25 00:11:15,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:15,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:11:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:15,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:11:15,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:11:15,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158207796] [2023-11-25 00:11:15,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158207796] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:11:15,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:11:15,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-25 00:11:15,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551306961] [2023-11-25 00:11:15,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:11:15,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-25 00:11:15,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:11:15,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-25 00:11:15,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-25 00:11:15,389 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-25 00:11:15,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:11:15,858 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2023-11-25 00:11:15,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-25 00:11:15,859 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 19 [2023-11-25 00:11:15,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:11:15,860 INFO L225 Difference]: With dead ends: 102 [2023-11-25 00:11:15,861 INFO L226 Difference]: Without dead ends: 102 [2023-11-25 00:11:15,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-25 00:11:15,862 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 18 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-25 00:11:15,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 229 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-25 00:11:15,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-25 00:11:15,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 95. [2023-11-25 00:11:15,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 50 states have (on average 1.92) internal successors, (96), 82 states have internal predecessors, (96), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2023-11-25 00:11:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. [2023-11-25 00:11:15,871 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 112 transitions. Word has length 19 [2023-11-25 00:11:15,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:11:15,871 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 112 transitions. [2023-11-25 00:11:15,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-25 00:11:15,872 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 112 transitions. [2023-11-25 00:11:15,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-25 00:11:15,873 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:11:15,873 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:11:15,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-25 00:11:15,874 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-25 00:11:15,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:11:15,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1442796776, now seen corresponding path program 1 times [2023-11-25 00:11:15,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:11:15,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512440721] [2023-11-25 00:11:15,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:15,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:11:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:16,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:11:16,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:11:16,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512440721] [2023-11-25 00:11:16,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512440721] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:11:16,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:11:16,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-25 00:11:16,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631716490] [2023-11-25 00:11:16,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:11:16,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-25 00:11:16,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:11:16,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-25 00:11:16,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-25 00:11:16,320 INFO L87 Difference]: Start difference. First operand 95 states and 112 transitions. Second operand has 11 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-25 00:11:16,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:11:16,880 INFO L93 Difference]: Finished difference Result 107 states and 128 transitions. [2023-11-25 00:11:16,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-25 00:11:16,881 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 19 [2023-11-25 00:11:16,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:11:16,882 INFO L225 Difference]: With dead ends: 107 [2023-11-25 00:11:16,883 INFO L226 Difference]: Without dead ends: 107 [2023-11-25 00:11:16,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-11-25 00:11:16,884 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 18 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-25 00:11:16,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 255 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-25 00:11:16,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-25 00:11:16,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2023-11-25 00:11:16,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 88 states have internal predecessors, (104), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-25 00:11:16,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2023-11-25 00:11:16,897 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 19 [2023-11-25 00:11:16,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:11:16,898 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2023-11-25 00:11:16,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-25 00:11:16,902 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2023-11-25 00:11:16,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-25 00:11:16,903 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:11:16,904 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:11:16,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-25 00:11:16,904 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting create_internalErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-25 00:11:16,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:11:16,905 INFO L85 PathProgramCache]: Analyzing trace with hash 784323100, now seen corresponding path program 1 times [2023-11-25 00:11:16,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:11:16,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394135470] [2023-11-25 00:11:16,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:16,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:11:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:17,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:11:17,213 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:11:17,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394135470] [2023-11-25 00:11:17,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394135470] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:11:17,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491098523] [2023-11-25 00:11:17,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:17,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:11:17,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:11:17,221 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:11:17,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-25 00:11:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:17,395 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-25 00:11:17,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:11:17,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-25 00:11:17,550 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2023-11-25 00:11:17,599 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-25 00:11:17,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-25 00:11:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-25 00:11:17,609 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:11:17,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491098523] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:11:17,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [945315625] [2023-11-25 00:11:17,724 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-11-25 00:11:17,726 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:11:17,730 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:11:17,736 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:11:17,737 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:11:17,971 INFO L197 IcfgInterpreter]: Interpreting procedure create_internal with input of size 70 for LOIs [2023-11-25 00:11:18,925 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero_internal with input of size 140 for LOIs [2023-11-25 00:11:19,162 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 22 for LOIs [2023-11-25 00:11:19,190 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-25 00:11:34,302 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1718#(and (= create_internal_~sll~0.offset 0) (<= 1 |#StackHeapBarrier|) (= create_internal_~now~0.offset 0) (not (= (select |#valid| create_internal_~now~0.base) 1)) (= |create_internal_#t~ret8.offset| 0) (or (and (exists ((|v_create_internal_#t~nondet7_6| Int)) (and (<= |v_create_internal_#t~nondet7_6| 2147483647) (<= 0 (+ |v_create_internal_#t~nondet7_6| 2147483648)) (not (= |v_create_internal_#t~nondet7_6| 0)))) (<= (+ create_internal_~sll~0.base 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_77| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_77| |create_internal_#t~ret8.base| (store (select |v_#memory_int_77| |create_internal_#t~ret8.base|) 4 (select (select |#memory_int| |create_internal_#t~ret8.base|) 4))))) (exists ((|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_105| |create_internal_#t~ret8.base| (store (select |v_#memory_$Pointer$.offset_105| |create_internal_#t~ret8.base|) 4 0)))) (<= (+ |create_internal_#t~ret8.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_108| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_108| |create_internal_#t~ret8.base| (store (select |v_#memory_$Pointer$.base_108| |create_internal_#t~ret8.base|) 4 0)))) (exists ((|v_#length_98| (Array Int Int))) (= |#length| (store |v_#length_98| |create_internal_#t~ret8.base| 12))) (exists ((|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_3| (Array Int Int))) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_3| 0) 0)) (exists ((|v_#memory_$Pointer$.base_105| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (store (store |v_#memory_$Pointer$.base_105| create_internal_~sll~0.base (store (select |v_#memory_$Pointer$.base_105| create_internal_~sll~0.base) 4 0)) create_internal_~now~0.base (store (select (store |v_#memory_$Pointer$.base_105| create_internal_~sll~0.base (store (select |v_#memory_$Pointer$.base_105| create_internal_~sll~0.base) 4 0)) create_internal_~now~0.base) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| create_internal_~now~0.base) 0))))) (exists ((|v_#valid_116| (Array Int Int))) (= (select |v_#valid_116| create_internal_~sll~0.base) 0)) (not (= create_internal_~sll~0.base 0)) (= create_internal_~now~0.base create_internal_~sll~0.base) (exists ((|v_#memory_int_75| (Array Int (Array Int Int))) (|v_#memory_int_76| (Array Int (Array Int Int))) (|v_#length_97| (Array Int Int)) (|v_#memory_$Pointer$.base_103| (Array Int (Array Int Int))) (|v_#valid_115| (Array Int Int)) (|v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| Int) (|v_#memory_$Pointer$.offset_103| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_103| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| (store (store (select |v_#memory_$Pointer$.base_103| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 0 0) 8 0)) |old(#memory_$Pointer$.base)|) (= (select |v_#valid_115| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 0) (= (store |v_#memory_int_76| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| (store (select |v_#memory_int_76| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 8 (select (select |old(#memory_int)| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 8))) |old(#memory_int)|) (= (store |v_#memory_int_75| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| (store (select |v_#memory_int_75| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 0 (select (select |v_#memory_int_76| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 0))) |v_#memory_int_76|) (= |old(#length)| (store |v_#length_97| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 16)) (= |old(#valid)| (store |v_#valid_115| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 1)) (<= (+ |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 1) |#StackHeapBarrier|) (= |old(#memory_$Pointer$.offset)| (store |v_#memory_$Pointer$.offset_103| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| (store (store (select |v_#memory_$Pointer$.offset_103| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 0 0) 8 0))) (not (= |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 0)))) (exists ((|v_#memory_$Pointer$.offset_108| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.offset_108| create_internal_~sll~0.base (store (select |v_#memory_$Pointer$.offset_108| create_internal_~sll~0.base) 4 0)) create_internal_~now~0.base (store (select (store |v_#memory_$Pointer$.offset_108| create_internal_~sll~0.base (store (select |v_#memory_$Pointer$.offset_108| create_internal_~sll~0.base) 4 0)) create_internal_~now~0.base) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_9| create_internal_~now~0.base) 0))) |v_old(#memory_$Pointer$.offset)_AFTER_CALL_9|)) (not (= |create_internal_#t~ret8.base| 0)) (exists ((|v_#valid_118| (Array Int Int))) (and (= (select |v_#valid_118| |create_internal_#t~ret8.base|) 0) (= (store |v_#valid_118| |create_internal_#t~ret8.base| 1) |#valid|))) (exists ((|v_#memory_int_78| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int))) (|v_#memory_int_80| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_78| create_internal_~now~0.base (store (select |v_#memory_int_78| create_internal_~now~0.base) 0 (select (select |v_old(#memory_int)_AFTER_CALL_9| create_internal_~now~0.base) 0))) |v_old(#memory_int)_AFTER_CALL_9|) (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_9| create_internal_~now~0.base) 0) 2147483648)) (= |v_#memory_int_78| (store |v_#memory_int_80| create_internal_~sll~0.base (store (select |v_#memory_int_80| create_internal_~sll~0.base) 4 (select (select |v_#memory_int_78| create_internal_~sll~0.base) 4)))) (<= (select (select |v_old(#memory_int)_AFTER_CALL_9| create_internal_~now~0.base) 0) 2147483647)))) (and (exists ((|v_create_internal_#t~nondet7_6| Int)) (and (<= |v_create_internal_#t~nondet7_6| 2147483647) (<= 0 (+ |v_create_internal_#t~nondet7_6| 2147483648)) (not (= |v_create_internal_#t~nondet7_6| 0)))) (<= (+ create_internal_~sll~0.base 1) |#StackHeapBarrier|) (<= (+ |create_internal_#t~ret8.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_107| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_107| |create_internal_#t~ret8.base| (store (select |v_#memory_$Pointer$.offset_107| |create_internal_#t~ret8.base|) 4 0)))) (exists ((|v_#memory_int_79| (Array Int (Array Int Int)))) (= (store |v_#memory_int_79| |create_internal_#t~ret8.base| (store (select |v_#memory_int_79| |create_internal_#t~ret8.base|) 4 (select (select |#memory_int| |create_internal_#t~ret8.base|) 4))) |#memory_int|)) (exists ((|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_3| (Array Int Int))) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_3| 0) 0)) (exists ((|v_#memory_$Pointer$.base_107| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_8| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.base_107| create_internal_~sll~0.base (store (select |v_#memory_$Pointer$.base_107| create_internal_~sll~0.base) 4 0)) create_internal_~now~0.base (store (select (store |v_#memory_$Pointer$.base_107| create_internal_~sll~0.base (store (select |v_#memory_$Pointer$.base_107| create_internal_~sll~0.base) 4 0)) create_internal_~now~0.base) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_8| create_internal_~now~0.base) 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_8|)) (not (= create_internal_~sll~0.base 0)) (exists ((|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_8| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.offset_105| create_internal_~sll~0.base (store (select |v_#memory_$Pointer$.offset_105| create_internal_~sll~0.base) 4 0)) create_internal_~now~0.base (store (select (store |v_#memory_$Pointer$.offset_105| create_internal_~sll~0.base (store (select |v_#memory_$Pointer$.offset_105| create_internal_~sll~0.base) 4 0)) create_internal_~now~0.base) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_8| create_internal_~now~0.base) 0))) |v_old(#memory_$Pointer$.offset)_AFTER_CALL_8|)) (exists ((|v_#memory_$Pointer$.base_105| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_105| |create_internal_#t~ret8.base| (store (select |v_#memory_$Pointer$.base_105| |create_internal_#t~ret8.base|) 4 0)))) (exists ((|v_#memory_int_77| (Array Int (Array Int Int))) (|v_#memory_int_78| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_8| (Array Int (Array Int Int)))) (and (= |v_#memory_int_78| (store |v_#memory_int_77| create_internal_~sll~0.base (store (select |v_#memory_int_77| create_internal_~sll~0.base) 4 (select (select |v_#memory_int_78| create_internal_~sll~0.base) 4)))) (<= (select (select |v_old(#memory_int)_AFTER_CALL_8| create_internal_~now~0.base) 0) 2147483647) (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_8| create_internal_~now~0.base) 0) 2147483648)) (= |v_old(#memory_int)_AFTER_CALL_8| (store |v_#memory_int_78| create_internal_~now~0.base (store (select |v_#memory_int_78| create_internal_~now~0.base) 0 (select (select |v_old(#memory_int)_AFTER_CALL_8| create_internal_~now~0.base) 0)))))) (= create_internal_~now~0.base create_internal_~sll~0.base) (exists ((|v_#valid_116| (Array Int Int))) (and (= (select |v_#valid_116| |create_internal_#t~ret8.base|) 0) (= (store |v_#valid_116| |create_internal_#t~ret8.base| 1) |#valid|))) (exists ((|v_#memory_int_75| (Array Int (Array Int Int))) (|v_#memory_int_76| (Array Int (Array Int Int))) (|v_#length_97| (Array Int Int)) (|v_#memory_$Pointer$.base_103| (Array Int (Array Int Int))) (|v_#valid_115| (Array Int Int)) (|v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| Int) (|v_#memory_$Pointer$.offset_103| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_103| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| (store (store (select |v_#memory_$Pointer$.base_103| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 0 0) 8 0)) |old(#memory_$Pointer$.base)|) (= (select |v_#valid_115| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 0) (= (store |v_#memory_int_76| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| (store (select |v_#memory_int_76| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 8 (select (select |old(#memory_int)| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 8))) |old(#memory_int)|) (= (store |v_#memory_int_75| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| (store (select |v_#memory_int_75| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 0 (select (select |v_#memory_int_76| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 0))) |v_#memory_int_76|) (= |old(#length)| (store |v_#length_97| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 16)) (= |old(#valid)| (store |v_#valid_115| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 1)) (<= (+ |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 1) |#StackHeapBarrier|) (= |old(#memory_$Pointer$.offset)| (store |v_#memory_$Pointer$.offset_103| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| (store (store (select |v_#memory_$Pointer$.offset_103| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 0 0) 8 0))) (not (= |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 0)))) (exists ((|v_#valid_117| (Array Int Int))) (= (select |v_#valid_117| create_internal_~sll~0.base) 0)) (not (= |create_internal_#t~ret8.base| 0)) (exists ((|v_#length_99| (Array Int Int))) (= (store |v_#length_99| |create_internal_#t~ret8.base| 12) |#length|)))))' at error location [2023-11-25 00:11:34,302 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-25 00:11:34,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-25 00:11:34,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-11-25 00:11:34,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202638764] [2023-11-25 00:11:34,303 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-25 00:11:34,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-25 00:11:34,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:11:34,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-25 00:11:34,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=4, NotChecked=50, Total=756 [2023-11-25 00:11:34,305 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand has 10 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-25 00:11:34,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:11:34,826 INFO L93 Difference]: Finished difference Result 106 states and 129 transitions. [2023-11-25 00:11:34,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-25 00:11:34,827 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 21 [2023-11-25 00:11:34,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:11:34,828 INFO L225 Difference]: With dead ends: 106 [2023-11-25 00:11:34,828 INFO L226 Difference]: Without dead ends: 106 [2023-11-25 00:11:34,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=109, Invalid=819, Unknown=6, NotChecked=58, Total=992 [2023-11-25 00:11:34,830 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 20 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-25 00:11:34,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 252 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 359 Invalid, 0 Unknown, 100 Unchecked, 0.3s Time] [2023-11-25 00:11:34,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-25 00:11:34,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2023-11-25 00:11:34,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 57 states have (on average 1.8596491228070176) internal successors, (106), 89 states have internal predecessors, (106), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) [2023-11-25 00:11:34,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 129 transitions. [2023-11-25 00:11:34,836 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 129 transitions. Word has length 21 [2023-11-25 00:11:34,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:11:34,836 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 129 transitions. [2023-11-25 00:11:34,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-25 00:11:34,837 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 129 transitions. [2023-11-25 00:11:34,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-25 00:11:34,837 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:11:34,837 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:11:34,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-25 00:11:35,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:11:35,048 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting create_internalErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-25 00:11:35,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:11:35,050 INFO L85 PathProgramCache]: Analyzing trace with hash 784323101, now seen corresponding path program 1 times [2023-11-25 00:11:35,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:11:35,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238518819] [2023-11-25 00:11:35,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:35,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:11:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:35,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:11:35,429 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:11:35,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238518819] [2023-11-25 00:11:35,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238518819] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:11:35,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377240449] [2023-11-25 00:11:35,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:35,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:11:35,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:11:35,431 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:11:35,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-25 00:11:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:35,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-25 00:11:35,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:11:35,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-25 00:11:35,721 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2023-11-25 00:11:35,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:11:35,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-25 00:11:35,750 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-25 00:11:35,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-25 00:11:35,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-25 00:11:35,777 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:11:35,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377240449] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:11:35,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1103768906] [2023-11-25 00:11:35,919 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-11-25 00:11:35,919 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:11:35,920 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:11:35,920 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:11:35,920 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:11:36,029 INFO L197 IcfgInterpreter]: Interpreting procedure create_internal with input of size 68 for LOIs [2023-11-25 00:11:36,490 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero_internal with input of size 140 for LOIs [2023-11-25 00:11:36,609 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 22 for LOIs [2023-11-25 00:11:36,629 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-25 00:11:51,250 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2039#(and (= create_internal_~sll~0.offset 0) (<= 1 |#StackHeapBarrier|) (= create_internal_~now~0.offset 0) (= |create_internal_#t~ret8.offset| 0) (<= (select |#length| create_internal_~now~0.base) 11) (or (and (<= (+ create_internal_~sll~0.base 1) |#StackHeapBarrier|) (exists ((|v_#valid_130| (Array Int Int))) (= (select |v_#valid_130| create_internal_~sll~0.base) 0)) (exists ((|v_#memory_$Pointer$.offset_116| (Array Int (Array Int Int))) (|v_#memory_int_88| (Array Int (Array Int Int))) (|v_#memory_int_89| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_116| (Array Int (Array Int Int))) (|v_#valid_128| (Array Int Int)) (|v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| Int) (|v_#length_110| (Array Int Int))) (and (= |old(#memory_$Pointer$.offset)| (store |v_#memory_$Pointer$.offset_116| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| (store (store (select |v_#memory_$Pointer$.offset_116| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 0 0) 8 0))) (not (= |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 0)) (= |old(#valid)| (store |v_#valid_128| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 1)) (= (store |v_#memory_$Pointer$.base_116| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| (store (store (select |v_#memory_$Pointer$.base_116| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 0 0) 8 0)) |old(#memory_$Pointer$.base)|) (= (store |v_#memory_int_89| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| (store (select |v_#memory_int_89| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 8 (select (select |old(#memory_int)| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 8))) |old(#memory_int)|) (= (select |v_#valid_128| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 0) (= |v_#memory_int_89| (store |v_#memory_int_88| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| (store (select |v_#memory_int_88| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 0 (select (select |v_#memory_int_89| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 0)))) (= |old(#length)| (store |v_#length_110| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 16)) (<= (+ |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|))) (<= (+ |create_internal_#t~ret8.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_90| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_90| |create_internal_#t~ret8.base| (store (select |v_#memory_int_90| |create_internal_#t~ret8.base|) 4 (select (select |#memory_int| |create_internal_#t~ret8.base|) 4))))) (exists ((|v_#length_111| (Array Int Int))) (= (store |v_#length_111| |create_internal_#t~ret8.base| 12) |#length|)) (exists ((|v_old(#memory_int)_AFTER_CALL_17| (Array Int (Array Int Int))) (|v_#memory_int_91| (Array Int (Array Int Int))) (|v_#memory_int_92| (Array Int (Array Int Int)))) (and (<= (select (select |v_old(#memory_int)_AFTER_CALL_17| create_internal_~now~0.base) 0) 2147483647) (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_17| create_internal_~now~0.base) 0) 2147483648)) (= (store |v_#memory_int_92| create_internal_~sll~0.base (store (select |v_#memory_int_92| create_internal_~sll~0.base) 4 (select (select |v_#memory_int_91| create_internal_~sll~0.base) 4))) |v_#memory_int_91|) (= |v_old(#memory_int)_AFTER_CALL_17| (store |v_#memory_int_91| create_internal_~now~0.base (store (select |v_#memory_int_91| create_internal_~now~0.base) 0 (select (select |v_old(#memory_int)_AFTER_CALL_17| create_internal_~now~0.base) 0)))))) (exists ((|v_#memory_$Pointer$.base_120| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_17| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_17| (store (store |v_#memory_$Pointer$.base_120| create_internal_~sll~0.base (store (select |v_#memory_$Pointer$.base_120| create_internal_~sll~0.base) 4 0)) create_internal_~now~0.base (store (select (store |v_#memory_$Pointer$.base_120| create_internal_~sll~0.base (store (select |v_#memory_$Pointer$.base_120| create_internal_~sll~0.base) 4 0)) create_internal_~now~0.base) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_17| create_internal_~now~0.base) 0))))) (exists ((|v_create_internal_#t~nondet7_7| Int)) (and (not (= |v_create_internal_#t~nondet7_7| 0)) (<= 0 (+ |v_create_internal_#t~nondet7_7| 2147483648)) (<= |v_create_internal_#t~nondet7_7| 2147483647))) (exists ((|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_7| (Array Int Int))) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_7| 0) 0)) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_17| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_120| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_17| (store (store |v_#memory_$Pointer$.offset_120| create_internal_~sll~0.base (store (select |v_#memory_$Pointer$.offset_120| create_internal_~sll~0.base) 4 0)) create_internal_~now~0.base (store (select (store |v_#memory_$Pointer$.offset_120| create_internal_~sll~0.base (store (select |v_#memory_$Pointer$.offset_120| create_internal_~sll~0.base) 4 0)) create_internal_~now~0.base) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_17| create_internal_~now~0.base) 0))))) (not (= create_internal_~sll~0.base 0)) (exists ((|v_#memory_$Pointer$.offset_118| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_118| |create_internal_#t~ret8.base| (store (select |v_#memory_$Pointer$.offset_118| |create_internal_#t~ret8.base|) 4 0)))) (= create_internal_~now~0.base create_internal_~sll~0.base) (exists ((|v_#memory_$Pointer$.base_118| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_118| |create_internal_#t~ret8.base| (store (select |v_#memory_$Pointer$.base_118| |create_internal_#t~ret8.base|) 4 0)))) (not (= |create_internal_#t~ret8.base| 0)) (exists ((|v_#valid_129| (Array Int Int))) (and (= |#valid| (store |v_#valid_129| |create_internal_#t~ret8.base| 1)) (= (select |v_#valid_129| |create_internal_#t~ret8.base|) 0)))) (and (<= (+ create_internal_~sll~0.base 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_116| (Array Int (Array Int Int))) (|v_#memory_int_88| (Array Int (Array Int Int))) (|v_#memory_int_89| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_116| (Array Int (Array Int Int))) (|v_#valid_128| (Array Int Int)) (|v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| Int) (|v_#length_110| (Array Int Int))) (and (= |old(#memory_$Pointer$.offset)| (store |v_#memory_$Pointer$.offset_116| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| (store (store (select |v_#memory_$Pointer$.offset_116| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 0 0) 8 0))) (not (= |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 0)) (= |old(#valid)| (store |v_#valid_128| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 1)) (= (store |v_#memory_$Pointer$.base_116| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| (store (store (select |v_#memory_$Pointer$.base_116| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 0 0) 8 0)) |old(#memory_$Pointer$.base)|) (= (store |v_#memory_int_89| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| (store (select |v_#memory_int_89| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 8 (select (select |old(#memory_int)| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 8))) |old(#memory_int)|) (= (select |v_#valid_128| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 0) (= |v_#memory_int_89| (store |v_#memory_int_88| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| (store (select |v_#memory_int_88| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 0 (select (select |v_#memory_int_89| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 0)))) (= |old(#length)| (store |v_#length_110| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 16)) (<= (+ |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|))) (exists ((|v_#valid_131| (Array Int Int))) (and (= (select |v_#valid_131| |create_internal_#t~ret8.base|) 0) (= (store |v_#valid_131| |create_internal_#t~ret8.base| 1) |#valid|))) (<= (+ |create_internal_#t~ret8.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_129| (Array Int Int))) (= (select |v_#valid_129| create_internal_~sll~0.base) 0)) (exists ((|v_old(#memory_int)_AFTER_CALL_18| (Array Int (Array Int Int))) (|v_#memory_int_90| (Array Int (Array Int Int))) (|v_#memory_int_91| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_90| create_internal_~sll~0.base (store (select |v_#memory_int_90| create_internal_~sll~0.base) 4 (select (select |v_#memory_int_91| create_internal_~sll~0.base) 4))) |v_#memory_int_91|) (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_18| create_internal_~now~0.base) 0) 2147483648)) (= |v_old(#memory_int)_AFTER_CALL_18| (store |v_#memory_int_91| create_internal_~now~0.base (store (select |v_#memory_int_91| create_internal_~now~0.base) 0 (select (select |v_old(#memory_int)_AFTER_CALL_18| create_internal_~now~0.base) 0)))) (<= (select (select |v_old(#memory_int)_AFTER_CALL_18| create_internal_~now~0.base) 0) 2147483647))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_18| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_121| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.base_121| create_internal_~sll~0.base (store (select |v_#memory_$Pointer$.base_121| create_internal_~sll~0.base) 4 0)) create_internal_~now~0.base (store (select (store |v_#memory_$Pointer$.base_121| create_internal_~sll~0.base (store (select |v_#memory_$Pointer$.base_121| create_internal_~sll~0.base) 4 0)) create_internal_~now~0.base) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_18| create_internal_~now~0.base) 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_18|)) (exists ((|v_create_internal_#t~nondet7_7| Int)) (and (not (= |v_create_internal_#t~nondet7_7| 0)) (<= 0 (+ |v_create_internal_#t~nondet7_7| 2147483648)) (<= |v_create_internal_#t~nondet7_7| 2147483647))) (exists ((|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_7| (Array Int Int))) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_7| 0) 0)) (not (= create_internal_~sll~0.base 0)) (exists ((|v_#memory_$Pointer$.offset_118| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_118| |create_internal_#t~ret8.base| (store (select |v_#memory_$Pointer$.offset_118| |create_internal_#t~ret8.base|) 4 0)))) (exists ((|v_#memory_$Pointer$.offset_121| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_18| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_18| (store (store |v_#memory_$Pointer$.offset_121| create_internal_~sll~0.base (store (select |v_#memory_$Pointer$.offset_121| create_internal_~sll~0.base) 4 0)) create_internal_~now~0.base (store (select (store |v_#memory_$Pointer$.offset_121| create_internal_~sll~0.base (store (select |v_#memory_$Pointer$.offset_121| create_internal_~sll~0.base) 4 0)) create_internal_~now~0.base) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_18| create_internal_~now~0.base) 0))))) (= create_internal_~now~0.base create_internal_~sll~0.base) (exists ((|v_#memory_$Pointer$.base_118| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_118| |create_internal_#t~ret8.base| (store (select |v_#memory_$Pointer$.base_118| |create_internal_#t~ret8.base|) 4 0)))) (exists ((|v_#memory_int_93| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_93| |create_internal_#t~ret8.base| (store (select |v_#memory_int_93| |create_internal_#t~ret8.base|) 4 (select (select |#memory_int| |create_internal_#t~ret8.base|) 4))))) (exists ((|v_#length_113| (Array Int Int))) (= |#length| (store |v_#length_113| |create_internal_#t~ret8.base| 12))) (not (= |create_internal_#t~ret8.base| 0)))))' at error location [2023-11-25 00:11:51,251 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-25 00:11:51,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-25 00:11:51,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2023-11-25 00:11:51,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876097237] [2023-11-25 00:11:51,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-25 00:11:51,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-25 00:11:51,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:11:51,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-25 00:11:51,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1066, Unknown=6, NotChecked=66, Total=1260 [2023-11-25 00:11:51,253 INFO L87 Difference]: Start difference. First operand 105 states and 129 transitions. Second operand has 17 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-25 00:11:52,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:11:52,009 INFO L93 Difference]: Finished difference Result 110 states and 133 transitions. [2023-11-25 00:11:52,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-25 00:11:52,010 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 21 [2023-11-25 00:11:52,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:11:52,011 INFO L225 Difference]: With dead ends: 110 [2023-11-25 00:11:52,011 INFO L226 Difference]: Without dead ends: 110 [2023-11-25 00:11:52,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=166, Invalid=1392, Unknown=6, NotChecked=76, Total=1640 [2023-11-25 00:11:52,013 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 35 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-25 00:11:52,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 438 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 638 Invalid, 0 Unknown, 104 Unchecked, 0.5s Time] [2023-11-25 00:11:52,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-25 00:11:52,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2023-11-25 00:11:52,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 92 states have internal predecessors, (110), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) [2023-11-25 00:11:52,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 133 transitions. [2023-11-25 00:11:52,019 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 133 transitions. Word has length 21 [2023-11-25 00:11:52,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:11:52,020 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 133 transitions. [2023-11-25 00:11:52,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-25 00:11:52,020 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 133 transitions. [2023-11-25 00:11:52,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-25 00:11:52,021 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:11:52,021 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:11:52,027 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-25 00:11:52,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-25 00:11:52,223 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting create_internalErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-25 00:11:52,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:11:52,225 INFO L85 PathProgramCache]: Analyzing trace with hash 2115282184, now seen corresponding path program 1 times [2023-11-25 00:11:52,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:11:52,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201038161] [2023-11-25 00:11:52,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:52,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:11:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:52,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-25 00:11:52,383 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:11:52,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201038161] [2023-11-25 00:11:52,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201038161] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:11:52,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:11:52,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-25 00:11:52,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979302854] [2023-11-25 00:11:52,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:11:52,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:11:52,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:11:52,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:11:52,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:11:52,385 INFO L87 Difference]: Start difference. First operand 108 states and 133 transitions. Second operand has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-25 00:11:52,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:11:52,546 INFO L93 Difference]: Finished difference Result 107 states and 131 transitions. [2023-11-25 00:11:52,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-25 00:11:52,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2023-11-25 00:11:52,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:11:52,548 INFO L225 Difference]: With dead ends: 107 [2023-11-25 00:11:52,548 INFO L226 Difference]: Without dead ends: 107 [2023-11-25 00:11:52,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-25 00:11:52,549 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 6 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:11:52,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 227 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:11:52,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-25 00:11:52,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-11-25 00:11:52,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 60 states have (on average 1.8) internal successors, (108), 91 states have internal predecessors, (108), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) [2023-11-25 00:11:52,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2023-11-25 00:11:52,554 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 23 [2023-11-25 00:11:52,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:11:52,555 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2023-11-25 00:11:52,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-25 00:11:52,555 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2023-11-25 00:11:52,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-25 00:11:52,556 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:11:52,556 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:11:52,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-25 00:11:52,557 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting create_internalErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-25 00:11:52,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:11:52,557 INFO L85 PathProgramCache]: Analyzing trace with hash 2115282185, now seen corresponding path program 1 times [2023-11-25 00:11:52,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:11:52,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869055282] [2023-11-25 00:11:52,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:52,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:11:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:52,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:11:52,859 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:11:52,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869055282] [2023-11-25 00:11:52,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869055282] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:11:52,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:11:52,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-25 00:11:52,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146539487] [2023-11-25 00:11:52,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:11:52,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-25 00:11:52,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:11:52,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-25 00:11:52,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-25 00:11:52,861 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-25 00:11:53,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:11:53,063 INFO L93 Difference]: Finished difference Result 106 states and 129 transitions. [2023-11-25 00:11:53,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-25 00:11:53,064 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2023-11-25 00:11:53,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:11:53,065 INFO L225 Difference]: With dead ends: 106 [2023-11-25 00:11:53,066 INFO L226 Difference]: Without dead ends: 106 [2023-11-25 00:11:53,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-25 00:11:53,067 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 5 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:11:53,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 285 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:11:53,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-25 00:11:53,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-11-25 00:11:53,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 60 states have (on average 1.7666666666666666) internal successors, (106), 90 states have internal predecessors, (106), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) [2023-11-25 00:11:53,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 129 transitions. [2023-11-25 00:11:53,073 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 129 transitions. Word has length 23 [2023-11-25 00:11:53,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:11:53,073 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 129 transitions. [2023-11-25 00:11:53,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-25 00:11:53,073 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2023-11-25 00:11:53,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-25 00:11:53,074 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:11:53,074 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:11:53,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-25 00:11:53,075 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-25 00:11:53,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:11:53,075 INFO L85 PathProgramCache]: Analyzing trace with hash -813860004, now seen corresponding path program 1 times [2023-11-25 00:11:53,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:11:53,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255892878] [2023-11-25 00:11:53,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:53,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:11:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:53,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:11:53,153 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:11:53,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255892878] [2023-11-25 00:11:53,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255892878] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:11:53,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:11:53,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-25 00:11:53,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048655923] [2023-11-25 00:11:53,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:11:53,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-25 00:11:53,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:11:53,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-25 00:11:53,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-25 00:11:53,155 INFO L87 Difference]: Start difference. First operand 106 states and 129 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-25 00:11:53,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:11:53,319 INFO L93 Difference]: Finished difference Result 125 states and 155 transitions. [2023-11-25 00:11:53,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-25 00:11:53,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-11-25 00:11:53,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:11:53,321 INFO L225 Difference]: With dead ends: 125 [2023-11-25 00:11:53,321 INFO L226 Difference]: Without dead ends: 125 [2023-11-25 00:11:53,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:11:53,322 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 27 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:11:53,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 170 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:11:53,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-25 00:11:53,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 116. [2023-11-25 00:11:53,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 70 states have (on average 1.8) internal successors, (126), 98 states have internal predecessors, (126), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2023-11-25 00:11:53,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 152 transitions. [2023-11-25 00:11:53,328 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 152 transitions. Word has length 24 [2023-11-25 00:11:53,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:11:53,329 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 152 transitions. [2023-11-25 00:11:53,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-25 00:11:53,329 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 152 transitions. [2023-11-25 00:11:53,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-25 00:11:53,330 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:11:53,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:11:53,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-25 00:11:53,330 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-25 00:11:53,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:11:53,330 INFO L85 PathProgramCache]: Analyzing trace with hash -813860003, now seen corresponding path program 1 times [2023-11-25 00:11:53,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:11:53,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068437063] [2023-11-25 00:11:53,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:53,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:11:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:53,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:11:53,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:11:53,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068437063] [2023-11-25 00:11:53,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068437063] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:11:53,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:11:53,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-25 00:11:53,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804159771] [2023-11-25 00:11:53,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:11:53,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-25 00:11:53,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:11:53,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-25 00:11:53,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-25 00:11:53,509 INFO L87 Difference]: Start difference. First operand 116 states and 152 transitions. Second operand has 8 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-25 00:11:53,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:11:53,728 INFO L93 Difference]: Finished difference Result 130 states and 162 transitions. [2023-11-25 00:11:53,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-25 00:11:53,729 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-11-25 00:11:53,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:11:53,731 INFO L225 Difference]: With dead ends: 130 [2023-11-25 00:11:53,731 INFO L226 Difference]: Without dead ends: 130 [2023-11-25 00:11:53,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-25 00:11:53,732 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 23 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:11:53,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 339 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:11:53,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-25 00:11:53,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2023-11-25 00:11:53,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 76 states have (on average 1.7894736842105263) internal successors, (136), 104 states have internal predecessors, (136), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2023-11-25 00:11:53,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 162 transitions. [2023-11-25 00:11:53,740 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 162 transitions. Word has length 24 [2023-11-25 00:11:53,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:11:53,740 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 162 transitions. [2023-11-25 00:11:53,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-25 00:11:53,740 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 162 transitions. [2023-11-25 00:11:53,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-25 00:11:53,741 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:11:53,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:11:53,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-25 00:11:53,742 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-25 00:11:53,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:11:53,742 INFO L85 PathProgramCache]: Analyzing trace with hash 540307341, now seen corresponding path program 1 times [2023-11-25 00:11:53,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:11:53,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406859808] [2023-11-25 00:11:53,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:53,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:11:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:53,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:11:53,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:11:53,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406859808] [2023-11-25 00:11:53,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406859808] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:11:53,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:11:53,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-25 00:11:53,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582429410] [2023-11-25 00:11:53,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:11:53,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-25 00:11:53,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:11:53,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-25 00:11:53,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-25 00:11:53,833 INFO L87 Difference]: Start difference. First operand 122 states and 162 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-25 00:11:53,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:11:53,961 INFO L93 Difference]: Finished difference Result 132 states and 171 transitions. [2023-11-25 00:11:53,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-25 00:11:53,961 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2023-11-25 00:11:53,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:11:53,962 INFO L225 Difference]: With dead ends: 132 [2023-11-25 00:11:53,962 INFO L226 Difference]: Without dead ends: 132 [2023-11-25 00:11:53,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-25 00:11:53,963 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 25 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:11:53,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 345 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:11:53,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-25 00:11:53,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 123. [2023-11-25 00:11:53,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 77 states have (on average 1.7532467532467533) internal successors, (135), 105 states have internal predecessors, (135), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2023-11-25 00:11:53,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 161 transitions. [2023-11-25 00:11:53,969 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 161 transitions. Word has length 25 [2023-11-25 00:11:53,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:11:53,970 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 161 transitions. [2023-11-25 00:11:53,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-25 00:11:53,970 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 161 transitions. [2023-11-25 00:11:53,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-25 00:11:53,971 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:11:53,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:11:53,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-25 00:11:53,971 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-25 00:11:53,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:11:53,971 INFO L85 PathProgramCache]: Analyzing trace with hash -435266289, now seen corresponding path program 1 times [2023-11-25 00:11:53,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:11:53,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610086019] [2023-11-25 00:11:53,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:53,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:11:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:54,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:11:54,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:11:54,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610086019] [2023-11-25 00:11:54,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610086019] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:11:54,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:11:54,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-25 00:11:54,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674476411] [2023-11-25 00:11:54,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:11:54,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-25 00:11:54,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:11:54,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-25 00:11:54,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2023-11-25 00:11:54,404 INFO L87 Difference]: Start difference. First operand 123 states and 161 transitions. Second operand has 14 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-25 00:11:54,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:11:54,835 INFO L93 Difference]: Finished difference Result 140 states and 174 transitions. [2023-11-25 00:11:54,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-25 00:11:54,835 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2023-11-25 00:11:54,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:11:54,837 INFO L225 Difference]: With dead ends: 140 [2023-11-25 00:11:54,837 INFO L226 Difference]: Without dead ends: 140 [2023-11-25 00:11:54,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2023-11-25 00:11:54,838 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 34 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-25 00:11:54,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 470 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-25 00:11:54,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-25 00:11:54,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 128. [2023-11-25 00:11:54,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 82 states have (on average 1.7317073170731707) internal successors, (142), 110 states have internal predecessors, (142), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2023-11-25 00:11:54,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 168 transitions. [2023-11-25 00:11:54,843 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 168 transitions. Word has length 26 [2023-11-25 00:11:54,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:11:54,844 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 168 transitions. [2023-11-25 00:11:54,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-25 00:11:54,844 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 168 transitions. [2023-11-25 00:11:54,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-25 00:11:54,845 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:11:54,845 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:11:54,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-25 00:11:54,845 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-25 00:11:54,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:11:54,846 INFO L85 PathProgramCache]: Analyzing trace with hash -435266288, now seen corresponding path program 1 times [2023-11-25 00:11:54,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:11:54,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143826471] [2023-11-25 00:11:54,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:54,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:11:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:55,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:11:55,415 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:11:55,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143826471] [2023-11-25 00:11:55,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143826471] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:11:55,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:11:55,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-25 00:11:55,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817846939] [2023-11-25 00:11:55,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:11:55,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-25 00:11:55,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:11:55,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-25 00:11:55,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2023-11-25 00:11:55,417 INFO L87 Difference]: Start difference. First operand 128 states and 168 transitions. Second operand has 15 states, 10 states have (on average 2.0) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-25 00:11:55,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:11:55,942 INFO L93 Difference]: Finished difference Result 139 states and 173 transitions. [2023-11-25 00:11:55,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-25 00:11:55,943 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 10 states have (on average 2.0) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2023-11-25 00:11:55,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:11:55,944 INFO L225 Difference]: With dead ends: 139 [2023-11-25 00:11:55,944 INFO L226 Difference]: Without dead ends: 139 [2023-11-25 00:11:55,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2023-11-25 00:11:55,945 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 33 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-25 00:11:55,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 566 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-25 00:11:55,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-11-25 00:11:55,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 128. [2023-11-25 00:11:55,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 82 states have (on average 1.7195121951219512) internal successors, (141), 110 states have internal predecessors, (141), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2023-11-25 00:11:55,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 167 transitions. [2023-11-25 00:11:55,951 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 167 transitions. Word has length 26 [2023-11-25 00:11:55,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:11:55,951 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 167 transitions. [2023-11-25 00:11:55,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 10 states have (on average 2.0) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-25 00:11:55,951 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 167 transitions. [2023-11-25 00:11:55,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-25 00:11:55,952 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:11:55,952 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:11:55,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-25 00:11:55,952 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-25 00:11:55,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:11:55,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1678346618, now seen corresponding path program 1 times [2023-11-25 00:11:55,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:11:55,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148925413] [2023-11-25 00:11:55,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:55,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:11:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:11:57,133 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:11:57,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148925413] [2023-11-25 00:11:57,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148925413] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:11:57,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220993911] [2023-11-25 00:11:57,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:57,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:11:57,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:11:57,139 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:11:57,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-25 00:11:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:57,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-25 00:11:57,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:11:57,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-25 00:11:57,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2023-11-25 00:11:57,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:11:57,652 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-25 00:11:57,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220993911] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:11:57,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-25 00:11:57,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [17] total 27 [2023-11-25 00:11:57,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451352392] [2023-11-25 00:11:57,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:11:57,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-25 00:11:57,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:11:57,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-25 00:11:57,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=642, Unknown=0, NotChecked=0, Total=702 [2023-11-25 00:11:57,654 INFO L87 Difference]: Start difference. First operand 128 states and 167 transitions. Second operand has 12 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-25 00:11:58,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:11:58,001 INFO L93 Difference]: Finished difference Result 140 states and 170 transitions. [2023-11-25 00:11:58,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-25 00:11:58,001 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2023-11-25 00:11:58,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:11:58,002 INFO L225 Difference]: With dead ends: 140 [2023-11-25 00:11:58,003 INFO L226 Difference]: Without dead ends: 140 [2023-11-25 00:11:58,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=76, Invalid=854, Unknown=0, NotChecked=0, Total=930 [2023-11-25 00:11:58,004 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 40 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:11:58,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 529 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:11:58,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-25 00:11:58,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 129. [2023-11-25 00:11:58,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 83 states have (on average 1.6987951807228916) internal successors, (141), 111 states have internal predecessors, (141), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2023-11-25 00:11:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 167 transitions. [2023-11-25 00:11:58,010 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 167 transitions. Word has length 28 [2023-11-25 00:11:58,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:11:58,010 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 167 transitions. [2023-11-25 00:11:58,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-25 00:11:58,010 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 167 transitions. [2023-11-25 00:11:58,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-25 00:11:58,014 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:11:58,014 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:11:58,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-25 00:11:58,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-25 00:11:58,216 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-25 00:11:58,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:11:58,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1678935944, now seen corresponding path program 1 times [2023-11-25 00:11:58,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:11:58,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504573224] [2023-11-25 00:11:58,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:58,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:11:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:59,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:11:59,844 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:11:59,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504573224] [2023-11-25 00:11:59,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504573224] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:11:59,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121906764] [2023-11-25 00:11:59,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:59,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:11:59,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:11:59,847 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:11:59,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a451d254-b212-420e-a77e-2d89c0743360/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-25 00:11:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:59,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 89 conjunts are in the unsatisfiable core [2023-11-25 00:11:59,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:12:00,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-25 00:12:00,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-25 00:12:00,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-25 00:12:00,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:12:00,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-25 00:12:00,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:12:00,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-25 00:12:00,539 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-25 00:12:00,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-25 00:12:00,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2023-11-25 00:12:00,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25