./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe7b4f63-60fa-4a3e-ba93-9d40180da63f/bin/utaipan-verify-QoSU8krkJ5/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe7b4f63-60fa-4a3e-ba93-9d40180da63f/bin/utaipan-verify-QoSU8krkJ5/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe7b4f63-60fa-4a3e-ba93-9d40180da63f/bin/utaipan-verify-QoSU8krkJ5/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe7b4f63-60fa-4a3e-ba93-9d40180da63f/bin/utaipan-verify-QoSU8krkJ5/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe7b4f63-60fa-4a3e-ba93-9d40180da63f/bin/utaipan-verify-QoSU8krkJ5/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe7b4f63-60fa-4a3e-ba93-9d40180da63f/bin/utaipan-verify-QoSU8krkJ5 --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 b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 18:56:13,275 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 18:56:13,390 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe7b4f63-60fa-4a3e-ba93-9d40180da63f/bin/utaipan-verify-QoSU8krkJ5/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-21 18:56:13,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 18:56:13,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 18:56:13,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 18:56:13,457 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 18:56:13,458 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 18:56:13,459 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 18:56:13,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 18:56:13,467 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-21 18:56:13,468 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-21 18:56:13,469 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-21 18:56:13,471 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-21 18:56:13,471 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-21 18:56:13,472 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-21 18:56:13,472 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-21 18:56:13,473 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-21 18:56:13,473 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-21 18:56:13,473 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-21 18:56:13,474 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-21 18:56:13,475 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-21 18:56:13,476 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 18:56:13,476 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 18:56:13,477 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 18:56:13,477 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 18:56:13,478 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 18:56:13,478 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 18:56:13,479 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 18:56:13,479 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 18:56:13,480 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 18:56:13,481 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 18:56:13,481 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 18:56:13,481 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 18:56:13,482 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 18:56:13,482 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 18:56:13,482 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 18:56:13,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 18:56:13,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 18:56:13,485 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 18:56:13,485 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 18:56:13,485 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-21 18:56:13,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 18:56:13,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 18:56:13,486 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 18:56:13,486 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-21 18:56:13,487 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 18:56:13,487 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_fe7b4f63-60fa-4a3e-ba93-9d40180da63f/bin/utaipan-verify-QoSU8krkJ5/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_fe7b4f63-60fa-4a3e-ba93-9d40180da63f/bin/utaipan-verify-QoSU8krkJ5 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 -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2023-11-21 18:56:13,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 18:56:13,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 18:56:13,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 18:56:13,808 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 18:56:13,809 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 18:56:13,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe7b4f63-60fa-4a3e-ba93-9d40180da63f/bin/utaipan-verify-QoSU8krkJ5/../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2023-11-21 18:56:17,124 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 18:56:17,473 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 18:56:17,474 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe7b4f63-60fa-4a3e-ba93-9d40180da63f/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2023-11-21 18:56:17,499 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe7b4f63-60fa-4a3e-ba93-9d40180da63f/bin/utaipan-verify-QoSU8krkJ5/data/d3678fe8b/e636b8f67dfb4672b5dfd77714769c1e/FLAG76f5fc036 [2023-11-21 18:56:17,516 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe7b4f63-60fa-4a3e-ba93-9d40180da63f/bin/utaipan-verify-QoSU8krkJ5/data/d3678fe8b/e636b8f67dfb4672b5dfd77714769c1e [2023-11-21 18:56:17,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 18:56:17,521 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 18:56:17,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 18:56:17,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 18:56:17,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 18:56:17,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 06:56:17" (1/1) ... [2023-11-21 18:56:17,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408bb547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:56:17, skipping insertion in model container [2023-11-21 18:56:17,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 06:56:17" (1/1) ... [2023-11-21 18:56:17,582 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 18:56:17,972 WARN L240 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_fe7b4f63-60fa-4a3e-ba93-9d40180da63f/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2023-11-21 18:56:17,985 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 18:56:17,998 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 18:56:18,061 WARN L240 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_fe7b4f63-60fa-4a3e-ba93-9d40180da63f/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2023-11-21 18:56:18,062 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 18:56:18,096 INFO L206 MainTranslator]: Completed translation [2023-11-21 18:56:18,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:56:18 WrapperNode [2023-11-21 18:56:18,097 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 18:56:18,098 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 18:56:18,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 18:56:18,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 18:56:18,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:56:18" (1/1) ... [2023-11-21 18:56:18,130 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:56:18" (1/1) ... [2023-11-21 18:56:18,163 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 174 [2023-11-21 18:56:18,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 18:56:18,169 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 18:56:18,169 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 18:56:18,170 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 18:56:18,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:56:18" (1/1) ... [2023-11-21 18:56:18,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:56:18" (1/1) ... [2023-11-21 18:56:18,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:56:18" (1/1) ... [2023-11-21 18:56:18,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:56:18" (1/1) ... [2023-11-21 18:56:18,199 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:56:18" (1/1) ... [2023-11-21 18:56:18,203 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:56:18" (1/1) ... [2023-11-21 18:56:18,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:56:18" (1/1) ... [2023-11-21 18:56:18,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:56:18" (1/1) ... [2023-11-21 18:56:18,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 18:56:18,213 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 18:56:18,214 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 18:56:18,214 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 18:56:18,215 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:56:18" (1/1) ... [2023-11-21 18:56:18,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 18:56:18,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe7b4f63-60fa-4a3e-ba93-9d40180da63f/bin/utaipan-verify-QoSU8krkJ5/z3 [2023-11-21 18:56:18,257 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe7b4f63-60fa-4a3e-ba93-9d40180da63f/bin/utaipan-verify-QoSU8krkJ5/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 18:56:18,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe7b4f63-60fa-4a3e-ba93-9d40180da63f/bin/utaipan-verify-QoSU8krkJ5/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 18:56:18,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 18:56:18,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 18:56:18,293 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-21 18:56:18,294 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-21 18:56:18,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 18:56:18,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 18:56:18,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 18:56:18,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-21 18:56:18,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-21 18:56:18,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 18:56:18,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-21 18:56:18,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 18:56:18,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 18:56:18,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 18:56:18,442 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 18:56:18,444 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 18:56:18,824 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 18:56:18,977 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 18:56:18,977 INFO L308 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-21 18:56:18,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 06:56:18 BoogieIcfgContainer [2023-11-21 18:56:18,980 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 18:56:18,984 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 18:56:18,985 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 18:56:18,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 18:56:18,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 06:56:17" (1/3) ... [2023-11-21 18:56:18,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57700b8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 06:56:18, skipping insertion in model container [2023-11-21 18:56:18,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:56:18" (2/3) ... [2023-11-21 18:56:18,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57700b8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 06:56:18, skipping insertion in model container [2023-11-21 18:56:18,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 06:56:18" (3/3) ... [2023-11-21 18:56:18,995 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2023-11-21 18:56:19,018 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 18:56:19,018 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-21 18:56:19,075 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 18:56:19,082 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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;@d801029, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 18:56:19,082 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 18:56:19,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 states have internal predecessors, (37), 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) [2023-11-21 18:56:19,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-21 18:56:19,094 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 18:56:19,095 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 18:56:19,096 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 18:56:19,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 18:56:19,101 INFO L85 PathProgramCache]: Analyzing trace with hash 2126984656, now seen corresponding path program 1 times [2023-11-21 18:56:19,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 18:56:19,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052673452] [2023-11-21 18:56:19,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 18:56:19,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 18:56:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 18:56:19,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 18:56:19,818 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 18:56:19,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052673452] [2023-11-21 18:56:19,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052673452] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 18:56:19,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 18:56:19,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 18:56:19,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791390860] [2023-11-21 18:56:19,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 18:56:19,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 18:56:19,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 18:56:19,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 18:56:19,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 18:56:19,891 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 states have internal predecessors, (37), 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 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-11-21 18:56:20,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 18:56:20,054 INFO L93 Difference]: Finished difference Result 55 states and 82 transitions. [2023-11-21 18:56:20,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 18:56:20,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 16 [2023-11-21 18:56:20,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 18:56:20,066 INFO L225 Difference]: With dead ends: 55 [2023-11-21 18:56:20,066 INFO L226 Difference]: Without dead ends: 26 [2023-11-21 18:56:20,069 INFO L412 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 [2023-11-21 18:56:20,077 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 18:56:20,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 18:56:20,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-21 18:56:20,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-11-21 18:56:20,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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) [2023-11-21 18:56:20,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2023-11-21 18:56:20,134 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 16 [2023-11-21 18:56:20,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 18:56:20,135 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2023-11-21 18:56:20,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-11-21 18:56:20,137 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2023-11-21 18:56:20,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-21 18:56:20,139 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 18:56:20,139 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 18:56:20,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 18:56:20,141 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 18:56:20,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 18:56:20,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1438178616, now seen corresponding path program 1 times [2023-11-21 18:56:20,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 18:56:20,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004233805] [2023-11-21 18:56:20,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 18:56:20,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 18:56:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 18:56:20,550 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 18:56:20,551 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 18:56:20,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004233805] [2023-11-21 18:56:20,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004233805] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 18:56:20,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 18:56:20,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 18:56:20,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89404439] [2023-11-21 18:56:20,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 18:56:20,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 18:56:20,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 18:56:20,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 18:56:20,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 18:56:20,558 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-21 18:56:20,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 18:56:20,707 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2023-11-21 18:56:20,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 18:56:20,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2023-11-21 18:56:20,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 18:56:20,709 INFO L225 Difference]: With dead ends: 36 [2023-11-21 18:56:20,709 INFO L226 Difference]: Without dead ends: 25 [2023-11-21 18:56:20,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 18:56:20,711 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 20 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 18:56:20,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 48 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 18:56:20,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-21 18:56:20,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-21 18:56:20,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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) [2023-11-21 18:56:20,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2023-11-21 18:56:20,727 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 22 [2023-11-21 18:56:20,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 18:56:20,728 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2023-11-21 18:56:20,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-21 18:56:20,728 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2023-11-21 18:56:20,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-21 18:56:20,729 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 18:56:20,730 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 18:56:20,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 18:56:20,730 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 18:56:20,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 18:56:20,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1746210744, now seen corresponding path program 1 times [2023-11-21 18:56:20,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 18:56:20,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925912110] [2023-11-21 18:56:20,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 18:56:20,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 18:56:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 18:56:23,694 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 18:56:23,695 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 18:56:23,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925912110] [2023-11-21 18:56:23,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925912110] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 18:56:23,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078037271] [2023-11-21 18:56:23,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 18:56:23,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 18:56:23,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe7b4f63-60fa-4a3e-ba93-9d40180da63f/bin/utaipan-verify-QoSU8krkJ5/z3 [2023-11-21 18:56:23,701 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe7b4f63-60fa-4a3e-ba93-9d40180da63f/bin/utaipan-verify-QoSU8krkJ5/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 18:56:23,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe7b4f63-60fa-4a3e-ba93-9d40180da63f/bin/utaipan-verify-QoSU8krkJ5/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-21 18:56:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 18:56:24,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 135 conjunts are in the unsatisfiable core [2023-11-21 18:56:24,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 18:56:24,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 18:56:24,705 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 [2023-11-21 18:56:24,847 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 18:56:24,848 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 [2023-11-21 18:56:24,979 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 [2023-11-21 18:56:25,137 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 [2023-11-21 18:56:25,338 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 46 treesize of output 26 [2023-11-21 18:56:25,345 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 [2023-11-21 18:56:25,357 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 [2023-11-21 18:56:25,364 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 [2023-11-21 18:56:25,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 18:56:25,708 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 16 treesize of output 11 [2023-11-21 18:56:25,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 18:56:25,731 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 54 treesize of output 41 [2023-11-21 18:56:25,757 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-21 18:56:25,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-21 18:56:25,771 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 20 treesize of output 15 [2023-11-21 18:56:26,357 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-21 18:56:26,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 77 [2023-11-21 18:56:26,407 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-21 18:56:26,408 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 185 treesize of output 130 [2023-11-21 18:56:26,421 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-21 18:56:26,422 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 168 treesize of output 75 [2023-11-21 18:56:26,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 18:56:26,441 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-11-21 18:56:26,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 18:56:26,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 18:56:26,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2023-11-21 18:56:26,476 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-11-21 18:56:26,481 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 [2023-11-21 18:56:26,607 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 18:56:26,607 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 18:56:29,325 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0)) (.cse0 (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 0))) (and (or (forall ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 Int) (v_DerPreprocessor_22 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_DerPreprocessor_19)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_21) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (and .cse0 .cse1)) (or (not .cse1) (not .cse0) (let ((.cse7 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0)) (.cse8 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0))) (and (or (and (forall ((v_DerPreprocessor_82 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_83))) (or (forall ((v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_81 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_80) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_81))) (or (not (= v_DerPreprocessor_80 (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (forall ((v_DerPreprocessor_84 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_84) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))) (not (= v_DerPreprocessor_82 (select .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))))) (forall ((v_DerPreprocessor_82 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_83))) (or (forall ((v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_81 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_80) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_81))) (or (forall ((v_DerPreprocessor_85 (Array Int Int)) (v_DerPreprocessor_86 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_85) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_86))) (or (not (= v_DerPreprocessor_85 (select .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse5 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) (not (= v_DerPreprocessor_80 (select .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))))) (not (= v_DerPreprocessor_82 (select .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))))))) (not .cse7) (not .cse8)) (or (and .cse7 .cse8) (and (or (forall ((v_ArrVal_338 (Array Int Int))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_338) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (not (= .cse9 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))) (forall ((v_DerPreprocessor_77 (Array Int Int)) (v_DerPreprocessor_78 (Array Int Int)) (v_DerPreprocessor_79 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_78) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_77) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_79) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (or (forall ((v_ArrVal_338 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_338) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (let ((.cse14 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse24 (not .cse14))) (and (or (forall ((v_DerPreprocessor_64 (Array Int Int)) (v_DerPreprocessor_65 (Array Int Int)) (v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_66 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_67 (Array Int Int)) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_64) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_65))) (let ((.cse10 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse12 (store (store |c_#memory_int| .cse10 v_DerPreprocessor_66) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_67)) (.cse11 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_68) .cse10 v_DerPreprocessor_69) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_70))) (or (not (= .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (not (= v_DerPreprocessor_68 (select .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (not (= (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_11) .cse10 (select .cse12 .cse10)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_DerPreprocessor_11)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse12 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))))) .cse14) (or (and (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse16 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_55) v_DerPreprocessor_13 v_DerPreprocessor_56) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_57))) (let ((.cse15 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select .cse16 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) v_DerPreprocessor_13 (select .cse16 v_DerPreprocessor_13)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= v_DerPreprocessor_13 .cse15)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_58) .cse15 v_DerPreprocessor_59) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_60) (select (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_61) .cse15 v_DerPreprocessor_62) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_63) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (= v_DerPreprocessor_13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) (= v_DerPreprocessor_13 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))) (forall ((v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_49))) (let ((.cse18 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select .cse19 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse17 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_52) .cse18 v_DerPreprocessor_53) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_54))) (or (not (= (select .cse17 .cse18) v_DerPreprocessor_53)) (not (= .cse18 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_51) (select (select .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))))) .cse14) (or (and (forall ((v_prenex_19 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse21 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse20 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_45) .cse21 v_DerPreprocessor_46) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_47))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_44) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= (select .cse20 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_DerPreprocessor_45)) (not (= v_prenex_18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_prenex_18) .cse21 v_prenex_19) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (not (= .cse21 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (not (= (select .cse20 .cse21) v_DerPreprocessor_46)))))) (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse23 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse22 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_41) .cse23 v_DerPreprocessor_42) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_43))) (or (not (= (select .cse22 .cse23) v_DerPreprocessor_42)) (not (= (select .cse22 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_DerPreprocessor_41)) (not (= .cse23 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_40) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_prenex_17) .cse23 v_DerPreprocessor_12) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_prenex_17))))))) .cse24) (or (and (forall ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse25 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse26 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| .cse25) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse27 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_25) .cse26 v_DerPreprocessor_26) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_27))) (or (not (= .cse25 v_DerPreprocessor_14)) (not (= v_prenex_17 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_prenex_17) .cse26 v_DerPreprocessor_12) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (not (= .cse26 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (not (= v_DerPreprocessor_26 (select .cse27 .cse26))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_24) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse27 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= (select .cse27 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_DerPreprocessor_25))))))) (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_$Pointer$.base| v_DerPreprocessor_13 v_DerPreprocessor_32) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_33))) (let ((.cse28 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_14) v_DerPreprocessor_13 (select .cse30 v_DerPreprocessor_13)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse29 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_36) .cse28 v_DerPreprocessor_37) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_38))) (or (not (= v_DerPreprocessor_13 .cse28)) (= v_DerPreprocessor_13 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= v_DerPreprocessor_36 (select .cse29 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse28 v_DerPreprocessor_34) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_35) (select (select .cse30 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select .cse29 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_prenex_19 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse31 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse33 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| .cse31) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse32 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_29) .cse33 v_DerPreprocessor_30) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_31))) (or (not (= .cse31 v_DerPreprocessor_14)) (not (= v_DerPreprocessor_29 (select .cse32 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (not (= .cse33 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (not (= v_DerPreprocessor_30 (select .cse32 .cse33))) (not (= (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_prenex_18) .cse33 v_prenex_19) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_prenex_18)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_28) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse32 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))))) .cse24))))) (forall ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int)) (v_DerPreprocessor_72 (Array Int Int))) (let ((.cse34 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_338) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse34 v_DerPreprocessor_71) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_72) (select (select (store (store |c_#memory_$Pointer$.base| .cse34 v_DerPreprocessor_73) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_74) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse34 v_DerPreprocessor_75) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_76) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (= .cse34 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= .cse34 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))))))))))) is different from false [2023-11-21 18:56:35,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078037271] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 18:56:35,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1528357342] [2023-11-21 18:56:35,830 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-21 18:56:35,830 INFO L166 IcfgInterpreter]: Building call graph [2023-11-21 18:56:35,834 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-21 18:56:35,839 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-21 18:56:35,840 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-21 18:56:37,445 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-11-21 18:56:37,456 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-21 18:56:46,874 WARN L293 SmtUtils]: Spent 6.74s on a formula simplification that was a NOOP. DAG size: 176 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-21 18:57:12,588 WARN L293 SmtUtils]: Spent 6.59s on a formula simplification that was a NOOP. DAG size: 176 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-21 18:57:12,591 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '359#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |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_ULTIMATE.start_sll_circular_insert_#t~mem13#1.base_22| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.base_35| Int) (|v_#memory_int_139| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.base_21| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.offset_36| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.offset_35| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.offset_35| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.base_36| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.base_21| Int) (|v_#memory_int_84| (Array Int (Array Int Int))) (|v_#memory_int_85| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_99| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_23| Int) (|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.base_35| Int) (|v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_25| Int) (|v_#memory_$Pointer$.offset_73| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_23| Int) (|v_#memory_$Pointer$.offset_99| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_27| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.offset_21| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.offset_21| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.offset_22| Int) (|v_#memory_int_83| (Array Int (Array Int Int)))) (and (<= 2 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) (or (and (= |v_#memory_int_83| (store |v_#memory_int_139| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27| (store (select |v_#memory_int_139| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_27| (select (select |v_#memory_int_83| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_27|)))) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.base_36| |v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.base_22|) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27| (store (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_27| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select (store |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27| (store (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_27| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_23|))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27| (store (select |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_27| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select (store |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27| (store (select |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_27| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_23|))) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.base_35| |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.base_21|) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.offset_35| |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.offset_21|) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.offset_36| |v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.offset_22|) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.base_35| |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.base_21|) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.offset_35| |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.offset_21|) (= |#memory_int| (store |v_#memory_int_83| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_int_83| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0)))) (or (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_27| 0)) (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27| 0)))) (and (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_27| 0) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_73| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25| (store (select |v_#memory_$Pointer$.offset_73| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0 0))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25| (store (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0 |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|))) (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_27| 0) (= |#memory_int| (store |v_#memory_int_84| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25| (store (select |v_#memory_int_84| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0)))) (or (and (= |v_#memory_$Pointer$.base_73| (store (store |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) (select (select (store |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0) (store (select (store |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) (select (select (store |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0)) (select (select (store |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|))) (= (store |v_#memory_int_139| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_int_139| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_int_85| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0))) |v_#memory_int_85|) (or (not (= (select (select |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0) 0)) (not (= (select (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0) 0))) (= |v_#memory_int_84| (store |v_#memory_int_85| (select (select (store |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0) (store (select |v_#memory_int_85| (select (select (store |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0)) (select (select (store |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0) (select (select |v_#memory_int_84| (select (select (store |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0)) (select (select (store |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))))) (= (store (store |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) (select (select (store |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0) (store (select (store |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) (select (select (store |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0)) (select (select (store |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0) 0)) |v_#memory_$Pointer$.offset_73|)) (and (= |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.base_35| |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.base_21|) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.offset_35| |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.offset_21|) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.base_35| |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.base_21|) (= (store |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 0)) |v_#memory_$Pointer$.offset_73|) (= (select (select |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0) 0) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.offset_35| |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.offset_21|) (= (select (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0) 0) (= (store |v_#memory_int_139| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_int_139| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_int_84| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0))) |v_#memory_int_84|) (= |v_#memory_$Pointer$.base_73| (store |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|))))))))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |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 [2023-11-21 18:57:12,591 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-21 18:57:12,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 18:57:12,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 38 [2023-11-21 18:57:12,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866112637] [2023-11-21 18:57:12,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 18:57:12,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-21 18:57:12,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 18:57:12,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-21 18:57:12,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2850, Unknown=63, NotChecked=108, Total=3192 [2023-11-21 18:57:12,599 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 38 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-21 18:57:14,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 18:57:14,816 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2023-11-21 18:57:14,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-21 18:57:14,817 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 6 states have call successors, (6), 3 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 23 [2023-11-21 18:57:14,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 18:57:14,818 INFO L225 Difference]: With dead ends: 32 [2023-11-21 18:57:14,818 INFO L226 Difference]: Without dead ends: 30 [2023-11-21 18:57:14,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 43.5s TimeCoverageRelationStatistics Valid=249, Invalid=3846, Unknown=69, NotChecked=126, Total=4290 [2023-11-21 18:57:14,822 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-21 18:57:14,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 255 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-21 18:57:14,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-21 18:57:14,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2023-11-21 18:57:14,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 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) [2023-11-21 18:57:14,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2023-11-21 18:57:14,831 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 23 [2023-11-21 18:57:14,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 18:57:14,832 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2023-11-21 18:57:14,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-21 18:57:14,832 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2023-11-21 18:57:14,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-21 18:57:14,833 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 18:57:14,834 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 18:57:14,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe7b4f63-60fa-4a3e-ba93-9d40180da63f/bin/utaipan-verify-QoSU8krkJ5/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-21 18:57:15,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe7b4f63-60fa-4a3e-ba93-9d40180da63f/bin/utaipan-verify-QoSU8krkJ5/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 18:57:15,036 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 18:57:15,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 18:57:15,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1589695176, now seen corresponding path program 2 times [2023-11-21 18:57:15,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 18:57:15,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661808165] [2023-11-21 18:57:15,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 18:57:15,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 18:57:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 18:57:15,211 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 18:57:15,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 18:57:15,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661808165] [2023-11-21 18:57:15,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661808165] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 18:57:15,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 18:57:15,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 18:57:15,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417468329] [2023-11-21 18:57:15,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 18:57:15,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 18:57:15,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 18:57:15,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 18:57:15,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 18:57:15,215 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-21 18:57:15,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 18:57:15,293 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2023-11-21 18:57:15,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 18:57:15,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-11-21 18:57:15,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 18:57:15,294 INFO L225 Difference]: With dead ends: 39 [2023-11-21 18:57:15,295 INFO L226 Difference]: Without dead ends: 27 [2023-11-21 18:57:15,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-21 18:57:15,296 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 18:57:15,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 49 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 18:57:15,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-21 18:57:15,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-21 18:57:15,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 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) [2023-11-21 18:57:15,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2023-11-21 18:57:15,304 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 24 [2023-11-21 18:57:15,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 18:57:15,305 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2023-11-21 18:57:15,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-21 18:57:15,305 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2023-11-21 18:57:15,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-21 18:57:15,306 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 18:57:15,307 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 18:57:15,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 18:57:15,307 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 18:57:15,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 18:57:15,308 INFO L85 PathProgramCache]: Analyzing trace with hash -638854178, now seen corresponding path program 1 times [2023-11-21 18:57:15,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 18:57:15,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292218647] [2023-11-21 18:57:15,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 18:57:15,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 18:57:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 18:57:15,692 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 18:57:15,693 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 18:57:15,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292218647] [2023-11-21 18:57:15,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292218647] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 18:57:15,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179776012] [2023-11-21 18:57:15,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 18:57:15,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 18:57:15,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe7b4f63-60fa-4a3e-ba93-9d40180da63f/bin/utaipan-verify-QoSU8krkJ5/z3 [2023-11-21 18:57:15,697 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe7b4f63-60fa-4a3e-ba93-9d40180da63f/bin/utaipan-verify-QoSU8krkJ5/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 18:57:15,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe7b4f63-60fa-4a3e-ba93-9d40180da63f/bin/utaipan-verify-QoSU8krkJ5/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 18:57:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 18:57:15,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-21 18:57:15,910 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 18:57:15,968 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 18:57:15,969 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 18:57:16,035 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 18:57:16,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179776012] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 18:57:16,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [793276617] [2023-11-21 18:57:16,039 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-21 18:57:16,039 INFO L166 IcfgInterpreter]: Building call graph [2023-11-21 18:57:16,040 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-21 18:57:16,040 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-21 18:57:16,040 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs