./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:48:51,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:48:51,917 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 06:48:51,922 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:48:51,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:48:51,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:48:51,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:48:51,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:48:51,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:48:51,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:48:51,973 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:48:51,974 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:48:51,974 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:48:51,975 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:48:51,975 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:48:51,978 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:48:51,978 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:48:51,979 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:48:51,979 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:48:51,979 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:48:51,980 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:48:51,985 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:48:51,985 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:48:51,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:48:51,986 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:48:51,986 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:48:51,987 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:48:51,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:48:51,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:48:51,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:48:51,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:48:52,012 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:48:52,012 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:48:52,013 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:48:52,013 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:48:52,013 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:48:52,014 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:48:52,014 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:48:52,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:48:52,015 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:48:52,015 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:48:52,018 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:48:52,019 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:48:52,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:48:52,020 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:48:52,021 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:48:52,021 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:48:52,021 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje 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 ! call(reach_error())) ) 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 -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2024-11-09 06:48:52,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:48:52,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:48:52,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:48:52,404 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:48:52,404 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:48:52,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i Unable to find full path for "g++" [2024-11-09 06:48:54,970 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:48:55,275 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:48:55,276 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2024-11-09 06:48:55,295 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/data/0af8e0c62/90740e00a8644638a960d7a80ccee8bc/FLAG6354a8ecc [2024-11-09 06:48:55,538 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/data/0af8e0c62/90740e00a8644638a960d7a80ccee8bc [2024-11-09 06:48:55,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:48:55,542 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:48:55,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:48:55,544 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:48:55,557 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:48:55,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:48:55" (1/1) ... [2024-11-09 06:48:55,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a82bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:48:55, skipping insertion in model container [2024-11-09 06:48:55,563 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:48:55" (1/1) ... [2024-11-09 06:48:55,638 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:48:56,131 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2024-11-09 06:48:56,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:48:56,162 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:48:56,220 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2024-11-09 06:48:56,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:48:56,262 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:48:56,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:48:56 WrapperNode [2024-11-09 06:48:56,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:48:56,265 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:48:56,265 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:48:56,265 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:48:56,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:48:56" (1/1) ... [2024-11-09 06:48:56,290 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:48:56" (1/1) ... [2024-11-09 06:48:56,335 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 156 [2024-11-09 06:48:56,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:48:56,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:48:56,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:48:56,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:48:56,355 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:48:56" (1/1) ... [2024-11-09 06:48:56,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:48:56" (1/1) ... [2024-11-09 06:48:56,365 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:48:56" (1/1) ... [2024-11-09 06:48:56,365 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:48:56" (1/1) ... [2024-11-09 06:48:56,376 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:48:56" (1/1) ... [2024-11-09 06:48:56,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:48:56" (1/1) ... [2024-11-09 06:48:56,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:48:56" (1/1) ... [2024-11-09 06:48:56,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:48:56" (1/1) ... [2024-11-09 06:48:56,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:48:56,396 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:48:56,396 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:48:56,396 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:48:56,397 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:48:56" (1/1) ... [2024-11-09 06:48:56,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:48:56,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:48:56,454 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:48:56,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:48:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:48:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:48:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 06:48:56,494 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 06:48:56,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:48:56,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:48:56,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 06:48:56,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 06:48:56,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 06:48:56,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:48:56,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-09 06:48:56,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:48:56,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:48:56,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:48:56,669 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:48:56,672 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:48:57,070 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-09 06:48:57,071 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:48:57,141 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:48:57,142 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 06:48:57,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:48:57 BoogieIcfgContainer [2024-11-09 06:48:57,143 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:48:57,146 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:48:57,146 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:48:57,150 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:48:57,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:48:55" (1/3) ... [2024-11-09 06:48:57,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7c2949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:48:57, skipping insertion in model container [2024-11-09 06:48:57,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:48:56" (2/3) ... [2024-11-09 06:48:57,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7c2949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:48:57, skipping insertion in model container [2024-11-09 06:48:57,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:48:57" (3/3) ... [2024-11-09 06:48:57,156 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2024-11-09 06:48:57,176 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:48:57,176 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 06:48:57,253 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:48:57,262 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=LoopHeads, 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;@3e2d1d85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:48:57,262 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 06:48:57,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 31 states have internal predecessors, (47), 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-09 06:48:57,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 06:48:57,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:48:57,278 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:48:57,279 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:48:57,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:48:57,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1383894492, now seen corresponding path program 1 times [2024-11-09 06:48:57,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:48:57,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825129107] [2024-11-09 06:48:57,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:48:57,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:48:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:48:57,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 06:48:57,978 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:48:57,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825129107] [2024-11-09 06:48:57,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825129107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:48:57,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:48:57,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:48:57,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751676162] [2024-11-09 06:48:57,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:48:57,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:48:57,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:48:58,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:48:58,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:48:58,040 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 31 states have internal predecessors, (47), 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, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:48:58,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:48:58,135 INFO L93 Difference]: Finished difference Result 69 states and 102 transitions. [2024-11-09 06:48:58,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:48:58,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-11-09 06:48:58,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:48:58,149 INFO L225 Difference]: With dead ends: 69 [2024-11-09 06:48:58,149 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 06:48:58,153 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-09 06:48:58,160 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:48:58,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 80 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:48:58,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 06:48:58,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-11-09 06:48:58,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 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-09 06:48:58,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2024-11-09 06:48:58,225 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 19 [2024-11-09 06:48:58,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:48:58,227 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2024-11-09 06:48:58,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:48:58,228 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2024-11-09 06:48:58,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 06:48:58,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:48:58,233 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:48:58,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:48:58,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:48:58,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:48:58,236 INFO L85 PathProgramCache]: Analyzing trace with hash 441633175, now seen corresponding path program 1 times [2024-11-09 06:48:58,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:48:58,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166418486] [2024-11-09 06:48:58,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:48:58,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:48:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:48:59,357 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:48:59,357 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:48:59,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166418486] [2024-11-09 06:48:59,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166418486] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:48:59,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250248728] [2024-11-09 06:48:59,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:48:59,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:48:59,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:48:59,362 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:48:59,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:48:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:48:59,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 06:48:59,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:48:59,831 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-09 06:48:59,883 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_14| Int)) (and (<= (+ |v_node_create_~temp~0#1.base_14| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_14| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_14|)) |c_#memory_$Pointer$.base|))) is different from true [2024-11-09 06:48:59,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:48:59,919 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-09 06:48:59,933 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-09 06:48:59,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2024-11-09 06:48:59,938 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:49:00,014 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_19| Int) (v_ArrVal_172 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_19| v_ArrVal_172) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_node_create_~temp~0#1.base_19| 1)))) is different from false [2024-11-09 06:49:00,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250248728] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:49:00,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1390492955] [2024-11-09 06:49:00,053 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-09 06:49:00,053 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:49:00,058 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:49:00,066 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:49:00,066 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:49:03,107 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2024-11-09 06:49:03,122 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:49:40,741 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '293#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~last~2#1.offset|) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~last~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |ULTIMATE.start_main_~uneq~0#1| 5) (exists ((|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int))) (|v_#memory_int_67| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_12| Int) (|v_#memory_int_26| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_56| (Array Int (Array Int Int)))) (and (= |v_#memory_int_26| (store |v_#memory_int_67| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0) (store (select |v_#memory_int_67| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0)) 0 (select (select |v_#memory_int_26| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0)) 0)))) (= (select (select |v_#memory_$Pointer$.base_56| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0) 0) (or (and (exists ((|v_#valid_29| (Array Int Int))) (and (= (store |v_#valid_29| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0) 1) |#valid|) (= (select |v_#valid_29| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0)) 0))) (exists ((|v_#memory_$Pointer$.base_52| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.base_56| (store |v_#memory_$Pointer$.base_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0) (store (store (select |v_#memory_$Pointer$.base_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0)) 4))))) (exists ((|v_#memory_$Pointer$.offset_49| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0) (store (store (select |v_#memory_$Pointer$.offset_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0)) 4))) |v_#memory_$Pointer$.offset_53|)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0) 1) |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_11| Int) (|v_#memory_$Pointer$.base_55| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_52| (Array Int (Array Int Int))) (|v_#memory_int_66| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_11| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_11| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_52| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_11| (store (select |v_#memory_$Pointer$.offset_52| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_11|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_11| (store |v_#memory_int_66| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_11| (store (select |v_#memory_int_66| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_11|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_11| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_11|) 0)))) (= (store |v_#memory_$Pointer$.base_55| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_11| (store (select |v_#memory_$Pointer$.base_55| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_11|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_11| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_11|))) (exists ((|v_#memory_int_63| (Array Int (Array Int Int))) (|v_#memory_int_43| (Array Int (Array Int Int)))) (and (= |v_#memory_int_43| (store |v_#memory_int_63| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0) (store (select |v_#memory_int_63| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0)) 0 (select (select |v_#memory_int_43| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0)) 0)))) (= |v_#memory_int_67| (store |v_#memory_int_43| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0) (store (select |v_#memory_int_43| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0)) 4 5))))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0) 0)) (exists ((|v_#length_21| (Array Int Int))) (= |#length| (store |v_#length_21| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0) 8))) (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_12| |ULTIMATE.start_main_~#s~0#1.base|)) (and (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_11| Int) (|v_#memory_$Pointer$.base_55| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_15| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_52| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int))) (|v_#memory_int_66| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_52| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_11| (store (select |v_#memory_$Pointer$.offset_52| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_11|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.base_55| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_11| (store (select |v_#memory_$Pointer$.base_55| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_11|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_10|) (= (store |v_#memory_int_66| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_11| (store (select |v_#memory_int_66| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_11|) 0 (select (select |v_#memory_int_BEFORE_CALL_15| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_11|) 0))) |v_#memory_int_BEFORE_CALL_15|))) (exists ((|v_#valid_29| (Array Int Int))) (and (= (store |v_#valid_29| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0) 1) |#valid|) (= (select |v_#valid_29| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0)) 0))) (exists ((|v_#memory_$Pointer$.base_52| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.base_56| (store |v_#memory_$Pointer$.base_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0) (store (store (select |v_#memory_$Pointer$.base_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0)) 4))))) (exists ((|v_#memory_$Pointer$.offset_49| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0) (store (store (select |v_#memory_$Pointer$.offset_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0)) 4))) |v_#memory_$Pointer$.offset_53|)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_63| (Array Int (Array Int Int))) (|v_#memory_int_43| (Array Int (Array Int Int)))) (and (= |v_#memory_int_43| (store |v_#memory_int_63| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0) (store (select |v_#memory_int_63| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0)) 0 (select (select |v_#memory_int_43| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0)) 0)))) (= |v_#memory_int_67| (store |v_#memory_int_43| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0) (store (select |v_#memory_int_43| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0)) 4 5))))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0) 0)) (exists ((|v_#length_21| (Array Int Int))) (= |#length| (store |v_#length_21| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0) 8))) (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_12| |ULTIMATE.start_main_~#s~0#1.base|))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0) (store (select |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0)) 0 0)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_12| (store (select (store |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0) (store (select |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0)) 0 0)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0 0))) (= (select (select |v_#memory_$Pointer$.offset_53| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0) 0) (= (store (store |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0) (store (select |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0)) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0))) |v_ULTIMATE.start_sll_circular_append_~head#1.base_12| (store (select (store |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0) (store (select |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0)) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0))) |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0))) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_26| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12| (store (select |v_#memory_int_26| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_append_~head#1.base_12|) 0)))))) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 06:49:40,742 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:49:40,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:49:40,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2024-11-09 06:49:40,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670041449] [2024-11-09 06:49:40,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:49:40,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 06:49:40,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:49:40,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 06:49:40,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=901, Unknown=12, NotChecked=122, Total=1122 [2024-11-09 06:49:40,749 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 15 states, 10 states have (on average 2.3) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 06:49:41,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:49:41,274 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2024-11-09 06:49:41,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 06:49:41,275 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 10 states have (on average 2.3) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2024-11-09 06:49:41,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:49:41,276 INFO L225 Difference]: With dead ends: 43 [2024-11-09 06:49:41,276 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 06:49:41,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 38.2s TimeCoverageRelationStatistics Valid=109, Invalid=1147, Unknown=12, NotChecked=138, Total=1406 [2024-11-09 06:49:41,279 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 34 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:49:41,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 173 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 130 Invalid, 0 Unknown, 40 Unchecked, 0.2s Time] [2024-11-09 06:49:41,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 06:49:41,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-11-09 06:49:41,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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-09 06:49:41,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-09 06:49:41,289 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 27 [2024-11-09 06:49:41,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:49:41,289 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-09 06:49:41,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 10 states have (on average 2.3) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 06:49:41,290 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-09 06:49:41,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 06:49:41,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:49:41,291 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 06:49:41,310 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 06:49:41,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:49:41,492 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:49:41,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:49:41,493 INFO L85 PathProgramCache]: Analyzing trace with hash -57179237, now seen corresponding path program 1 times [2024-11-09 06:49:41,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:49:41,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503004374] [2024-11-09 06:49:41,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:49:41,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:49:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:49:43,226 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:49:43,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:49:43,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503004374] [2024-11-09 06:49:43,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503004374] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:49:43,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850253614] [2024-11-09 06:49:43,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:49:43,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:49:43,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:49:43,232 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:49:43,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:49:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:49:43,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-11-09 06:49:43,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:49:43,531 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-09 06:49:43,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 06:49:43,943 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 06:49:43,944 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 17 treesize of output 21 [2024-11-09 06:49:44,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 06:49:44,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:49:44,319 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-11-09 06:49:44,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 77 [2024-11-09 06:49:44,332 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 50 treesize of output 21 [2024-11-09 06:49:44,498 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-09 06:49:44,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 36 [2024-11-09 06:49:44,513 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 13 treesize of output 9 [2024-11-09 06:49:44,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2024-11-09 06:49:44,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:49:44,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:49:44,783 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 06:49:44,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 68 [2024-11-09 06:49:44,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:49:44,803 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 26 treesize of output 21 [2024-11-09 06:49:44,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:49:44,814 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 63 treesize of output 54 [2024-11-09 06:49:44,854 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-11-09 06:49:44,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-09 06:49:45,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:49:45,748 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2024-11-09 06:49:45,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 78 [2024-11-09 06:49:45,766 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 9 treesize of output 7 [2024-11-09 06:49:45,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2024-11-09 06:49:45,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:49:45,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 53 [2024-11-09 06:49:45,856 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-09 06:49:45,856 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 64 [2024-11-09 06:49:45,972 INFO L349 Elim1Store]: treesize reduction 164, result has 13.7 percent of original size [2024-11-09 06:49:45,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 105 treesize of output 80 [2024-11-09 06:49:46,067 INFO L349 Elim1Store]: treesize reduction 80, result has 14.9 percent of original size [2024-11-09 06:49:46,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 134 [2024-11-09 06:49:46,133 INFO L349 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2024-11-09 06:49:46,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 34 [2024-11-09 06:49:46,175 INFO L349 Elim1Store]: treesize reduction 55, result has 14.1 percent of original size [2024-11-09 06:49:46,175 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 32 treesize of output 13 [2024-11-09 06:49:46,203 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-09 06:49:46,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 121 [2024-11-09 06:49:46,409 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 175 treesize of output 139 [2024-11-09 06:49:46,726 INFO L349 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2024-11-09 06:49:46,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 158 treesize of output 67 [2024-11-09 06:49:46,838 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:49:46,838 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:49:47,271 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_311 Int) (v_ArrVal_313 (Array Int Int)) (v_ArrVal_312 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_312))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_311)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_314) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_315 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) v_ArrVal_315)) (not (= .cse0 (select (select .cse1 .cse0) .cse2))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_315) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_313) .cse0) (+ 4 .cse2))))))) is different from false [2024-11-09 06:49:49,854 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_14| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (< .cse0 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_14|) (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int)) (let ((.cse4 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_14|))) (or (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_311 Int) (v_ArrVal_313 (Array Int Int)) (v_ArrVal_312 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_14| (store .cse4 |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_312))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_14| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_14|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_311)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_314) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse1 (select (select .cse2 .cse1) .cse3))) (= (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_14| v_ArrVal_315) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_313) .cse1) (+ 4 .cse3)) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_315 (store (select |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_14|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_315 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))))))) (< (select .cse4 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse0))))))) is different from false [2024-11-09 06:49:49,915 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_311 Int) (|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_14| Int) (v_ArrVal_313 (Array Int Int)) (v_ArrVal_312 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_14|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_14| (store .cse4 |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_312))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_14| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_14|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_311)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_314) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 (select (select .cse1 .cse0) .cse2))) (< .cse3 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_14|) (< (select .cse4 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse3) (not (= v_ArrVal_315 (store (select |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_14|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_315 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_14| v_ArrVal_315) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_313) .cse0) (+ .cse2 4)))))))) is different from false [2024-11-09 06:49:50,174 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| Int) (|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_313 (Array Int Int)) (v_ArrVal_324 (Array Int Int)) (v_ArrVal_312 (Array Int Int)) (v_ArrVal_323 (Array Int Int)) (v_ArrVal_315 (Array Int Int)) (v_ArrVal_325 (Array Int Int)) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_311 Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_14| Int)) (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| v_ArrVal_325))) (let ((.cse4 (select .cse5 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_14|))) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_14| (store .cse4 |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| v_ArrVal_312))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_14| (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| v_ArrVal_323) |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_14|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_311)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| v_ArrVal_314) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (< .cse0 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_14|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| 1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_14| v_ArrVal_315) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| v_ArrVal_313) .cse1) (+ .cse2 4))) (not (= (select (select .cse3 .cse1) .cse2) .cse1)) (not (= v_ArrVal_315 (store (select (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| v_ArrVal_324) |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_14|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_315 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))) (< (select .cse4 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse0))))))) is different from false [2024-11-09 06:49:50,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850253614] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:49:50,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [35461803] [2024-11-09 06:49:50,184 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-09 06:49:50,184 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:49:50,185 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:49:50,185 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:49:50,185 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:49:52,183 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2024-11-09 06:49:52,198 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:50:29,426 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '587#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~last~2#1.offset|) (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (= |ULTIMATE.start_main_~last~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_14| Int) (|v_#memory_int_96| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14| Int) (|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int))) (|v_#memory_int_27| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_68| (select (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.offset_68| (select (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) (select (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 0)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14| (store (select (store |v_#memory_$Pointer$.offset_68| (select (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.offset_68| (select (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) (select (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 0)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14|) 0 (select (select (store |v_#memory_$Pointer$.offset_68| (select (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.offset_68| (select (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) (select (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 0)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)))) (= |v_#memory_int_27| (store |v_#memory_int_96| (select (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_int_96| (select (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) (select (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (select (select |v_#memory_int_27| (select (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) (select (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0))))) (or (and (not (= |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14| 0)) (exists ((|v_#memory_$Pointer$.base_69| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.base_73| (store |v_#memory_$Pointer$.base_69| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14| (store (store (select |v_#memory_$Pointer$.base_69| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14|) 0 0) 4 (select (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14|) 4))))) (exists ((|v_#memory_int_43| (Array Int (Array Int Int))) (|v_#memory_int_92| (Array Int (Array Int Int)))) (and (= |v_#memory_int_96| (store |v_#memory_int_43| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14| (store (select |v_#memory_int_43| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14|) 4 5))) (= (store |v_#memory_int_92| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14| (store (select |v_#memory_int_92| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14|) 0 (select (select |v_#memory_int_43| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14|) 0))) |v_#memory_int_43|))) (exists ((|v_#length_28| (Array Int Int))) (= (store |v_#length_28| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14| 8) |#length|)) (exists ((|v_#memory_int_95| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_13| Int) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_22| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_72| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_67| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_22| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_22| (store |v_#memory_int_95| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_13| (store (select |v_#memory_int_95| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_13|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_22| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_13|) 0)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_22| (store |v_#memory_$Pointer$.base_72| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_13| (store (select |v_#memory_$Pointer$.base_72| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_13|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_22| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= (select (select (store |v_#memory_$Pointer$.offset_67| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_13| (store (select |v_#memory_$Pointer$.offset_67| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_13|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (exists ((|v_#memory_$Pointer$.offset_64| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_68| (store |v_#memory_$Pointer$.offset_64| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14| (store (store (select |v_#memory_$Pointer$.offset_64| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14|) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14|) 4))))) (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_14| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_40| (Array Int Int))) (and (= |#valid| (store |v_#valid_40| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14| 1)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14|)))) (<= (+ |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14| 1) |#StackHeapBarrier|)) (and (not (= |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14| 0)) (exists ((|v_#memory_$Pointer$.base_69| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.base_73| (store |v_#memory_$Pointer$.base_69| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14| (store (store (select |v_#memory_$Pointer$.base_69| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14|) 0 0) 4 (select (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14|) 4))))) (exists ((|v_#memory_int_43| (Array Int (Array Int Int))) (|v_#memory_int_92| (Array Int (Array Int Int)))) (and (= |v_#memory_int_96| (store |v_#memory_int_43| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14| (store (select |v_#memory_int_43| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14|) 4 5))) (= (store |v_#memory_int_92| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14| (store (select |v_#memory_int_92| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14|) 0 (select (select |v_#memory_int_43| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14|) 0))) |v_#memory_int_43|))) (exists ((|v_#length_28| (Array Int Int))) (= (store |v_#length_28| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14| 8) |#length|)) (exists ((|v_#memory_int_95| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_13| Int) (|v_#memory_int_BEFORE_CALL_36| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_21| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_72| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_67| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_67| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_13| (store (select |v_#memory_$Pointer$.offset_67| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_13|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.base_72| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_13| (store (select |v_#memory_$Pointer$.base_72| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_13|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_21|) (= (store |v_#memory_int_95| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_13| (store (select |v_#memory_int_95| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_13|) 0 (select (select |v_#memory_int_BEFORE_CALL_36| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_13|) 0))) |v_#memory_int_BEFORE_CALL_36|))) (exists ((|v_#memory_$Pointer$.offset_64| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_68| (store |v_#memory_$Pointer$.offset_64| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14| (store (store (select |v_#memory_$Pointer$.offset_64| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14|) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14|) 4))))) (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_14| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_40| (Array Int Int))) (and (= |#valid| (store |v_#valid_40| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14| 1)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14|)))) (<= (+ |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14| 1) |#StackHeapBarrier|))) (= |#memory_int| (store |v_#memory_int_27| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14| (store (select |v_#memory_int_27| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14|) 0)))) (= (select (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (select (select |v_#memory_$Pointer$.base_73| (select (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) (select (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_73| (select (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.base_73| (select (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) (select (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14|)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14| (store (select (store |v_#memory_$Pointer$.base_73| (select (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.base_73| (select (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) (select (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14|)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14|) 0 (select (select (store |v_#memory_$Pointer$.base_73| (select (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.base_73| (select (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) (select (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_14|)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)))))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 06:50:29,427 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:50:29,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:50:29,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24] total 38 [2024-11-09 06:50:29,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879765088] [2024-11-09 06:50:29,428 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:50:29,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 06:50:29,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:50:29,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 06:50:29,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=4079, Unknown=11, NotChecked=524, Total=4830 [2024-11-09 06:50:29,433 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 38 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 29 states have internal predecessors, (43), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 06:50:32,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:50:32,416 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2024-11-09 06:50:32,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 06:50:32,417 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 29 states have internal predecessors, (43), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 30 [2024-11-09 06:50:32,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:50:32,418 INFO L225 Difference]: With dead ends: 59 [2024-11-09 06:50:32,418 INFO L226 Difference]: Without dead ends: 47 [2024-11-09 06:50:32,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 44.2s TimeCoverageRelationStatistics Valid=352, Invalid=5973, Unknown=11, NotChecked=636, Total=6972 [2024-11-09 06:50:32,423 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 70 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:50:32,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 406 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 06:50:32,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-09 06:50:32,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2024-11-09 06:50:32,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 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-09 06:50:32,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-11-09 06:50:32,434 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 30 [2024-11-09 06:50:32,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:50:32,435 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-11-09 06:50:32,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 29 states have internal predecessors, (43), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 06:50:32,435 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-11-09 06:50:32,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 06:50:32,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:50:32,436 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:50:32,455 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 06:50:32,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:50:32,637 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:50:32,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:32,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1575921078, now seen corresponding path program 1 times [2024-11-09 06:50:32,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:50:32,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315488557] [2024-11-09 06:50:32,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:32,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:35,109 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 06:50:35,110 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:50:35,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315488557] [2024-11-09 06:50:35,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315488557] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:50:35,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081916829] [2024-11-09 06:50:35,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:35,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:50:35,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:50:35,113 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:50:35,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 06:50:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:35,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 125 conjuncts are in the unsatisfiable core [2024-11-09 06:50:35,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:50:35,394 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-09 06:50:35,727 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-09 06:50:35,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:50:35,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-09 06:50:36,003 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 06:50:36,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 06:50:36,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 06:50:36,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 06:50:36,401 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-09 06:50:36,402 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 60 [2024-11-09 06:50:36,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-09 06:50:36,617 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-09 06:50:36,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 43 [2024-11-09 06:50:36,629 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-09 06:50:36,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:50:36,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-09 06:50:36,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:50:37,006 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 06:50:37,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 60 [2024-11-09 06:50:37,040 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 06:50:37,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 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-09 06:50:37,078 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-09 06:50:37,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-09 06:50:37,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:50:37,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-09 06:50:38,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:50:38,635 INFO L349 Elim1Store]: treesize reduction 96, result has 29.4 percent of original size [2024-11-09 06:50:38,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 103 treesize of output 113 [2024-11-09 06:50:38,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:50:38,716 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2024-11-09 06:50:38,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 42 [2024-11-09 06:50:38,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-11-09 06:50:38,784 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 7 treesize of output 5 [2024-11-09 06:50:38,823 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 7 treesize of output 5 [2024-11-09 06:50:38,907 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 06:50:38,908 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 15 treesize of output 9 [2024-11-09 06:50:39,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:50:39,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 59 [2024-11-09 06:50:39,647 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 06:50:39,647 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 27 treesize of output 19 [2024-11-09 06:50:39,854 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-11-09 06:50:39,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 34 [2024-11-09 06:50:39,968 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-11-09 06:50:39,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 26 [2024-11-09 06:50:40,162 INFO L349 Elim1Store]: treesize reduction 67, result has 32.3 percent of original size [2024-11-09 06:50:40,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 64 [2024-11-09 06:50:40,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:50:40,273 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 06:50:40,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 33 [2024-11-09 06:50:40,591 INFO L349 Elim1Store]: treesize reduction 168, result has 31.4 percent of original size [2024-11-09 06:50:40,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 107 treesize of output 132 [2024-11-09 06:50:40,749 INFO L349 Elim1Store]: treesize reduction 154, result has 21.4 percent of original size [2024-11-09 06:50:40,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 184 treesize of output 192 [2024-11-09 06:50:40,849 INFO L349 Elim1Store]: treesize reduction 20, result has 60.0 percent of original size [2024-11-09 06:50:40,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 47 [2024-11-09 06:50:40,890 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 12 treesize of output 1 [2024-11-09 06:50:40,935 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-09 06:50:41,205 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-09 06:50:41,316 INFO L349 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2024-11-09 06:50:41,317 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 7 [2024-11-09 06:50:41,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2024-11-09 06:50:41,398 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-09 06:50:41,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:50:41,568 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 42 treesize of output 44 [2024-11-09 06:50:45,475 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 166 treesize of output 150 [2024-11-09 06:50:45,865 INFO L349 Elim1Store]: treesize reduction 28, result has 47.2 percent of original size [2024-11-09 06:50:45,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 169 treesize of output 92 [2024-11-09 06:50:46,137 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:46,138 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:50:46,763 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_467 Int) (v_ArrVal_468 (Array Int Int)) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_465))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_467)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_466) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_468 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) v_ArrVal_468)) (not (= (select (select .cse0 .cse1) .cse2) .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_468) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_469) .cse1) (+ .cse2 4))))))) is different from false [2024-11-09 06:50:56,409 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_467 Int) (v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_19| Int) (v_subst_2 Int) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_19|))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_19|)) (.cse4 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_19| (store .cse1 v_subst_2 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_465))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_19| (store .cse6 v_subst_2 v_ArrVal_467)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_466) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (= .cse0 (select .cse1 v_subst_2))) (< (select (select |c_#memory_$Pointer$.base| .cse0) .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_19|) (not (= (store (select |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_19|) v_subst_2 (select v_ArrVal_468 v_subst_2)) v_ArrVal_468)) (not (= .cse3 (select (select .cse4 .cse3) .cse5))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_19| v_ArrVal_468) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_469) .cse3) (+ .cse5 4))) (not (= (select .cse6 v_subst_2) .cse2))))))) is different from false [2024-11-09 06:50:56,486 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_467 Int) (v_ArrVal_468 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_19| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int) (v_subst_2 Int) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_19|))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_19|)) (.cse4 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_19| (store .cse2 v_subst_2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_465))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_19| (store .cse6 v_subst_2 v_ArrVal_467)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_466) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_19| v_ArrVal_468) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_469) .cse0) (+ .cse1 4))) (not (= (store (select |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_19|) v_subst_2 (select v_ArrVal_468 v_subst_2)) v_ArrVal_468)) (not (= (select .cse2 v_subst_2) .cse3)) (not (= .cse0 (select (select .cse4 .cse0) .cse1))) (not (= .cse5 (select .cse6 v_subst_2))) (< (select (select |c_#memory_$Pointer$.base| .cse3) .cse5) |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_19|)))))) is different from false [2024-11-09 06:50:56,860 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| Int) (v_ArrVal_481 (Array Int Int)) (v_ArrVal_480 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_466 (Array Int Int)) (v_ArrVal_469 (Array Int Int)) (v_ArrVal_467 Int) (v_ArrVal_468 (Array Int Int)) (v_ArrVal_479 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_19| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_481))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_480)) (.cse3 (select .cse7 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_19|))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_19| (store .cse3 v_subst_2 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_465)) (.cse5 (select .cse8 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_19|))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_19| (store .cse5 v_subst_2 v_ArrVal_467)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_466) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse7 |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse6 (select (select .cse8 |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_19| v_ArrVal_468) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_469) .cse0) (+ .cse1 4))) (not (= v_ArrVal_468 (store (select (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_479) |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_19|) v_subst_2 (select v_ArrVal_468 v_subst_2)))) (not (= .cse2 (select .cse3 v_subst_2))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21|) 0)) (not (= (select (select .cse4 .cse0) .cse1) .cse0)) (not (= (select .cse5 v_subst_2) .cse6)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| 1)) (< (select (select .cse7 .cse2) .cse6) |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_19|))))))) is different from false [2024-11-09 06:50:56,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081916829] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:50:56,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1390968297] [2024-11-09 06:50:56,872 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-09 06:50:56,872 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:50:56,872 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:50:56,873 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:50:56,873 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:50:58,120 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2024-11-09 06:50:58,135 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:51:16,071 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '947#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~last~2#1.offset|) (exists ((|v_#memory_$Pointer$.offset_83| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_16| Int) (|v_#memory_int_125| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| Int) (|v_#memory_int_27| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_91| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_23| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_26| Int)) (and (<= 2 |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) (= (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_23|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_26|) (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) (= |v_#memory_int_27| (store |v_#memory_int_125| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_23| (store (select |v_#memory_int_125| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_23|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_26| (select (select |v_#memory_int_27| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_23|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_26|)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_23| (store (select |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_23|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_26| 0)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| (store (select (store |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_23| (store (select |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_23|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_26| 0)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0 (select (select (store |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_23| (store (select |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_23|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_26| 0)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)))) (= (store (store |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_23| (store (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_23|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_26| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| (store (select (store |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_23| (store (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_23|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_26| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0 (select (select (store |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_23| (store (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_23|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_26| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0))) |#memory_$Pointer$.base|) (= (select (select |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (select (select |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_23|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_26|)) (= |#memory_int| (store |v_#memory_int_27| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| (store (select |v_#memory_int_27| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0)))))) (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (= |ULTIMATE.start_main_~last~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 06:51:16,072 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:51:16,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:51:16,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 43 [2024-11-09 06:51:16,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750381332] [2024-11-09 06:51:16,072 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:51:16,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-09 06:51:16,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:51:16,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-09 06:51:16,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=4875, Unknown=13, NotChecked=572, Total=5700 [2024-11-09 06:51:16,077 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 43 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 33 states have internal predecessors, (47), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 06:51:21,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:51:21,465 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2024-11-09 06:51:21,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 06:51:21,466 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 33 states have internal predecessors, (47), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 32 [2024-11-09 06:51:21,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:51:21,467 INFO L225 Difference]: With dead ends: 73 [2024-11-09 06:51:21,467 INFO L226 Difference]: Without dead ends: 65 [2024-11-09 06:51:21,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1733 ImplicationChecksByTransitivity, 37.1s TimeCoverageRelationStatistics Valid=446, Invalid=7567, Unknown=13, NotChecked=716, Total=8742 [2024-11-09 06:51:21,472 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 134 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:51:21,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 422 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 06:51:21,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-09 06:51:21,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2024-11-09 06:51:21,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 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-09 06:51:21,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2024-11-09 06:51:21,489 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 32 [2024-11-09 06:51:21,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:51:21,489 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2024-11-09 06:51:21,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 33 states have internal predecessors, (47), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 06:51:21,490 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2024-11-09 06:51:21,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 06:51:21,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:51:21,491 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:51:21,510 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 06:51:21,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:51:21,693 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:51:21,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:51:21,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1616569871, now seen corresponding path program 1 times [2024-11-09 06:51:21,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:51:21,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106707361] [2024-11-09 06:51:21,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:51:21,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:51:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:51:25,876 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 06:51:25,876 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:51:25,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106707361] [2024-11-09 06:51:25,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106707361] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:51:25,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600444952] [2024-11-09 06:51:25,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:51:25,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:51:25,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:51:25,878 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:51:25,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 06:51:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:51:26,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 156 conjuncts are in the unsatisfiable core [2024-11-09 06:51:26,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:51:26,233 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-09 06:51:26,334 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-09 06:51:26,556 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 06:51:26,556 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-09 06:51:26,907 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 06:51:26,907 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 7 [2024-11-09 06:51:27,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:51:27,279 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2024-11-09 06:51:27,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2024-11-09 06:51:27,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:51:27,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 06:51:27,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 06:51:27,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 06:51:28,176 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 48 treesize of output 28 [2024-11-09 06:51:28,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 06:51:28,206 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 06:51:28,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2024-11-09 06:51:28,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:51:28,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:51:28,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-09 06:51:28,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:51:28,741 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 56 treesize of output 43 [2024-11-09 06:51:28,776 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 06:51:28,776 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 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-09 06:51:28,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:51:28,840 INFO L349 Elim1Store]: treesize reduction 16, result has 44.8 percent of original size [2024-11-09 06:51:28,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 25 [2024-11-09 06:51:30,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:51:30,601 INFO L349 Elim1Store]: treesize reduction 126, result has 13.1 percent of original size [2024-11-09 06:51:30,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 110 treesize of output 101 [2024-11-09 06:51:30,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:51:30,671 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-09 06:51:30,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 147 treesize of output 123 [2024-11-09 06:51:30,752 INFO L349 Elim1Store]: treesize reduction 28, result has 60.0 percent of original size [2024-11-09 06:51:30,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 59 [2024-11-09 06:51:30,776 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 12 treesize of output 1 [2024-11-09 06:51:30,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:51:30,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 21 [2024-11-09 06:51:30,943 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 18 treesize of output 11 [2024-11-09 06:51:31,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 58 [2024-11-09 06:51:31,112 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 9 treesize of output 7 [2024-11-09 06:51:31,122 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 49 treesize of output 39 [2024-11-09 06:51:31,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:51:31,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:51:31,304 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 54 treesize of output 37 [2024-11-09 06:51:31,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:51:31,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:51:31,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-11-09 06:51:31,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-11-09 06:51:32,801 INFO L349 Elim1Store]: treesize reduction 81, result has 48.4 percent of original size [2024-11-09 06:51:32,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 417 treesize of output 310 [2024-11-09 06:51:32,846 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 167 treesize of output 163 [2024-11-09 06:51:32,863 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 163 treesize of output 161 [2024-11-09 06:51:46,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:51:46,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 06:51:46,855 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:51:46,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:51:48,541 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base|))) (let ((.cse0 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))) (store .cse6 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse1 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse5 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 .cse1) .cse2) .cse2) (not (= v_ArrVal_627 (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_627 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_627) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_626) .cse1) (+ .cse2 4))) (not (= (select .cse3 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse4))))))) (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (.cse8 (let ((.cse12 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse12 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select .cse12 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))) (store .cse11 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select .cse11 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse7 (select (select .cse8 .cse7) .cse9)) (not (= v_ArrVal_627 (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_627 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_627) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_626) .cse7) (+ .cse9 4))) (not (= (select .cse10 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse4)))))))) is different from false [2024-11-09 06:51:48,629 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (and (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (v_subst_8 Int)) (let ((.cse3 (select |c_#memory_$Pointer$.offset| v_subst_8))) (let ((.cse2 (let ((.cse7 (store |c_#memory_$Pointer$.offset| v_subst_8 (store .cse3 .cse4 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))) (store .cse7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| v_subst_8 (store (select |c_#memory_$Pointer$.base| v_subst_8) .cse4 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse6 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| v_subst_8 v_ArrVal_627) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_626) .cse0) (+ .cse1 4))) (= (select (select .cse2 .cse0) .cse1) .cse1) (not (= (select .cse3 .cse4) .cse5)) (not (= v_ArrVal_627 (store (select |c_#memory_int| v_subst_8) .cse4 (select v_ArrVal_627 .cse4))))))))) (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (v_subst_7 Int)) (let ((.cse10 (select |c_#memory_$Pointer$.offset| v_subst_7)) (.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.base| v_subst_7 (store (select |c_#memory_$Pointer$.base| v_subst_7) .cse4 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse13 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse13 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select .cse13 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select (select (let ((.cse12 (store |c_#memory_$Pointer$.offset| v_subst_7 (store .cse10 .cse4 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))) (store .cse12 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select .cse12 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| v_subst_7 v_ArrVal_627) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_626) .cse8) (+ .cse9 4))) (not (= (select .cse10 .cse4) .cse5)) (not (= v_ArrVal_627 (store (select |c_#memory_int| v_subst_7) .cse4 (select v_ArrVal_627 .cse4)))) (= .cse8 (select (select .cse11 .cse8) .cse9)))))))) is different from false [2024-11-09 06:51:48,783 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) .cse4))) (and (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (v_subst_8 Int)) (let ((.cse2 (select |c_#memory_$Pointer$.offset| v_subst_8))) (let ((.cse5 (let ((.cse7 (store |c_#memory_$Pointer$.offset| v_subst_8 (store .cse2 .cse3 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))) (store .cse7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| v_subst_8 (store (select |c_#memory_$Pointer$.base| v_subst_8) .cse3 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse6 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| v_subst_8 v_ArrVal_627) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_626) .cse0) (+ .cse1 4))) (not (= (select .cse2 .cse3) .cse4)) (= .cse1 (select (select .cse5 .cse0) .cse1)) (not (= v_ArrVal_627 (store (select |c_#memory_int| v_subst_8) .cse3 (select v_ArrVal_627 .cse3))))))))) (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (v_subst_7 Int)) (let ((.cse11 (select |c_#memory_$Pointer$.offset| v_subst_7)) (.cse10 (let ((.cse13 (store |c_#memory_$Pointer$.base| v_subst_7 (store (select |c_#memory_$Pointer$.base| v_subst_7) .cse3 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (store .cse13 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse13 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select .cse13 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select (select (let ((.cse12 (store |c_#memory_$Pointer$.offset| v_subst_7 (store .cse11 .cse3 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))) (store .cse12 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select .cse12 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| v_subst_7 v_ArrVal_627) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_626) .cse8) (+ .cse9 4))) (not (= v_ArrVal_627 (store (select |c_#memory_int| v_subst_7) .cse3 (select v_ArrVal_627 .cse3)))) (= .cse8 (select (select .cse10 .cse8) .cse9)) (not (= (select .cse11 .cse3) .cse4))))))))) is different from false [2024-11-09 06:51:55,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600444952] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:51:55,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [11918472] [2024-11-09 06:51:55,391 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-09 06:51:55,392 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:51:55,392 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:51:55,392 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:51:55,392 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:51:56,489 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2024-11-09 06:51:56,503 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:52:13,976 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1372#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~count~0#1| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 1)) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 06:52:13,976 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:52:13,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:52:13,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27] total 48 [2024-11-09 06:52:13,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861439574] [2024-11-09 06:52:13,977 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:52:13,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-09 06:52:13,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:52:13,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-09 06:52:13,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=5748, Unknown=36, NotChecked=462, Total=6480 [2024-11-09 06:52:13,981 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand has 49 states, 40 states have (on average 1.325) internal successors, (53), 39 states have internal predecessors, (53), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 06:52:36,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:52:36,386 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2024-11-09 06:52:36,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-09 06:52:36,387 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 40 states have (on average 1.325) internal successors, (53), 39 states have internal predecessors, (53), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2024-11-09 06:52:36,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:52:36,389 INFO L225 Difference]: With dead ends: 97 [2024-11-09 06:52:36,389 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 06:52:36,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2625 ImplicationChecksByTransitivity, 50.7s TimeCoverageRelationStatistics Valid=713, Invalid=12602, Unknown=37, NotChecked=690, Total=14042 [2024-11-09 06:52:36,394 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 169 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:52:36,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 909 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-09 06:52:36,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 06:52:36,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 60. [2024-11-09 06:52:36,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 53 states have internal predecessors, (66), 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-09 06:52:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2024-11-09 06:52:36,421 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 34 [2024-11-09 06:52:36,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:52:36,422 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2024-11-09 06:52:36,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 40 states have (on average 1.325) internal successors, (53), 39 states have internal predecessors, (53), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 06:52:36,422 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2024-11-09 06:52:36,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 06:52:36,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:52:36,424 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 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-09 06:52:36,445 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 06:52:36,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:52:36,625 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:52:36,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:52:36,626 INFO L85 PathProgramCache]: Analyzing trace with hash -972706543, now seen corresponding path program 2 times [2024-11-09 06:52:36,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:52:36,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928969911] [2024-11-09 06:52:36,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:52:36,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:52:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:52:38,850 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:52:38,851 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:52:38,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928969911] [2024-11-09 06:52:38,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928969911] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:52:38,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805722341] [2024-11-09 06:52:38,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 06:52:38,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:52:38,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:52:38,854 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:52:38,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 06:52:39,263 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 06:52:39,264 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:52:39,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 156 conjuncts are in the unsatisfiable core [2024-11-09 06:52:39,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:52:39,469 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-09 06:52:39,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-09 06:52:40,490 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 06:52:40,491 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 17 treesize of output 21 [2024-11-09 06:52:40,521 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-09 06:52:40,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:52:40,714 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 19 treesize of output 18 [2024-11-09 06:52:41,016 INFO L349 Elim1Store]: treesize reduction 68, result has 25.3 percent of original size [2024-11-09 06:52:41,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 64 [2024-11-09 06:52:41,039 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 39 treesize of output 30 [2024-11-09 06:52:41,358 INFO L349 Elim1Store]: treesize reduction 40, result has 29.8 percent of original size [2024-11-09 06:52:41,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 145 treesize of output 75 [2024-11-09 06:52:41,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:52:41,428 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2024-11-09 06:52:41,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 41 [2024-11-09 06:52:41,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:52:41,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:52:42,008 INFO L349 Elim1Store]: treesize reduction 146, result has 13.1 percent of original size [2024-11-09 06:52:42,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 163 treesize of output 94 [2024-11-09 06:52:42,061 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-09 06:52:42,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-09 06:52:42,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:52:42,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:52:42,095 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-09 06:52:42,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 104 [2024-11-09 06:52:45,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:52:45,665 INFO L349 Elim1Store]: treesize reduction 268, result has 15.5 percent of original size [2024-11-09 06:52:45,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 128 treesize of output 135 [2024-11-09 06:52:45,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:52:46,027 INFO L349 Elim1Store]: treesize reduction 204, result has 32.0 percent of original size [2024-11-09 06:52:46,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 19 case distinctions, treesize of input 192 treesize of output 176 [2024-11-09 06:52:46,225 INFO L349 Elim1Store]: treesize reduction 140, result has 19.1 percent of original size [2024-11-09 06:52:46,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 309 treesize of output 243 [2024-11-09 06:52:46,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:52:46,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:52:46,316 INFO L349 Elim1Store]: treesize reduction 69, result has 13.8 percent of original size [2024-11-09 06:52:46,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 88 treesize of output 84 [2024-11-09 06:52:46,831 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-09 06:52:46,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:52:46,899 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 64 treesize of output 60 [2024-11-09 06:52:49,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:52:49,608 INFO L349 Elim1Store]: treesize reduction 124, result has 55.9 percent of original size [2024-11-09 06:52:49,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 27 case distinctions, treesize of input 477 treesize of output 322 [2024-11-09 06:52:49,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:52:50,098 INFO L349 Elim1Store]: treesize reduction 36, result has 78.2 percent of original size [2024-11-09 06:52:50,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 149 treesize of output 245 [2024-11-09 06:52:54,384 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:52:54,384 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:53:20,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805722341] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:53:20,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [397842886] [2024-11-09 06:53:20,944 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-09 06:53:20,945 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:53:20,945 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:53:20,945 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:53:20,945 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:53:21,906 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2024-11-09 06:53:21,915 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:53:39,556 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1882#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~last~2#1.offset|) (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (= |ULTIMATE.start_main_~last~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (exists ((|v_#memory_$Pointer$.offset_117| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_21| Int) (|v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_26| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_40| Int) (|v_#memory_int_27| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_125| (Array Int (Array Int Int))) (|v_#memory_int_173| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_47| Int)) (and (= |v_#memory_int_27| (store |v_#memory_int_173| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_40| (store (select |v_#memory_int_173| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_40|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_47| (select (select |v_#memory_int_27| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_40|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_47|)))) (= (store (store |v_#memory_$Pointer$.base_125| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_40| (store (select |v_#memory_$Pointer$.base_125| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_40|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_47| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_26|)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_26| (store (select (store |v_#memory_$Pointer$.base_125| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_40| (store (select |v_#memory_$Pointer$.base_125| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_40|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_47| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_26|)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_26|) 0 (select (select (store |v_#memory_$Pointer$.base_125| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_40| (store (select |v_#memory_$Pointer$.base_125| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_40|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_47| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_26|)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_21|) 0))) |#memory_$Pointer$.base|) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_40| (store (select |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_40|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_47| 0)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_26| (store (select (store |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_40| (store (select |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_40|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_47| 0)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_26|) 0 (select (select (store |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_40| (store (select |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_40|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_47| 0)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_21|) 0)))) (<= 2 |v_ULTIMATE.start_sll_circular_append_~head#1.base_21|) (= (select (select |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_40|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_47|) (select (select |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_sll_circular_append_~head#1.base_21|) 0)) (= (select (select |v_#memory_$Pointer$.base_125| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_40|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_47|) (select (select |v_#memory_$Pointer$.base_125| |v_ULTIMATE.start_sll_circular_append_~head#1.base_21|) 0)) (= |#memory_int| (store |v_#memory_int_27| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_26| (store (select |v_#memory_int_27| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_26|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_26|) 0)))))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 06:53:39,556 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:53:39,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:53:39,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 27] total 46 [2024-11-09 06:53:39,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380584876] [2024-11-09 06:53:39,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:53:39,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-09 06:53:39,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:53:39,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-09 06:53:39,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=5795, Unknown=45, NotChecked=0, Total=6162 [2024-11-09 06:53:39,559 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand has 46 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 35 states have internal predecessors, (53), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 06:53:44,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:53:44,558 INFO L93 Difference]: Finished difference Result 76 states and 97 transitions. [2024-11-09 06:53:44,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 06:53:44,559 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 35 states have internal predecessors, (53), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2024-11-09 06:53:44,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:53:44,560 INFO L225 Difference]: With dead ends: 76 [2024-11-09 06:53:44,560 INFO L226 Difference]: Without dead ends: 62 [2024-11-09 06:53:44,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2399 ImplicationChecksByTransitivity, 51.8s TimeCoverageRelationStatistics Valid=495, Invalid=7648, Unknown=47, NotChecked=0, Total=8190 [2024-11-09 06:53:44,564 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 51 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:53:44,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 534 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 06:53:44,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-09 06:53:44,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2024-11-09 06:53:44,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 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-09 06:53:44,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2024-11-09 06:53:44,587 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 34 [2024-11-09 06:53:44,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:53:44,587 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2024-11-09 06:53:44,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 35 states have internal predecessors, (53), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 06:53:44,588 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2024-11-09 06:53:44,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 06:53:44,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:53:44,589 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:53:44,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 06:53:44,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:53:44,794 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:53:44,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:53:44,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1343952256, now seen corresponding path program 3 times [2024-11-09 06:53:44,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:53:44,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699379872] [2024-11-09 06:53:44,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:53:44,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:53:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:53:44,925 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 06:53:44,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:53:44,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699379872] [2024-11-09 06:53:44,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699379872] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:53:44,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910420399] [2024-11-09 06:53:44,926 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 06:53:44,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:53:44,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:53:44,929 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:53:44,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 06:53:45,796 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 06:53:45,796 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:53:45,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:53:45,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:53:45,835 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 06:53:45,836 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:53:45,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910420399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:53:45,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:53:45,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-09 06:53:45,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310330655] [2024-11-09 06:53:45,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:53:45,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:53:45,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:53:45,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:53:45,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:53:45,838 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 06:53:45,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:53:45,889 INFO L93 Difference]: Finished difference Result 89 states and 107 transitions. [2024-11-09 06:53:45,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:53:45,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2024-11-09 06:53:45,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:53:45,891 INFO L225 Difference]: With dead ends: 89 [2024-11-09 06:53:45,891 INFO L226 Difference]: Without dead ends: 37 [2024-11-09 06:53:45,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-09 06:53:45,893 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:53:45,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:53:45,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-09 06:53:45,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-09 06:53:45,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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-09 06:53:45,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-11-09 06:53:45,909 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 39 [2024-11-09 06:53:45,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:53:45,909 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-11-09 06:53:45,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 06:53:45,909 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-11-09 06:53:45,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 06:53:45,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:53:45,910 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:53:45,929 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 06:53:46,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:53:46,111 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:53:46,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:53:46,112 INFO L85 PathProgramCache]: Analyzing trace with hash -990786111, now seen corresponding path program 1 times [2024-11-09 06:53:46,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:53:46,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070286322] [2024-11-09 06:53:46,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:53:46,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:53:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:53:46,784 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 06:53:46,785 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:53:46,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070286322] [2024-11-09 06:53:46,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070286322] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:53:46,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879084340] [2024-11-09 06:53:46,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:53:46,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:53:46,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:53:46,788 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:53:46,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_384451f1-c369-4e4e-9f5e-4eeb1cede7f4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 06:53:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:53:47,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 149 conjuncts are in the unsatisfiable core [2024-11-09 06:53:47,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:53:47,114 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-09 06:53:47,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-09 06:53:47,667 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 06:53:47,667 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 17 treesize of output 21 [2024-11-09 06:53:47,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:53:47,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:53:48,145 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-11-09 06:53:48,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 55 [2024-11-09 06:53:48,171 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 39 treesize of output 30 [2024-11-09 06:53:48,377 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-09 06:53:48,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 48 [2024-11-09 06:53:48,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:53:48,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:53:48,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 06:53:48,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:53:48,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 06:53:48,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:53:48,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:53:48,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:53:48,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:53:48,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:53:48,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2024-11-09 06:53:48,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:53:48,761 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2024-11-09 06:53:48,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 114 treesize of output 87 [2024-11-09 06:53:48,828 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-09 06:53:48,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-09 06:53:49,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:53:49,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:53:49,723 INFO L349 Elim1Store]: treesize reduction 108, result has 23.9 percent of original size [2024-11-09 06:53:49,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 58 [2024-11-09 06:53:49,796 INFO L349 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2024-11-09 06:53:49,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 77 [2024-11-09 06:53:49,818 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 18 treesize of output 22 [2024-11-09 06:53:50,018 INFO L349 Elim1Store]: treesize reduction 72, result has 39.0 percent of original size [2024-11-09 06:53:50,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 106 [2024-11-09 06:53:50,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:53:50,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:53:50,126 INFO L349 Elim1Store]: treesize reduction 92, result has 21.4 percent of original size [2024-11-09 06:53:50,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 224 treesize of output 208 [2024-11-09 06:53:50,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:53:50,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:53:50,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:53:50,193 INFO L349 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2024-11-09 06:53:50,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 47 [2024-11-09 06:53:50,229 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-09 06:53:50,261 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:53:50,262 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 16 treesize of output 1 [2024-11-09 06:53:50,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 17 [2024-11-09 06:53:50,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 06:53:50,401 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 25 treesize of output 17 [2024-11-09 06:53:59,557 INFO L349 Elim1Store]: treesize reduction 36, result has 96.3 percent of original size [2024-11-09 06:53:59,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 1020 treesize of output 1798 [2024-11-09 06:54:57,518 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-09 06:54:58,880 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-09 06:54:59,180 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-09 06:54:59,203 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-09 06:54:59,401 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-09 06:54:59,900 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-09 06:54:59,921 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-09 06:55:00,104 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-09 06:55:00,118 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-09 06:55:00,437 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-09 06:55:00,457 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-09 06:55:00,668 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-09 06:55:00,689 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-09 06:55:01,620 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-09 06:55:01,641 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-09 06:55:02,896 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-09 06:55:03,449 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-09 06:55:04,380 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-09 06:55:04,401 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-09 06:55:05,257 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-09 06:55:05,272 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-09 06:55:05,357 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-09 06:55:05,975 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-09 06:55:05,996 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-09 06:55:06,365 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-09 06:55:06,461 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-09 06:55:06,714 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-09 06:55:06,730 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-09 06:55:06,811 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-09 06:55:07,179 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-09 06:55:07,196 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-09 06:55:07,287 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-09 06:55:07,609 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-09 06:55:07,623 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-09 06:55:14,446 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-09 06:55:14,469 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-09 06:55:14,881 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-09 06:55:14,903 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-09 06:55:18,214 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-09 06:55:19,001 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-09 06:55:19,020 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-09 06:55:19,119 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-09 06:55:19,471 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 11 treesize of output 7 [2024-11-09 06:55:19,500 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 11 treesize of output 7 [2024-11-09 06:56:35,725 WARN L286 SmtUtils]: Spent 8.93s on a formula simplification. DAG size of input: 1194 DAG size of output: 1333 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)