./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E --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 32bit --witnessprinter.graph.data.programhash 583b66b9d59d34de12ff7e58a8eb24a95055476e3f5044dc2a7c6b2bb83f4c67 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:11:04,076 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:11:04,155 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 03:11:04,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:11:04,160 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:11:04,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:11:04,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:11:04,186 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:11:04,187 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:11:04,187 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:11:04,187 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:11:04,187 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:11:04,187 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:11:04,188 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:11:04,188 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:11:04,188 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:11:04,188 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:11:04,188 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:11:04,188 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:11:04,189 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:11:04,189 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:11:04,189 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:11:04,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:11:04,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:11:04,190 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:11:04,190 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:11:04,190 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:11:04,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:11:04,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:11:04,191 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 03:11:04,191 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 03:11:04,191 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 03:11:04,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:11:04,191 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:11:04,191 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:11:04,191 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:11:04,192 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:11:04,192 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:11:04,192 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:11:04,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:11:04,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:11:04,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:11:04,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:11:04,193 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:11:04,193 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:11:04,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:11:04,193 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:11:04,193 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:11:04,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:11:04,194 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 583b66b9d59d34de12ff7e58a8eb24a95055476e3f5044dc2a7c6b2bb83f4c67 [2024-11-14 03:11:04,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:11:04,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:11:04,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:11:04,552 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:11:04,553 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:11:04,556 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i Unable to find full path for "g++" [2024-11-14 03:11:06,639 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:11:06,983 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:11:06,987 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2024-11-14 03:11:07,011 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/data/ba7dedd88/788774283857439cb086581859e6f5bd/FLAG678e2b771 [2024-11-14 03:11:07,027 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/data/ba7dedd88/788774283857439cb086581859e6f5bd [2024-11-14 03:11:07,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:11:07,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:11:07,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:11:07,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:11:07,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:11:07,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:11:07" (1/1) ... [2024-11-14 03:11:07,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d79da84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:11:07, skipping insertion in model container [2024-11-14 03:11:07,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:11:07" (1/1) ... [2024-11-14 03:11:07,077 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:11:07,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:11:07,561 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:11:07,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:11:07,693 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:11:07,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:11:07 WrapperNode [2024-11-14 03:11:07,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:11:07,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:11:07,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:11:07,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:11:07,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:11:07" (1/1) ... [2024-11-14 03:11:07,734 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:11:07" (1/1) ... [2024-11-14 03:11:07,781 INFO L138 Inliner]: procedures = 127, calls = 50, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 151 [2024-11-14 03:11:07,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:11:07,785 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:11:07,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:11:07,786 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:11:07,796 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:11:07" (1/1) ... [2024-11-14 03:11:07,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:11:07" (1/1) ... [2024-11-14 03:11:07,808 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:11:07" (1/1) ... [2024-11-14 03:11:07,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:11:07" (1/1) ... [2024-11-14 03:11:07,830 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:11:07" (1/1) ... [2024-11-14 03:11:07,838 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:11:07" (1/1) ... [2024-11-14 03:11:07,840 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:11:07" (1/1) ... [2024-11-14 03:11:07,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:11:07" (1/1) ... [2024-11-14 03:11:07,850 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:11:07,851 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:11:07,851 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:11:07,852 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:11:07,855 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:11:07" (1/1) ... [2024-11-14 03:11:07,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:11:07,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:11:07,893 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:11:07,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:11:07,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 03:11:07,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 03:11:07,934 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-14 03:11:07,934 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-14 03:11:07,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 03:11:07,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:11:07,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 03:11:07,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 03:11:07,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 03:11:07,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 03:11:07,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 03:11:07,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:11:07,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:11:07,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:11:08,086 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:11:08,088 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:11:08,689 INFO L? ?]: Removed 156 outVars from TransFormulas that were not future-live. [2024-11-14 03:11:08,690 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:11:08,811 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:11:08,811 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-14 03:11:08,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:11:08 BoogieIcfgContainer [2024-11-14 03:11:08,811 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:11:08,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:11:08,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:11:08,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:11:08,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:11:07" (1/3) ... [2024-11-14 03:11:08,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e93683b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:11:08, skipping insertion in model container [2024-11-14 03:11:08,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:11:07" (2/3) ... [2024-11-14 03:11:08,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e93683b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:11:08, skipping insertion in model container [2024-11-14 03:11:08,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:11:08" (3/3) ... [2024-11-14 03:11:08,830 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_unequal.i [2024-11-14 03:11:08,849 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:11:08,853 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_prepend_unequal.i that has 2 procedures, 127 locations, 1 initial locations, 3 loop locations, and 64 error locations. [2024-11-14 03:11:08,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:11:08,934 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@125cf51b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:11:08,935 INFO L334 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2024-11-14 03:11:08,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 58 states have (on average 2.310344827586207) internal successors, (134), 122 states have internal predecessors, (134), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:11:08,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 03:11:08,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:11:08,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-14 03:11:08,951 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-14 03:11:08,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:11:08,958 INFO L85 PathProgramCache]: Analyzing trace with hash 243851440, now seen corresponding path program 1 times [2024-11-14 03:11:08,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:11:08,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87378483] [2024-11-14 03:11:08,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:11:08,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:11:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:11:09,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:11:09,228 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:11:09,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87378483] [2024-11-14 03:11:09,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87378483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:11:09,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:11:09,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:11:09,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683178177] [2024-11-14 03:11:09,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:11:09,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:11:09,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:11:09,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:11:09,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:11:09,274 INFO L87 Difference]: Start difference. First operand has 127 states, 58 states have (on average 2.310344827586207) internal successors, (134), 122 states have internal predecessors, (134), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-14 03:11:09,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:11:09,535 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2024-11-14 03:11:09,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:11:09,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-11-14 03:11:09,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:11:09,552 INFO L225 Difference]: With dead ends: 123 [2024-11-14 03:11:09,553 INFO L226 Difference]: Without dead ends: 121 [2024-11-14 03:11:09,555 INFO L431 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 [2024-11-14 03:11:09,561 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:11:09,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 175 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:11:09,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-14 03:11:09,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-14 03:11:09,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 56 states have (on average 2.2142857142857144) internal successors, (124), 116 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:11:09,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2024-11-14 03:11:09,623 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 5 [2024-11-14 03:11:09,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:11:09,623 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2024-11-14 03:11:09,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-14 03:11:09,624 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2024-11-14 03:11:09,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 03:11:09,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:11:09,624 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-14 03:11:09,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:11:09,625 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-14 03:11:09,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:11:09,626 INFO L85 PathProgramCache]: Analyzing trace with hash 243851441, now seen corresponding path program 1 times [2024-11-14 03:11:09,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:11:09,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642999426] [2024-11-14 03:11:09,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:11:09,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:11:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:11:09,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:11:09,853 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:11:09,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642999426] [2024-11-14 03:11:09,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642999426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:11:09,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:11:09,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:11:09,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524461140] [2024-11-14 03:11:09,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:11:09,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:11:09,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:11:09,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:11:09,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:11:09,857 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-14 03:11:10,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:11:10,046 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2024-11-14 03:11:10,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:11:10,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-11-14 03:11:10,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:11:10,048 INFO L225 Difference]: With dead ends: 118 [2024-11-14 03:11:10,048 INFO L226 Difference]: Without dead ends: 118 [2024-11-14 03:11:10,049 INFO L431 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 [2024-11-14 03:11:10,051 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 2 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:11:10,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 179 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:11:10,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-14 03:11:10,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-14 03:11:10,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 56 states have (on average 2.1607142857142856) internal successors, (121), 113 states have internal predecessors, (121), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:11:10,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2024-11-14 03:11:10,067 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 5 [2024-11-14 03:11:10,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:11:10,067 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2024-11-14 03:11:10,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-14 03:11:10,067 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2024-11-14 03:11:10,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 03:11:10,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:11:10,068 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:11:10,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 03:11:10,069 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-14 03:11:10,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:11:10,069 INFO L85 PathProgramCache]: Analyzing trace with hash 223441649, now seen corresponding path program 1 times [2024-11-14 03:11:10,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:11:10,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685864960] [2024-11-14 03:11:10,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:11:10,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:11:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:11:10,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:11:10,186 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:11:10,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685864960] [2024-11-14 03:11:10,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685864960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:11:10,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:11:10,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:11:10,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194288660] [2024-11-14 03:11:10,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:11:10,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:11:10,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:11:10,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:11:10,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:11:10,189 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:11:10,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:11:10,246 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2024-11-14 03:11:10,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:11:10,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-14 03:11:10,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:11:10,247 INFO L225 Difference]: With dead ends: 129 [2024-11-14 03:11:10,248 INFO L226 Difference]: Without dead ends: 129 [2024-11-14 03:11:10,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:11:10,249 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 10 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:11:10,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 220 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:11:10,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-14 03:11:10,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 119. [2024-11-14 03:11:10,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 57 states have (on average 2.1403508771929824) internal successors, (122), 114 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:11:10,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2024-11-14 03:11:10,294 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 11 [2024-11-14 03:11:10,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:11:10,295 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2024-11-14 03:11:10,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:11:10,295 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2024-11-14 03:11:10,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 03:11:10,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:11:10,299 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:11:10,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 03:11:10,299 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-14 03:11:10,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:11:10,300 INFO L85 PathProgramCache]: Analyzing trace with hash -17252929, now seen corresponding path program 1 times [2024-11-14 03:11:10,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:11:10,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376512484] [2024-11-14 03:11:10,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:11:10,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:11:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:11:10,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:11:10,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:11:10,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376512484] [2024-11-14 03:11:10,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376512484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:11:10,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:11:10,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:11:10,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091702126] [2024-11-14 03:11:10,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:11:10,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:11:10,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:11:10,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:11:10,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:11:10,573 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:11:10,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:11:10,930 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2024-11-14 03:11:10,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:11:10,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-14 03:11:10,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:11:10,932 INFO L225 Difference]: With dead ends: 118 [2024-11-14 03:11:10,935 INFO L226 Difference]: Without dead ends: 118 [2024-11-14 03:11:10,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:11:10,936 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 7 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:11:10,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 328 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:11:10,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-14 03:11:10,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-14 03:11:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 57 states have (on average 2.1228070175438596) internal successors, (121), 113 states have internal predecessors, (121), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:11:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2024-11-14 03:11:10,955 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 19 [2024-11-14 03:11:10,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:11:10,955 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2024-11-14 03:11:10,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:11:10,955 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2024-11-14 03:11:10,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 03:11:10,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:11:10,956 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:11:10,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 03:11:10,957 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-14 03:11:10,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:11:10,961 INFO L85 PathProgramCache]: Analyzing trace with hash -17252928, now seen corresponding path program 1 times [2024-11-14 03:11:10,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:11:10,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477176375] [2024-11-14 03:11:10,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:11:10,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:11:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:11:11,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:11:11,421 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:11:11,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477176375] [2024-11-14 03:11:11,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477176375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:11:11,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:11:11,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:11:11,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177753998] [2024-11-14 03:11:11,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:11:11,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:11:11,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:11:11,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:11:11,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:11:11,423 INFO L87 Difference]: Start difference. First operand 118 states and 127 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, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:11:11,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:11:11,706 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2024-11-14 03:11:11,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:11:11,707 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, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-14 03:11:11,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:11:11,710 INFO L225 Difference]: With dead ends: 117 [2024-11-14 03:11:11,710 INFO L226 Difference]: Without dead ends: 117 [2024-11-14 03:11:11,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:11:11,712 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 6 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:11:11,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 352 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:11:11,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-14 03:11:11,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-14 03:11:11,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 57 states have (on average 2.1052631578947367) internal successors, (120), 112 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:11:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2024-11-14 03:11:11,731 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 19 [2024-11-14 03:11:11,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:11:11,732 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2024-11-14 03:11:11,732 INFO L472 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, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:11:11,732 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2024-11-14 03:11:11,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 03:11:11,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:11:11,733 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:11:11,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 03:11:11,733 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-14 03:11:11,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:11:11,734 INFO L85 PathProgramCache]: Analyzing trace with hash 599804096, now seen corresponding path program 1 times [2024-11-14 03:11:11,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:11:11,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925669345] [2024-11-14 03:11:11,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:11:11,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:11:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:11:12,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:11:12,176 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:11:12,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925669345] [2024-11-14 03:11:12,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925669345] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:11:12,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059009227] [2024-11-14 03:11:12,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:11:12,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:11:12,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:11:12,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:11:12,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 03:11:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:11:12,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-14 03:11:12,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:11:12,405 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 [2024-11-14 03:11:12,487 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-14 03:11:12,587 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-14 03:11:12,587 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 [2024-11-14 03:11:12,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-14 03:11:12,604 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:11:12,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059009227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:11:12,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [186372037] [2024-11-14 03:11:12,730 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-14 03:11:12,730 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:11:12,734 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:11:12,739 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:11:12,739 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:11:14,421 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-14 03:11:15,364 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:11:30,396 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1436#(and (not (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.offset_91| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_91| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_91| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 0)))) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) 1)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_#memory_int_68| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_68| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_int_68| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))))) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_91| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_91| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_91| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) |#memory_$Pointer$.base|)) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-14 03:11:30,397 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:11:30,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:11:30,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2024-11-14 03:11:30,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771503255] [2024-11-14 03:11:30,397 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:11:30,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 03:11:30,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:11:30,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 03:11:30,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=476, Unknown=3, NotChecked=44, Total=600 [2024-11-14 03:11:30,399 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:11:31,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:11:31,594 INFO L93 Difference]: Finished difference Result 122 states and 134 transitions. [2024-11-14 03:11:31,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:11:31,595 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-11-14 03:11:31,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:11:31,596 INFO L225 Difference]: With dead ends: 122 [2024-11-14 03:11:31,596 INFO L226 Difference]: Without dead ends: 122 [2024-11-14 03:11:31,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=91, Invalid=560, Unknown=3, NotChecked=48, Total=702 [2024-11-14 03:11:31,598 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 2 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:11:31,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 470 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 505 Invalid, 0 Unknown, 129 Unchecked, 1.0s Time] [2024-11-14 03:11:31,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-14 03:11:31,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-14 03:11:31,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 61 states have (on average 2.0655737704918034) internal successors, (126), 116 states have internal predecessors, (126), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:11:31,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2024-11-14 03:11:31,607 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 21 [2024-11-14 03:11:31,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:11:31,607 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2024-11-14 03:11:31,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:11:31,608 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2024-11-14 03:11:31,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 03:11:31,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:11:31,608 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:11:31,631 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 03:11:31,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-14 03:11:31,813 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-14 03:11:31,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:11:31,813 INFO L85 PathProgramCache]: Analyzing trace with hash 599804097, now seen corresponding path program 1 times [2024-11-14 03:11:31,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:11:31,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883150483] [2024-11-14 03:11:31,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:11:31,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:11:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:11:32,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:11:32,417 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:11:32,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883150483] [2024-11-14 03:11:32,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883150483] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:11:32,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75899054] [2024-11-14 03:11:32,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:11:32,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:11:32,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:11:32,420 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:11:32,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 03:11:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:11:32,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-14 03:11:32,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:11:32,586 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 8 treesize of output 1 [2024-11-14 03:11:32,597 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 [2024-11-14 03:11:32,958 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-14 03:11:33,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:11:33,034 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 14 treesize of output 9 [2024-11-14 03:11:33,057 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:11:33,058 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 [2024-11-14 03:11:33,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-14 03:11:33,139 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:11:33,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75899054] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:11:33,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [293680501] [2024-11-14 03:11:33,421 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-14 03:11:33,421 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:11:33,422 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:11:33,422 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:11:33,422 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:11:34,155 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-14 03:11:34,923 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:11:50,635 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1790#(and (not (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_#memory_$Pointer$.base_105| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_105| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_105| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) |#memory_$Pointer$.base|)) (<= 1 |#StackHeapBarrier|) (exists ((|v_#memory_int_82| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_82| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_int_82| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))))) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (exists ((|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_105| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_105| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 0)))) (<= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) 7) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-14 03:11:50,635 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:11:50,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:11:50,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-14 03:11:50,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772100570] [2024-11-14 03:11:50,635 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:11:50,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-14 03:11:50,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:11:50,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-14 03:11:50,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=774, Unknown=3, NotChecked=56, Total=930 [2024-11-14 03:11:50,637 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand has 16 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:11:52,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:11:52,388 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2024-11-14 03:11:52,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:11:52,390 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 21 [2024-11-14 03:11:52,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:11:52,391 INFO L225 Difference]: With dead ends: 122 [2024-11-14 03:11:52,391 INFO L226 Difference]: Without dead ends: 122 [2024-11-14 03:11:52,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=125, Invalid=998, Unknown=3, NotChecked=64, Total=1190 [2024-11-14 03:11:52,392 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:11:52,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 613 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 738 Invalid, 0 Unknown, 128 Unchecked, 1.4s Time] [2024-11-14 03:11:52,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-14 03:11:52,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-14 03:11:52,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 61 states have (on average 2.0491803278688523) internal successors, (125), 116 states have internal predecessors, (125), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:11:52,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2024-11-14 03:11:52,405 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 21 [2024-11-14 03:11:52,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:11:52,406 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2024-11-14 03:11:52,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:11:52,406 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2024-11-14 03:11:52,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 03:11:52,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:11:52,411 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:11:52,431 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 03:11:52,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-14 03:11:52,611 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-14 03:11:52,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:11:52,612 INFO L85 PathProgramCache]: Analyzing trace with hash 886279638, now seen corresponding path program 1 times [2024-11-14 03:11:52,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:11:52,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538502875] [2024-11-14 03:11:52,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:11:52,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:11:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:11:52,784 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:11:52,784 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:11:52,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538502875] [2024-11-14 03:11:52,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538502875] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:11:52,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756085219] [2024-11-14 03:11:52,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:11:52,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:11:52,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:11:52,787 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:11:52,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 03:11:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:11:52,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-14 03:11:52,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:11:53,003 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:11:53,003 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:11:53,091 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:11:53,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756085219] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:11:53,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1320877465] [2024-11-14 03:11:53,095 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-14 03:11:53,098 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:11:53,099 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:11:53,099 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:11:53,099 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:11:53,716 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2024-11-14 03:11:53,804 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:12:11,291 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2193#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_19| Int)) (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_19|) 1))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-14 03:12:11,291 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:12:11,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:12:11,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-14 03:12:11,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185357609] [2024-11-14 03:12:11,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:12:11,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:12:11,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:12:11,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:12:11,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=355, Unknown=7, NotChecked=0, Total=420 [2024-11-14 03:12:11,293 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:12:11,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:12:11,544 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2024-11-14 03:12:11,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:12:11,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-14 03:12:11,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:12:11,545 INFO L225 Difference]: With dead ends: 122 [2024-11-14 03:12:11,545 INFO L226 Difference]: Without dead ends: 122 [2024-11-14 03:12:11,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=58, Invalid=355, Unknown=7, NotChecked=0, Total=420 [2024-11-14 03:12:11,547 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 1 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:12:11,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 511 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:12:11,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-14 03:12:11,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-14 03:12:11,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 116 states have internal predecessors, (124), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:12:11,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2024-11-14 03:12:11,560 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 23 [2024-11-14 03:12:11,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:12:11,560 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2024-11-14 03:12:11,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:12:11,561 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2024-11-14 03:12:11,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 03:12:11,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:12:11,565 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:12:11,593 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 03:12:11,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-14 03:12:11,766 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-14 03:12:11,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:12:11,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1699876018, now seen corresponding path program 1 times [2024-11-14 03:12:11,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:12:11,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304979925] [2024-11-14 03:12:11,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:12:11,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:12:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:12:11,917 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 03:12:11,917 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:12:11,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304979925] [2024-11-14 03:12:11,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304979925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:12:11,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393378767] [2024-11-14 03:12:11,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:12:11,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:12:11,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:12:11,921 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:12:11,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 03:12:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:12:12,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-14 03:12:12,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:12:12,104 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 [2024-11-14 03:12:12,232 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-14 03:12:12,307 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-14 03:12:12,307 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 [2024-11-14 03:12:12,333 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2024-11-14 03:12:12,334 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:12:12,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393378767] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:12:12,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1893176187] [2024-11-14 03:12:12,453 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 03:12:12,454 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:12:12,454 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:12:12,454 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:12:12,454 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:12:13,366 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-14 03:12:13,851 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:12:36,036 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2556#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_20| Int)) (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_20|) 1))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-14 03:12:36,036 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:12:36,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:12:36,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2024-11-14 03:12:36,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261849246] [2024-11-14 03:12:36,037 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:12:36,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 03:12:36,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:12:36,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 03:12:36,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=570, Unknown=6, NotChecked=48, Total=702 [2024-11-14 03:12:36,039 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand has 10 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:12:37,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:12:37,046 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2024-11-14 03:12:37,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:12:37,046 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-11-14 03:12:37,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:12:37,047 INFO L225 Difference]: With dead ends: 121 [2024-11-14 03:12:37,047 INFO L226 Difference]: Without dead ends: 121 [2024-11-14 03:12:37,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=95, Invalid=715, Unknown=6, NotChecked=54, Total=870 [2024-11-14 03:12:37,049 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 9 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:12:37,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 415 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 428 Invalid, 0 Unknown, 126 Unchecked, 0.8s Time] [2024-11-14 03:12:37,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-14 03:12:37,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-14 03:12:37,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 61 states have (on average 2.0163934426229506) internal successors, (123), 115 states have internal predecessors, (123), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:12:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2024-11-14 03:12:37,056 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 24 [2024-11-14 03:12:37,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:12:37,057 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2024-11-14 03:12:37,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:12:37,057 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2024-11-14 03:12:37,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 03:12:37,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:12:37,058 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:12:37,082 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 03:12:37,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:12:37,260 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-14 03:12:37,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:12:37,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1699876019, now seen corresponding path program 1 times [2024-11-14 03:12:37,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:12:37,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858045075] [2024-11-14 03:12:37,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:12:37,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:12:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:12:37,721 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:12:37,721 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:12:37,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858045075] [2024-11-14 03:12:37,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858045075] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:12:37,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200886218] [2024-11-14 03:12:37,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:12:37,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:12:37,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:12:37,726 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:12:37,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 03:12:37,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:12:37,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 03:12:37,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:12:37,903 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 8 treesize of output 1 [2024-11-14 03:12:37,922 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 [2024-11-14 03:12:38,268 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-14 03:12:38,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:12:38,329 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 14 treesize of output 9 [2024-11-14 03:12:38,354 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:12:38,354 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 [2024-11-14 03:12:38,448 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-14 03:12:38,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:12:38,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200886218] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:12:38,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [114003572] [2024-11-14 03:12:38,718 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 03:12:38,718 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:12:38,718 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:12:38,718 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:12:38,718 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:12:39,453 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-14 03:12:39,815 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:12:56,198 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2930#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_21| Int)) (<= (select |#length| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_21|) 3)) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-14 03:12:56,198 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:12:56,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:12:56,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-11-14 03:12:56,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801785375] [2024-11-14 03:12:56,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:12:56,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 03:12:56,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:12:56,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 03:12:56,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=887, Unknown=3, NotChecked=60, Total=1056 [2024-11-14 03:12:56,200 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 15 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:12:57,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:12:57,890 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2024-11-14 03:12:57,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 03:12:57,890 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-11-14 03:12:57,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:12:57,893 INFO L225 Difference]: With dead ends: 138 [2024-11-14 03:12:57,893 INFO L226 Difference]: Without dead ends: 138 [2024-11-14 03:12:57,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=137, Invalid=1124, Unknown=3, NotChecked=68, Total=1332 [2024-11-14 03:12:57,894 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 12 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:12:57,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 787 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 682 Invalid, 0 Unknown, 148 Unchecked, 1.4s Time] [2024-11-14 03:12:57,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-14 03:12:57,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 131. [2024-11-14 03:12:57,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 70 states have (on average 1.957142857142857) internal successors, (137), 124 states have internal predecessors, (137), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-14 03:12:57,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 147 transitions. [2024-11-14 03:12:57,904 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 147 transitions. Word has length 24 [2024-11-14 03:12:57,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:12:57,905 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 147 transitions. [2024-11-14 03:12:57,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:12:57,905 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 147 transitions. [2024-11-14 03:12:57,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 03:12:57,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:12:57,908 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:12:57,932 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 03:12:58,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-14 03:12:58,108 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-14 03:12:58,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:12:58,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1156549010, now seen corresponding path program 1 times [2024-11-14 03:12:58,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:12:58,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197756128] [2024-11-14 03:12:58,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:12:58,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:12:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:12:58,359 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:12:58,359 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:12:58,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197756128] [2024-11-14 03:12:58,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197756128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:12:58,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:12:58,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:12:58,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849996417] [2024-11-14 03:12:58,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:12:58,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:12:58,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:12:58,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:12:58,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:12:58,361 INFO L87 Difference]: Start difference. First operand 131 states and 147 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:12:59,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:12:59,095 INFO L93 Difference]: Finished difference Result 130 states and 146 transitions. [2024-11-14 03:12:59,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:12:59,096 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-14 03:12:59,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:12:59,097 INFO L225 Difference]: With dead ends: 130 [2024-11-14 03:12:59,097 INFO L226 Difference]: Without dead ends: 130 [2024-11-14 03:12:59,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:12:59,097 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 6 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:12:59,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 378 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 03:12:59,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-14 03:12:59,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-14 03:12:59,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 70 states have (on average 1.9428571428571428) internal successors, (136), 123 states have internal predecessors, (136), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-14 03:12:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 146 transitions. [2024-11-14 03:12:59,103 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 146 transitions. Word has length 25 [2024-11-14 03:12:59,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:12:59,104 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 146 transitions. [2024-11-14 03:12:59,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:12:59,104 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 146 transitions. [2024-11-14 03:12:59,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 03:12:59,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:12:59,105 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:12:59,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 03:12:59,105 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-14 03:12:59,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:12:59,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1156549011, now seen corresponding path program 1 times [2024-11-14 03:12:59,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:12:59,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421955680] [2024-11-14 03:12:59,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:12:59,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:12:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:12:59,507 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:12:59,508 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:12:59,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421955680] [2024-11-14 03:12:59,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421955680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:12:59,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:12:59,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:12:59,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201003561] [2024-11-14 03:12:59,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:12:59,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:12:59,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:12:59,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:12:59,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:12:59,511 INFO L87 Difference]: Start difference. First operand 130 states and 146 transitions. Second operand has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:13:00,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:13:00,234 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2024-11-14 03:13:00,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:13:00,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-14 03:13:00,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:13:00,235 INFO L225 Difference]: With dead ends: 129 [2024-11-14 03:13:00,235 INFO L226 Difference]: Without dead ends: 129 [2024-11-14 03:13:00,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:13:00,236 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 5 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:13:00,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 403 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 03:13:00,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-14 03:13:00,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-14 03:13:00,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 70 states have (on average 1.9285714285714286) internal successors, (135), 122 states have internal predecessors, (135), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-14 03:13:00,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 145 transitions. [2024-11-14 03:13:00,241 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 145 transitions. Word has length 25 [2024-11-14 03:13:00,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:13:00,243 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 145 transitions. [2024-11-14 03:13:00,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:13:00,244 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 145 transitions. [2024-11-14 03:13:00,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 03:13:00,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:13:00,248 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:13:00,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 03:13:00,249 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-14 03:13:00,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:13:00,249 INFO L85 PathProgramCache]: Analyzing trace with hash 326286692, now seen corresponding path program 1 times [2024-11-14 03:13:00,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:13:00,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50332663] [2024-11-14 03:13:00,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:00,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:13:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:01,107 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:13:01,107 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:13:01,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50332663] [2024-11-14 03:13:01,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50332663] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:13:01,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134582446] [2024-11-14 03:13:01,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:01,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:13:01,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:13:01,110 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:13:01,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 03:13:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:01,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-14 03:13:01,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:13:01,320 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 [2024-11-14 03:13:01,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-14 03:13:01,359 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-11-14 03:13:01,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:01,410 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 14 treesize of output 9 [2024-11-14 03:13:01,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-14 03:13:01,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:01,538 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 14 treesize of output 9 [2024-11-14 03:13:01,607 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-14 03:13:01,654 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-14 03:13:01,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-14 03:13:01,691 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 10 not checked. [2024-11-14 03:13:01,691 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:13:02,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134582446] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:13:02,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [286489026] [2024-11-14 03:13:02,084 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-14 03:13:02,084 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:13:02,085 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:13:02,085 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:13:02,085 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:13:03,132 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2024-11-14 03:13:03,183 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:13:16,094 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3925#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_24| Int)) (and (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_24|) 1)) (or (and (exists ((|v_#memory_$Pointer$.offset_189| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_189| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_189| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8))))) (exists ((|v_#memory_$Pointer$.base_189| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_189| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.base_189| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8))) |#memory_$Pointer$.base|)) (exists ((|v_old(#length)_AFTER_CALL_47| (Array Int Int)) (|v_#memory_$Pointer$.base_195| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_47| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_#memory_$Pointer$.offset_195| (Array Int (Array Int Int))) (|v_#memory_int_172| (Array Int (Array Int Int))) (|v_#memory_int_173| (Array Int (Array Int Int)))) (and (= (store (store |v_#memory_$Pointer$.base_195| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_195| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_195| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_195| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_47|) (= (store |v_#memory_int_172| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_172| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_173| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_173|) (<= 8 (select |v_old(#length)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select |v_old(#valid)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (select (select (store (store |v_#memory_$Pointer$.offset_195| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_195| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_195| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_195| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_47| (store |v_#memory_int_173| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_173| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select |v_old(#valid)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (<= 4 (select |v_old(#length)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))))) (not (= |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 0)) (exists ((|v_#length_154| (Array Int Int))) (= (store |v_#length_154| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 12) |#length|)) (<= (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (= |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_24| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_166| (Array Int (Array Int Int))) (|v_#memory_int_167| (Array Int (Array Int Int))) (|v_#memory_int_168| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_166| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_166| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_167| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_167|) (= |v_#memory_int_168| (store |v_#memory_int_167| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_167| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_168| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_168| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_168| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8 5))))) (exists ((|v_#valid_182| (Array Int Int))) (and (= (select |v_#valid_182| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0) (= (store |v_#valid_182| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1) |#valid|)))) (and (exists ((|v_#memory_$Pointer$.offset_189| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_189| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_189| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8))))) (exists ((|v_#memory_$Pointer$.base_189| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_189| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.base_189| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8))) |#memory_$Pointer$.base|)) (not (= |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 0)) (exists ((|v_#length_154| (Array Int Int))) (= (store |v_#length_154| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 12) |#length|)) (<= (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (= |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_24| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_166| (Array Int (Array Int Int))) (|v_#memory_int_167| (Array Int (Array Int Int))) (|v_#memory_int_168| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_166| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_166| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_167| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_167|) (= |v_#memory_int_168| (store |v_#memory_int_167| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_167| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_168| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_168| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_168| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8 5))))) (exists ((|v_#memory_$Pointer$.base_195| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_46| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_#memory_$Pointer$.offset_195| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (Array Int (Array Int Int))) (|v_#memory_int_172| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_80| (Array Int Int)) (|v_#memory_int_173| (Array Int (Array Int Int)))) (and (= (select |v_old(#valid)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (select (select (store (store |v_#memory_$Pointer$.offset_195| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_195| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_195| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_195| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (<= 4 (select |v_#length_BEFORE_CALL_80| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (<= 8 (select |v_#length_BEFORE_CALL_80| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |v_#memory_int_173| (store |v_#memory_int_172| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_172| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_173| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0)))) (= |v_old(#memory_int)_AFTER_CALL_46| (store |v_#memory_int_173| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_173| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (store (store |v_#memory_$Pointer$.base_195| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_195| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_195| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_195| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))))) (exists ((|v_#valid_182| (Array Int Int))) (and (= (select |v_#valid_182| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0) (= (store |v_#valid_182| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1) |#valid|))))))) (= |ULTIMATE.start_dll_circular_prepend_~head#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_prepend_~data#1| 5) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 03:13:16,094 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:13:16,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:13:16,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 13 [2024-11-14 03:13:16,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328144402] [2024-11-14 03:13:16,094 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:13:16,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 03:13:16,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:13:16,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 03:13:16,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1081, Unknown=3, NotChecked=134, Total=1332 [2024-11-14 03:13:16,096 INFO L87 Difference]: Start difference. First operand 129 states and 145 transitions. Second operand has 15 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-14 03:13:17,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:13:17,822 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2024-11-14 03:13:17,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:13:17,823 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 34 [2024-11-14 03:13:17,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:13:17,824 INFO L225 Difference]: With dead ends: 138 [2024-11-14 03:13:17,824 INFO L226 Difference]: Without dead ends: 138 [2024-11-14 03:13:17,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=137, Invalid=1274, Unknown=3, NotChecked=146, Total=1560 [2024-11-14 03:13:17,826 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 103 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 254 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:13:17,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 316 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 508 Invalid, 0 Unknown, 254 Unchecked, 1.4s Time] [2024-11-14 03:13:17,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-14 03:13:17,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 121. [2024-11-14 03:13:17,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 70 states have (on average 1.8142857142857143) internal successors, (127), 114 states have internal predecessors, (127), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-14 03:13:17,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 137 transitions. [2024-11-14 03:13:17,845 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 137 transitions. Word has length 34 [2024-11-14 03:13:17,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:13:17,846 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 137 transitions. [2024-11-14 03:13:17,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-14 03:13:17,846 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 137 transitions. [2024-11-14 03:13:17,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 03:13:17,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:13:17,851 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:13:17,887 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 03:13:18,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-14 03:13:18,052 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-14 03:13:18,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:13:18,052 INFO L85 PathProgramCache]: Analyzing trace with hash 326286693, now seen corresponding path program 1 times [2024-11-14 03:13:18,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:13:18,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554932409] [2024-11-14 03:13:18,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:18,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:13:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:19,027 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 03:13:19,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:13:19,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554932409] [2024-11-14 03:13:19,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554932409] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:13:19,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127849247] [2024-11-14 03:13:19,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:19,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:13:19,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:13:19,030 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:13:19,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 03:13:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:19,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 03:13:19,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:13:19,245 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 8 treesize of output 1 [2024-11-14 03:13:19,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-14 03:13:19,322 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-14 03:13:19,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:19,381 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 14 treesize of output 9 [2024-11-14 03:13:19,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-14 03:13:19,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:19,510 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 14 treesize of output 9 [2024-11-14 03:13:19,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-14 03:13:19,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:19,828 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 14 treesize of output 9 [2024-11-14 03:13:19,894 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-14 03:13:19,895 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:13:19,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127849247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:13:19,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:13:19,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2024-11-14 03:13:19,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609362238] [2024-11-14 03:13:19,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:13:19,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:13:19,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:13:19,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:13:19,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=170, Unknown=1, NotChecked=26, Total=240 [2024-11-14 03:13:19,896 INFO L87 Difference]: Start difference. First operand 121 states and 137 transitions. Second operand has 7 states, 5 states have (on average 3.6) 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) [2024-11-14 03:13:20,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:13:20,300 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2024-11-14 03:13:20,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:13:20,300 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) 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 34 [2024-11-14 03:13:20,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:13:20,301 INFO L225 Difference]: With dead ends: 116 [2024-11-14 03:13:20,301 INFO L226 Difference]: Without dead ends: 116 [2024-11-14 03:13:20,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=192, Unknown=1, NotChecked=28, Total=272 [2024-11-14 03:13:20,302 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 13 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:13:20,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 222 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 168 Invalid, 0 Unknown, 135 Unchecked, 0.4s Time] [2024-11-14 03:13:20,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-14 03:13:20,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-14 03:13:20,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 70 states have (on average 1.7428571428571429) internal successors, (122), 109 states have internal predecessors, (122), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-14 03:13:20,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 132 transitions. [2024-11-14 03:13:20,308 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 132 transitions. Word has length 34 [2024-11-14 03:13:20,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:13:20,308 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 132 transitions. [2024-11-14 03:13:20,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) 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) [2024-11-14 03:13:20,309 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 132 transitions. [2024-11-14 03:13:20,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 03:13:20,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:13:20,310 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:13:20,327 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 03:13:20,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:13:20,510 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-14 03:13:20,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:13:20,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1795188033, now seen corresponding path program 1 times [2024-11-14 03:13:20,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:13:20,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854380891] [2024-11-14 03:13:20,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:20,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:13:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:20,629 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-14 03:13:20,630 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:13:20,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854380891] [2024-11-14 03:13:20,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854380891] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:13:20,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296746218] [2024-11-14 03:13:20,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:20,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:13:20,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:13:20,633 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:13:20,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 03:13:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:20,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:13:20,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:13:20,935 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 03:13:20,935 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:13:20,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296746218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:13:20,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:13:20,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-14 03:13:20,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556181090] [2024-11-14 03:13:20,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:13:20,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:13:20,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:13:20,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:13:20,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:13:20,938 INFO L87 Difference]: Start difference. First operand 116 states and 132 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:13:21,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:13:21,065 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2024-11-14 03:13:21,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:13:21,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2024-11-14 03:13:21,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:13:21,067 INFO L225 Difference]: With dead ends: 98 [2024-11-14 03:13:21,067 INFO L226 Difference]: Without dead ends: 98 [2024-11-14 03:13:21,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:13:21,068 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:13:21,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 258 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:13:21,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-14 03:13:21,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-14 03:13:21,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 57 states have (on average 1.736842105263158) internal successors, (99), 93 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:13:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2024-11-14 03:13:21,072 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 34 [2024-11-14 03:13:21,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:13:21,072 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2024-11-14 03:13:21,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:13:21,072 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2024-11-14 03:13:21,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 03:13:21,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:13:21,073 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:13:21,094 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 03:13:21,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:13:21,278 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-14 03:13:21,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:13:21,278 INFO L85 PathProgramCache]: Analyzing trace with hash 895878364, now seen corresponding path program 1 times [2024-11-14 03:13:21,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:13:21,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168975502] [2024-11-14 03:13:21,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:21,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:13:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:24,158 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:13:24,159 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:13:24,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168975502] [2024-11-14 03:13:24,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168975502] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:13:24,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485505774] [2024-11-14 03:13:24,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:24,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:13:24,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:13:24,162 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:13:24,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 03:13:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:24,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-14 03:13:24,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:13:24,575 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 8 treesize of output 1 [2024-11-14 03:13:25,299 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 9 treesize of output 5 [2024-11-14 03:13:25,308 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 7 treesize of output 3 [2024-11-14 03:13:47,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:47,357 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 18 treesize of output 13 [2024-11-14 03:13:47,500 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-14 03:13:47,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-14 03:13:47,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:47,541 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 16 treesize of output 11 [2024-11-14 03:13:50,584 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 17 treesize of output 9 [2024-11-14 03:13:50,620 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 7 treesize of output 3 [2024-11-14 03:13:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:13:50,901 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:13:57,736 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_node_create_~temp~0#1.base_72| Int)) (or (forall ((v_ArrVal_1467 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_72| v_ArrVal_1467) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4))) (< |c_#StackHeapBarrier| (+ |v_node_create_~temp~0#1.base_72| 1)))) (forall ((|v_node_create_~temp~0#1.base_72| Int)) (or (< |c_#StackHeapBarrier| (+ |v_node_create_~temp~0#1.base_72| 1)) (forall ((v_ArrVal_1469 Int)) (or (forall ((v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1467 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_72| v_ArrVal_1467) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 8) (select (store |c_#length| |v_node_create_~temp~0#1.base_72| v_ArrVal_1469) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_72| v_ArrVal_1468) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)))) (< v_ArrVal_1469 12)))))) is different from false [2024-11-14 03:13:57,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485505774] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:13:57,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1282547558] [2024-11-14 03:13:57,751 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-14 03:13:57,751 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:13:57,752 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:13:57,752 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:13:57,752 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:13:58,965 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2024-11-14 03:13:59,053 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:15:16,312 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5022#(and (<= 1 |#StackHeapBarrier|) (or (and (exists ((|v_#memory_int_184| (Array Int (Array Int Int))) (|v_#memory_int_185| (Array Int (Array Int Int))) (|v_#memory_int_186| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_185| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_185| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_186| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4))) |v_#memory_int_186|) (= (store |v_#memory_int_184| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_184| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_185| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_185|) (= |#memory_int| (store |v_#memory_int_186| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_186| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8 5))))) (not (= |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 0)) (exists ((|v_#memory_int_190| (Array Int (Array Int Int))) (|v_#memory_int_191| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_#memory_$Pointer$.offset_218| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_218| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_63| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_63| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_107| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_63| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (<= 8 (select |v_#length_BEFORE_CALL_107| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select |v_old(#valid)_AFTER_CALL_63| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (= |v_old(#memory_int)_AFTER_CALL_63| (store |v_#memory_int_191| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_191| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_63| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (store |v_#memory_int_190| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_190| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_191| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_191|) (<= 4 (select |v_#length_BEFORE_CALL_107| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= (store (store |v_#memory_$Pointer$.base_218| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_218| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_218| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_218| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_63|) (= (select (select (store (store |v_#memory_$Pointer$.offset_218| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_218| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_218| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_218| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (<= (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_212| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_212| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.base_212| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8))))) (exists ((|v_#valid_189| (Array Int Int))) (and (= |#valid| (store |v_#valid_189| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1)) (= (select |v_#valid_189| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_212| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_212| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_212| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8))))) (exists ((|v_#length_169| (Array Int Int))) (= |#length| (store |v_#length_169| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 12))) (= |ULTIMATE.start_dll_circular_prepend_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (and (exists ((|v_#memory_int_184| (Array Int (Array Int Int))) (|v_#memory_int_185| (Array Int (Array Int Int))) (|v_#memory_int_186| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_185| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_185| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_186| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4))) |v_#memory_int_186|) (= (store |v_#memory_int_184| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_184| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_185| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_185|) (= |#memory_int| (store |v_#memory_int_186| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_186| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8 5))))) (not (= |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 0)) (<= (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_190| (Array Int (Array Int Int))) (|v_#memory_int_191| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#memory_$Pointer$.offset_218| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_218| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_64| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_64| (Array Int (Array Int Int)))) (and (= (select (select (store (store |v_#memory_$Pointer$.offset_218| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_218| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_218| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_218| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (= (store (store |v_#memory_$Pointer$.base_218| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_218| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_218| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_218| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_64|) (= |v_old(#memory_int)_AFTER_CALL_64| (store |v_#memory_int_191| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_191| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 4 (select |v_old(#length)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (<= 8 (select |v_old(#length)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (store |v_#memory_int_190| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_190| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_191| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_191|) (= (select |v_old(#valid)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1))) (exists ((|v_#memory_$Pointer$.base_212| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_212| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.base_212| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8))))) (exists ((|v_#valid_189| (Array Int Int))) (and (= |#valid| (store |v_#valid_189| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1)) (= (select |v_#valid_189| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_212| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_212| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_212| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8))))) (exists ((|v_#length_169| (Array Int Int))) (= |#length| (store |v_#length_169| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 12))) (= |ULTIMATE.start_dll_circular_prepend_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_prepend_~head#1.base|)) (= |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 0) (or (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 0) 8)) (< (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 0) 4) 0)) (<= 2 |ULTIMATE.start_dll_circular_prepend_~head#1.base|) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 0) 0))) (= |ULTIMATE.start_dll_circular_prepend_~head#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 1) (= |ULTIMATE.start_dll_circular_prepend_~data#1| 5))' at error location [2024-11-14 03:15:16,313 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:15:16,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:15:16,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 33 [2024-11-14 03:15:16,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072175327] [2024-11-14 03:15:16,313 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:15:16,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-14 03:15:16,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:15:16,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-14 03:15:16,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3215, Unknown=28, NotChecked=114, Total=3540 [2024-11-14 03:15:16,315 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 34 states, 25 states have (on average 2.44) internal successors, (61), 28 states have internal predecessors, (61), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-14 03:15:22,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:15:25,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:15:28,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:15:33,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:15:35,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:15:42,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:15:44,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:15:46,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:15:49,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:15:53,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:15:55,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:15:58,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:16:00,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:16:03,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:16:06,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:16:10,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:16:12,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:16:15,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:16:17,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:16:20,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:16:24,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:16:26,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:16:26,084 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2024-11-14 03:16:26,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 03:16:26,084 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 25 states have (on average 2.44) internal successors, (61), 28 states have internal predecessors, (61), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2024-11-14 03:16:26,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:16:26,086 INFO L225 Difference]: With dead ends: 114 [2024-11-14 03:16:26,086 INFO L226 Difference]: Without dead ends: 114 [2024-11-14 03:16:26,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1245 ImplicationChecksByTransitivity, 120.0s TimeCoverageRelationStatistics Valid=288, Invalid=4378, Unknown=30, NotChecked=134, Total=4830 [2024-11-14 03:16:26,088 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 163 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 12 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 59.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:16:26,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 519 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1409 Invalid, 21 Unknown, 0 Unchecked, 59.4s Time] [2024-11-14 03:16:26,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-14 03:16:26,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2024-11-14 03:16:26,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 57 states have (on average 1.719298245614035) internal successors, (98), 92 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:16:26,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2024-11-14 03:16:26,092 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 37 [2024-11-14 03:16:26,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:16:26,093 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2024-11-14 03:16:26,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 25 states have (on average 2.44) internal successors, (61), 28 states have internal predecessors, (61), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-14 03:16:26,093 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2024-11-14 03:16:26,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 03:16:26,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:16:26,094 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:16:26,116 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 03:16:26,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:16:26,294 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-14 03:16:26,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:16:26,295 INFO L85 PathProgramCache]: Analyzing trace with hash 895878363, now seen corresponding path program 1 times [2024-11-14 03:16:26,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:16:26,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368989783] [2024-11-14 03:16:26,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:26,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:16:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:29,823 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:16:29,823 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:16:29,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368989783] [2024-11-14 03:16:29,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368989783] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:16:29,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771360974] [2024-11-14 03:16:29,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:29,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:16:29,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:16:29,826 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:16:29,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 03:16:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:30,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-14 03:16:30,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:16:30,452 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 9 treesize of output 5 [2024-11-14 03:16:30,997 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_77| Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_77| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_77|)) |c_#memory_$Pointer$.base|) (<= (+ |v_node_create_~temp~0#1.base_77| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_77| 1)))) is different from true [2024-11-14 03:16:31,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:16:31,041 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 18 treesize of output 13 [2024-11-14 03:16:31,166 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 03:16:31,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2024-11-14 03:16:31,645 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 17 treesize of output 9 [2024-11-14 03:16:31,855 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 03:16:31,855 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:16:31,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771360974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:16:31,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:16:31,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 17 [2024-11-14 03:16:31,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509101863] [2024-11-14 03:16:31,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:16:31,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 03:16:31,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:16:31,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 03:16:31,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=230, Unknown=1, NotChecked=30, Total=306 [2024-11-14 03:16:31,857 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 10 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:16:35,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:16:35,149 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2024-11-14 03:16:35,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 03:16:35,149 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-11-14 03:16:35,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:16:35,150 INFO L225 Difference]: With dead ends: 96 [2024-11-14 03:16:35,150 INFO L226 Difference]: Without dead ends: 96 [2024-11-14 03:16:35,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2024-11-14 03:16:35,151 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 5 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:16:35,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 356 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 319 Invalid, 0 Unknown, 123 Unchecked, 3.0s Time] [2024-11-14 03:16:35,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-14 03:16:35,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-14 03:16:35,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 91 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:16:35,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2024-11-14 03:16:35,154 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 37 [2024-11-14 03:16:35,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:16:35,154 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2024-11-14 03:16:35,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:16:35,155 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2024-11-14 03:16:35,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 03:16:35,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:16:35,156 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:16:35,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-14 03:16:35,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-14 03:16:35,356 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-14 03:16:35,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:16:35,357 INFO L85 PathProgramCache]: Analyzing trace with hash 895867440, now seen corresponding path program 1 times [2024-11-14 03:16:35,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:16:35,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587606507] [2024-11-14 03:16:35,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:35,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:16:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:35,831 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 03:16:35,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:16:35,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587606507] [2024-11-14 03:16:35,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587606507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:16:35,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:16:35,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:16:35,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683893299] [2024-11-14 03:16:35,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:16:35,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:16:35,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:16:35,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:16:35,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:16:35,833 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 6 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-14 03:16:38,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:16:38,008 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2024-11-14 03:16:38,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:16:38,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-11-14 03:16:38,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:16:38,009 INFO L225 Difference]: With dead ends: 92 [2024-11-14 03:16:38,009 INFO L226 Difference]: Without dead ends: 92 [2024-11-14 03:16:38,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:16:38,010 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 14 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:16:38,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 236 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-14 03:16:38,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-14 03:16:38,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-14 03:16:38,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.631578947368421) internal successors, (93), 87 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:16:38,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2024-11-14 03:16:38,014 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 37 [2024-11-14 03:16:38,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:16:38,015 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2024-11-14 03:16:38,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-14 03:16:38,015 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2024-11-14 03:16:38,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 03:16:38,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:16:38,016 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:16:38,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-14 03:16:38,016 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-14 03:16:38,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:16:38,017 INFO L85 PathProgramCache]: Analyzing trace with hash 895867441, now seen corresponding path program 1 times [2024-11-14 03:16:38,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:16:38,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507056785] [2024-11-14 03:16:38,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:38,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:16:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:38,742 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 03:16:38,742 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:16:38,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507056785] [2024-11-14 03:16:38,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507056785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:16:38,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:16:38,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:16:38,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210470045] [2024-11-14 03:16:38,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:16:38,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:16:38,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:16:38,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:16:38,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:16:38,744 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-14 03:16:40,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:16:40,606 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2024-11-14 03:16:40,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:16:40,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-11-14 03:16:40,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:16:40,607 INFO L225 Difference]: With dead ends: 88 [2024-11-14 03:16:40,607 INFO L226 Difference]: Without dead ends: 88 [2024-11-14 03:16:40,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:16:40,608 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 13 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:16:40,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 248 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-14 03:16:40,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-14 03:16:40,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-14 03:16:40,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 57 states have (on average 1.5614035087719298) internal successors, (89), 83 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:16:40,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2024-11-14 03:16:40,613 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 37 [2024-11-14 03:16:40,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:16:40,613 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2024-11-14 03:16:40,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-14 03:16:40,613 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2024-11-14 03:16:40,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-14 03:16:40,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:16:40,614 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2024-11-14 03:16:40,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-14 03:16:40,614 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-14 03:16:40,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:16:40,615 INFO L85 PathProgramCache]: Analyzing trace with hash -139847414, now seen corresponding path program 1 times [2024-11-14 03:16:40,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:16:40,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666553831] [2024-11-14 03:16:40,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:40,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:16:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:41,362 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-14 03:16:41,362 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:16:41,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666553831] [2024-11-14 03:16:41,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666553831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:16:41,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:16:41,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:16:41,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443360136] [2024-11-14 03:16:41,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:16:41,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:16:41,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:16:41,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:16:41,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:16:41,364 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 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) [2024-11-14 03:16:42,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:16:42,633 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2024-11-14 03:16:42,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:16:42,634 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 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 40 [2024-11-14 03:16:42,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:16:42,635 INFO L225 Difference]: With dead ends: 85 [2024-11-14 03:16:42,635 INFO L226 Difference]: Without dead ends: 85 [2024-11-14 03:16:42,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:16:42,636 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 93 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:16:42,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 174 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-14 03:16:42,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-14 03:16:42,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-14 03:16:42,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 80 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:16:42,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2024-11-14 03:16:42,640 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 40 [2024-11-14 03:16:42,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:16:42,640 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2024-11-14 03:16:42,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 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) [2024-11-14 03:16:42,640 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2024-11-14 03:16:42,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-14 03:16:42,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:16:42,641 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2024-11-14 03:16:42,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-14 03:16:42,641 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-14 03:16:42,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:16:42,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1614990147, now seen corresponding path program 1 times [2024-11-14 03:16:42,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:16:42,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933136230] [2024-11-14 03:16:42,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:42,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:16:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:42,960 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-14 03:16:42,960 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:16:42,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933136230] [2024-11-14 03:16:42,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933136230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:16:42,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:16:42,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:16:42,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089720969] [2024-11-14 03:16:42,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:16:42,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:16:42,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:16:42,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:16:42,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:16:42,961 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-14 03:16:44,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:16:44,240 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2024-11-14 03:16:44,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:16:44,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2024-11-14 03:16:44,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:16:44,241 INFO L225 Difference]: With dead ends: 84 [2024-11-14 03:16:44,241 INFO L226 Difference]: Without dead ends: 84 [2024-11-14 03:16:44,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:16:44,243 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 1 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:16:44,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 216 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-14 03:16:44,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-14 03:16:44,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-14 03:16:44,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 79 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:16:44,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2024-11-14 03:16:44,247 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 41 [2024-11-14 03:16:44,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:16:44,247 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2024-11-14 03:16:44,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-14 03:16:44,247 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2024-11-14 03:16:44,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-14 03:16:44,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:16:44,248 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2024-11-14 03:16:44,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-14 03:16:44,248 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-14 03:16:44,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:16:44,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1614990148, now seen corresponding path program 1 times [2024-11-14 03:16:44,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:16:44,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461756266] [2024-11-14 03:16:44,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:44,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:16:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:16:50,857 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:16:50,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461756266] [2024-11-14 03:16:50,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461756266] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:16:50,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587276180] [2024-11-14 03:16:50,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:50,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:16:50,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:16:50,860 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:16:50,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 03:16:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:51,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 03:16:51,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:16:51,723 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 23 treesize of output 15 [2024-11-14 03:16:51,741 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 28 treesize of output 16 [2024-11-14 03:16:52,128 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-14 03:16:52,129 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:16:52,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587276180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:16:52,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:16:52,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [18] total 21 [2024-11-14 03:16:52,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527631430] [2024-11-14 03:16:52,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:16:52,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:16:52,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:16:52,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:16:52,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2024-11-14 03:16:52,130 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-14 03:16:53,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:16:53,464 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2024-11-14 03:16:53,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:16:53,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2024-11-14 03:16:53,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:16:53,466 INFO L225 Difference]: With dead ends: 83 [2024-11-14 03:16:53,466 INFO L226 Difference]: Without dead ends: 83 [2024-11-14 03:16:53,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2024-11-14 03:16:53,468 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 1 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:16:53,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 228 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-14 03:16:53,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-14 03:16:53,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-14 03:16:53,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 78 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:16:53,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2024-11-14 03:16:53,472 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 41 [2024-11-14 03:16:53,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:16:53,472 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2024-11-14 03:16:53,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-14 03:16:53,472 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2024-11-14 03:16:53,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-14 03:16:53,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:16:53,473 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2024-11-14 03:16:53,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-14 03:16:53,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:16:53,673 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-14 03:16:53,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:16:53,674 INFO L85 PathProgramCache]: Analyzing trace with hash -40298291, now seen corresponding path program 1 times [2024-11-14 03:16:53,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:16:53,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412124551] [2024-11-14 03:16:53,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:53,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:16:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:56,198 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:16:56,199 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:16:56,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412124551] [2024-11-14 03:16:56,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412124551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:16:56,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599669796] [2024-11-14 03:16:56,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:56,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:16:56,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:16:56,201 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:16:56,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8ca988d-a737-4604-94fa-ee17cd5b747b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-14 03:16:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:56,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-14 03:16:56,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:16:57,165 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 8 treesize of output 4 [2024-11-14 03:16:57,400 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_79| Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_79| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_79|))) (<= (+ |v_node_create_~temp~0#1.base_79| 1) |c_#StackHeapBarrier|))) is different from true [2024-11-14 03:16:57,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:16:57,462 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 17 treesize of output 12 [2024-11-14 03:16:57,532 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 16 treesize of output 8 [2024-11-14 03:16:57,555 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2024-11-14 03:16:57,555 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:16:58,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599669796] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:16:58,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [500893924] [2024-11-14 03:16:58,281 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2024-11-14 03:16:58,281 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:16:58,281 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:16:58,281 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:16:58,281 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:17:00,219 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2024-11-14 03:17:00,301 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:18:09,000 WARN L286 SmtUtils]: Spent 10.29s on a formula simplification. DAG size of input: 231 DAG size of output: 225 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:18:40,254 WARN L286 SmtUtils]: Spent 19.13s on a formula simplification. DAG size of input: 237 DAG size of output: 231 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:19:08,883 WARN L286 SmtUtils]: Spent 14.71s on a formula simplification. DAG size of input: 235 DAG size of output: 229 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:19:37,849 WARN L286 SmtUtils]: Spent 16.72s on a formula simplification. DAG size of input: 247 DAG size of output: 237 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:19:37,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [500893924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:19:37,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:19:37,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [15, 15] total 43 [2024-11-14 03:19:37,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282422880] [2024-11-14 03:19:37,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:19:37,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-14 03:19:37,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:19:37,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-14 03:19:37,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1661, Unknown=20, NotChecked=82, Total=1892 [2024-11-14 03:19:37,852 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:19:42,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:19:47,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:19:50,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:19:53,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:19:55,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:19:59,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:20:01,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:20:04,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:20:06,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:20:09,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:20:11,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:20:14,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:20:17,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:20:19,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:20:23,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:20:25,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:20:27,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:20:36,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]