./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70b6b724-fcc2-487a-96b5-70e68daf333c/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70b6b724-fcc2-487a-96b5-70e68daf333c/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70b6b724-fcc2-487a-96b5-70e68daf333c/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70b6b724-fcc2-487a-96b5-70e68daf333c/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70b6b724-fcc2-487a-96b5-70e68daf333c/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70b6b724-fcc2-487a-96b5-70e68daf333c/bin/utaipan-verify-NcY6lQBIFX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:12:43,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:12:43,215 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70b6b724-fcc2-487a-96b5-70e68daf333c/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-12 00:12:43,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:12:43,221 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:12:43,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:12:43,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:12:43,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:12:43,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:12:43,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:12:43,267 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:12:43,268 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:12:43,268 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:12:43,270 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:12:43,270 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:12:43,271 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:12:43,271 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:12:43,272 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:12:43,272 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:12:43,273 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:12:43,273 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:12:43,274 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:12:43,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:12:43,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:12:43,276 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:12:43,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:12:43,276 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:12:43,277 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:12:43,277 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:12:43,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:12:43,279 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:12:43,279 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:12:43,279 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:12:43,280 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:12:43,280 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:12:43,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:12:43,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:12:43,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:12:43,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:12:43,281 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:12:43,282 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:12:43,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:12:43,282 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:12:43,282 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:12:43,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:12:43,283 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_70b6b724-fcc2-487a-96b5-70e68daf333c/bin/utaipan-verify-NcY6lQBIFX/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_70b6b724-fcc2-487a-96b5-70e68daf333c/bin/utaipan-verify-NcY6lQBIFX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2023-11-12 00:12:43,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:12:43,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:12:43,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:12:43,632 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:12:43,632 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:12:43,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70b6b724-fcc2-487a-96b5-70e68daf333c/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2023-11-12 00:12:46,821 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:12:47,167 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:12:47,167 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70b6b724-fcc2-487a-96b5-70e68daf333c/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2023-11-12 00:12:47,188 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70b6b724-fcc2-487a-96b5-70e68daf333c/bin/utaipan-verify-NcY6lQBIFX/data/2f7c7d215/62c2bf595bf046b795981b2d6fc24226/FLAGfdaf7acf1 [2023-11-12 00:12:47,206 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70b6b724-fcc2-487a-96b5-70e68daf333c/bin/utaipan-verify-NcY6lQBIFX/data/2f7c7d215/62c2bf595bf046b795981b2d6fc24226 [2023-11-12 00:12:47,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:12:47,214 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:12:47,219 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:12:47,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:12:47,225 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:12:47,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:12:47" (1/1) ... [2023-11-12 00:12:47,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@494d97f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:12:47, skipping insertion in model container [2023-11-12 00:12:47,229 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:12:47" (1/1) ... [2023-11-12 00:12:47,289 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:12:47,698 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_70b6b724-fcc2-487a-96b5-70e68daf333c/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2023-11-12 00:12:47,703 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:12:47,714 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:12:47,807 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_70b6b724-fcc2-487a-96b5-70e68daf333c/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2023-11-12 00:12:47,809 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:12:47,848 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:12:47,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:12:47 WrapperNode [2023-11-12 00:12:47,848 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:12:47,849 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:12:47,849 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:12:47,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:12:47,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:12:47" (1/1) ... [2023-11-12 00:12:47,875 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:12:47" (1/1) ... [2023-11-12 00:12:47,905 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 161 [2023-11-12 00:12:47,905 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:12:47,906 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:12:47,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:12:47,907 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:12:47,917 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:12:47" (1/1) ... [2023-11-12 00:12:47,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:12:47" (1/1) ... [2023-11-12 00:12:47,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:12:47" (1/1) ... [2023-11-12 00:12:47,923 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:12:47" (1/1) ... [2023-11-12 00:12:47,932 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:12:47" (1/1) ... [2023-11-12 00:12:47,939 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:12:47" (1/1) ... [2023-11-12 00:12:47,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:12:47" (1/1) ... [2023-11-12 00:12:47,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:12:47" (1/1) ... [2023-11-12 00:12:47,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:12:47,965 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:12:47,965 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:12:47,965 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:12:47,966 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:12:47" (1/1) ... [2023-11-12 00:12:47,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:12:47,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70b6b724-fcc2-487a-96b5-70e68daf333c/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:12:48,014 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70b6b724-fcc2-487a-96b5-70e68daf333c/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:12:48,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70b6b724-fcc2-487a-96b5-70e68daf333c/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:12:48,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:12:48,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:12:48,060 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-12 00:12:48,060 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-12 00:12:48,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:12:48,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:12:48,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:12:48,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:12:48,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:12:48,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:12:48,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 00:12:48,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:12:48,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:12:48,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:12:48,199 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:12:48,201 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:12:48,460 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:12:48,529 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:12:48,529 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-12 00:12:48,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:12:48 BoogieIcfgContainer [2023-11-12 00:12:48,532 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:12:48,556 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:12:48,556 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:12:48,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:12:48,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:12:47" (1/3) ... [2023-11-12 00:12:48,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@136e4064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:12:48, skipping insertion in model container [2023-11-12 00:12:48,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:12:47" (2/3) ... [2023-11-12 00:12:48,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@136e4064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:12:48, skipping insertion in model container [2023-11-12 00:12:48,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:12:48" (3/3) ... [2023-11-12 00:12:48,563 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2023-11-12 00:12:48,596 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:12:48,596 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 00:12:48,641 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:12:48,647 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;@79aebed6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:12:48,648 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 00:12:48,651 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 27 states have internal predecessors, (41), 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-12 00:12:48,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-12 00:12:48,657 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:12:48,658 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:12:48,659 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:12:48,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:12:48,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1374255989, now seen corresponding path program 1 times [2023-11-12 00:12:48,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:12:48,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286604359] [2023-11-12 00:12:48,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:12:48,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:12:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:12:49,163 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-12 00:12:49,163 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:12:49,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286604359] [2023-11-12 00:12:49,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286604359] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:12:49,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:12:49,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:12:49,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124158108] [2023-11-12 00:12:49,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:12:49,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:12:49,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:12:49,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:12:49,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:12:49,203 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 27 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12 00:12:49,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:12:49,251 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2023-11-12 00:12:49,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:12:49,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 18 [2023-11-12 00:12:49,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:12:49,259 INFO L225 Difference]: With dead ends: 61 [2023-11-12 00:12:49,259 INFO L226 Difference]: Without dead ends: 29 [2023-11-12 00:12:49,262 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-12 00:12:49,266 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:12:49,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 70 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:12:49,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-12 00:12:49,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-11-12 00:12:49,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 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-12 00:12:49,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2023-11-12 00:12:49,308 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2023-11-12 00:12:49,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:12:49,308 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2023-11-12 00:12:49,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12 00:12:49,309 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2023-11-12 00:12:49,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-12 00:12:49,311 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:12:49,311 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:12:49,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:12:49,312 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:12:49,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:12:49,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1632824436, now seen corresponding path program 1 times [2023-11-12 00:12:49,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:12:49,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819610605] [2023-11-12 00:12:49,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:12:49,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:12:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:12:50,125 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:12:50,126 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:12:50,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819610605] [2023-11-12 00:12:50,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819610605] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:12:50,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864378201] [2023-11-12 00:12:50,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:12:50,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:12:50,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70b6b724-fcc2-487a-96b5-70e68daf333c/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:12:50,133 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70b6b724-fcc2-487a-96b5-70e68daf333c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:12:50,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70b6b724-fcc2-487a-96b5-70e68daf333c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:12:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:12:50,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-12 00:12:50,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:12:50,618 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-12 00:12:50,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:12:50,690 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-12 00:12:50,734 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-12 00:12:50,757 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:12:50,757 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:12:50,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864378201] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:12:50,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1755207755] [2023-11-12 00:12:50,948 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-11-12 00:12:50,948 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:12:50,953 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:12:50,959 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:12:50,959 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:12:53,654 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-11-12 00:12:53,666 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:13:08,506 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '273#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~last~2#1.offset|) (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_14| Int) (|v_#memory_$Pointer$.base_60| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_57| (Array Int (Array Int Int))) (|v_#memory_int_68| (Array Int (Array Int Int))) (|v_#memory_int_16| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_append_#in~head#1.base_8| Int)) (and (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_57| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.offset_57| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 0)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_14| (store (select (store |v_#memory_$Pointer$.offset_57| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.offset_57| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 0)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0 0))) (or (and (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_14| |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_8|) (exists ((|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_57| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 4))) |v_#memory_$Pointer$.offset_57|)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_64| (Array Int (Array Int Int))) (|v_#memory_int_38| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_64| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_int_64| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 (select (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0))) |v_#memory_int_38|) (= |v_#memory_int_68| (store |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 4 5))))) (exists ((|v_#length_21| (Array Int Int))) (= |#length| (store |v_#length_21| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 8))) (exists ((|v_#memory_int_67| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_56| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| Int) (|v_old(#memory_int)_AFTER_CALL_12| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_59| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_56| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.offset_56| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_int_67| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_int_67| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_12| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0))) |v_old(#memory_int)_AFTER_CALL_12|) (= (select (select (store |v_#memory_$Pointer$.base_59| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.base_59| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 0)) (exists ((|v_#valid_33| (Array Int Int))) (and (= |#valid| (store |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 1)) (= (select |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0))) (= |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_8| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_56| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.base_60| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 4))) |v_#memory_$Pointer$.base_60|))) (and (exists ((|v_#memory_int_67| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_56| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| Int) (|v_#memory_$Pointer$.base_59| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_21| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_56| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.offset_56| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select (store |v_#memory_$Pointer$.base_59| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.base_59| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|) (= (store |v_#memory_int_67| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_int_67| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 (select (select |v_#memory_int_BEFORE_CALL_21| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0))) |v_#memory_int_BEFORE_CALL_21|))) (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_14| |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_8|) (exists ((|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_57| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 4))) |v_#memory_$Pointer$.offset_57|)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_64| (Array Int (Array Int Int))) (|v_#memory_int_38| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_64| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_int_64| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 (select (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0))) |v_#memory_int_38|) (= |v_#memory_int_68| (store |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 4 5))))) (exists ((|v_#length_21| (Array Int Int))) (= |#length| (store |v_#length_21| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 8))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 0)) (exists ((|v_#valid_33| (Array Int Int))) (and (= |#valid| (store |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 1)) (= (select |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0))) (= |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_8| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_56| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.base_60| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 4))) |v_#memory_$Pointer$.base_60|)))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_60| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.base_60| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0))) |v_ULTIMATE.start_sll_circular_append_~head#1.base_14| (store (select (store |v_#memory_$Pointer$.base_60| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.base_60| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0))) |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)))) (= |#memory_int| (store |v_#memory_int_16| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14| (store (select |v_#memory_int_16| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)))) (<= 2 |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_8|) (= |v_#memory_int_16| (store |v_#memory_int_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_int_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 (select (select |v_#memory_int_16| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0)))) (= (select (select |v_#memory_$Pointer$.offset_57| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 0) (= 0 (select (select |v_#memory_$Pointer$.base_60| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) (<= 2 |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (= |ULTIMATE.start_main_~last~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~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-12 00:13:08,507 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:13:08,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:13:08,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2023-11-12 00:13:08,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151119633] [2023-11-12 00:13:08,509 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:13:08,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-12 00:13:08,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:08,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-12 00:13:08,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1354, Unknown=16, NotChecked=0, Total=1482 [2023-11-12 00:13:08,515 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:13:09,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:09,237 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2023-11-12 00:13:09,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 00:13:09,241 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 25 [2023-11-12 00:13:09,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:09,242 INFO L225 Difference]: With dead ends: 40 [2023-11-12 00:13:09,242 INFO L226 Difference]: Without dead ends: 29 [2023-11-12 00:13:09,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=164, Invalid=1799, Unknown=17, NotChecked=0, Total=1980 [2023-11-12 00:13:09,245 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 53 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:09,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 237 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:13:09,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-12 00:13:09,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-11-12 00:13:09,252 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-12 00:13:09,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2023-11-12 00:13:09,254 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 25 [2023-11-12 00:13:09,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:09,257 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2023-11-12 00:13:09,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:13:09,258 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2023-11-12 00:13:09,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-12 00:13:09,259 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:09,259 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:13:09,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70b6b724-fcc2-487a-96b5-70e68daf333c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:13:09,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70b6b724-fcc2-487a-96b5-70e68daf333c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:13:09,460 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:13:09,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:09,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1696549931, now seen corresponding path program 1 times [2023-11-12 00:13:09,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:09,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320757735] [2023-11-12 00:13:09,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:09,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:13:10,750 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:10,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320757735] [2023-11-12 00:13:10,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320757735] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:13:10,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133966088] [2023-11-12 00:13:10,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:10,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:13:10,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70b6b724-fcc2-487a-96b5-70e68daf333c/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:13:10,753 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70b6b724-fcc2-487a-96b5-70e68daf333c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:13:10,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70b6b724-fcc2-487a-96b5-70e68daf333c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:13:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:10,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 97 conjunts are in the unsatisfiable core [2023-11-12 00:13:10,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:13:10,957 INFO L351 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-12 00:13:11,258 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-12 00:13:11,258 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-12 00:13:11,367 INFO L351 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-12 00:13:11,465 INFO L322 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-12 00:13:11,466 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 41 [2023-11-12 00:13:11,573 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:13:11,573 INFO L351 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 48 treesize of output 23 [2023-11-12 00:13:11,579 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 00:13:11,585 INFO L351 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-12 00:13:11,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:13:11,757 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-12 00:13:11,758 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 45 [2023-11-12 00:13:11,780 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-12 00:13:11,780 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-12 00:13:11,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:13:11,823 INFO L351 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-12 00:13:12,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:13:12,214 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-11-12 00:13:12,259 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-12 00:13:12,260 INFO L351 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 69 treesize of output 57 [2023-11-12 00:13:12,307 INFO L322 Elim1Store]: treesize reduction 74, result has 21.3 percent of original size [2023-11-12 00:13:12,308 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 101 [2023-11-12 00:13:12,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:13:12,324 INFO L351 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 11 [2023-11-12 00:13:12,351 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2023-11-12 00:13:12,486 INFO L351 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-12 00:13:12,560 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:13:12,561 INFO L351 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 44 treesize of output 19 [2023-11-12 00:13:12,565 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:12,565 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:13:12,587 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_307))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2023-11-12 00:13:13,080 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16| Int) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16|) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16|) .cse2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_307))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16|) .cse2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) is different from false [2023-11-12 00:13:13,200 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16| Int) (v_ArrVal_314 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_313 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_19| Int)) (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_19| v_ArrVal_314))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_19|) 0)) (not (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_19| v_ArrVal_313))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16| (store (select .cse4 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16|) .cse3 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_19|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_19| v_ArrVal_307))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16| (store (select .cse2 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16|) .cse3 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_19| v_ArrVal_308) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) (< (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16|) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_19| 1))))) is different from false [2023-11-12 00:13:13,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133966088] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:13:13,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [545775569] [2023-11-12 00:13:13,206 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-11-12 00:13:13,206 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:13:13,206 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:13:13,207 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:13:13,207 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:13:15,063 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-11-12 00:13:15,075 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:13:35,813 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '547#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~last~2#1.offset|) (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (= |ULTIMATE.start_main_~last~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (exists ((|v_#memory_$Pointer$.offset_72| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_77| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_append_#in~head#1.base_10| Int) (|v_#memory_int_20| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_16| Int) (|v_#memory_int_87| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15| Int)) (and (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_72| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_$Pointer$.offset_72| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) (select (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 0)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15| (store (select (store |v_#memory_$Pointer$.offset_72| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_$Pointer$.offset_72| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) (select (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 0)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15|) 0 (select (select (store |v_#memory_$Pointer$.offset_72| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_$Pointer$.offset_72| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) (select (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 0)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)))) (= (store (store |v_#memory_$Pointer$.base_77| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_$Pointer$.base_77| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) (select (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15|)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15| (store (select (store |v_#memory_$Pointer$.base_77| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_$Pointer$.base_77| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) (select (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15|)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15|) 0 (select (select (store |v_#memory_$Pointer$.base_77| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_$Pointer$.base_77| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) (select (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15|)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0))) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_20| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15| (store (select |v_#memory_int_20| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15|) 0)))) (<= 2 |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) (= |v_#memory_int_20| (store |v_#memory_int_87| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_int_87| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) (select (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (select (select |v_#memory_int_20| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) (select (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0))))) (= (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (select (select |v_#memory_$Pointer$.base_77| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) (select (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0))) (or (not (= (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 0)) (not (= (select (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 0))) (= (select (select |v_#memory_$Pointer$.offset_72| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) (select (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) (select (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) (or (and (<= (+ |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15| 1) |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15| 0)) (exists ((|v_#valid_44| (Array Int Int))) (and (= (store |v_#valid_44| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15| 1) |#valid|) (= (select |v_#valid_44| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15|) 0))) (= |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_10| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15| (store (store (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15|) 0 0) 4 (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15|) 4))) |v_#memory_$Pointer$.base_77|)) (exists ((|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15| (store (store (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15|) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15|) 4))) |v_#memory_$Pointer$.offset_72|)) (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_16| |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_10|) (exists ((|v_old(#memory_int)_AFTER_CALL_26| (Array Int (Array Int Int))) (|v_#memory_int_86| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_76| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int) (|v_#memory_$Pointer$.offset_71| (Array Int (Array Int Int)))) (and (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.base_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |v_old(#memory_int)_AFTER_CALL_26| (store |v_#memory_int_86| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_86| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_26| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0)))) (= (select (select (store |v_#memory_$Pointer$.offset_71| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_71| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (exists ((|v_#memory_int_38| (Array Int (Array Int Int))) (|v_#memory_int_83| (Array Int (Array Int Int)))) (and (= |v_#memory_int_87| (store |v_#memory_int_38| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15| (store (select |v_#memory_int_38| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15|) 4 5))) (= (store |v_#memory_int_83| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15| (store (select |v_#memory_int_83| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15|) 0 (select (select |v_#memory_int_38| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15|) 0))) |v_#memory_int_38|))) (exists ((|v_#length_28| (Array Int Int))) (= |#length| (store |v_#length_28| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15| 8)))) (and (<= (+ |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15| 1) |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15| 0)) (exists ((|v_#valid_44| (Array Int Int))) (and (= (store |v_#valid_44| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15| 1) |#valid|) (= (select |v_#valid_44| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15|) 0))) (exists ((|v_#memory_int_86| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_76| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_25| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int) (|v_#memory_$Pointer$.offset_71| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_25| (store |v_#memory_int_86| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_86| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_25| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0)))) (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.base_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (select (select (store |v_#memory_$Pointer$.offset_71| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_71| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (= |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_10| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15| (store (store (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15|) 0 0) 4 (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15|) 4))) |v_#memory_$Pointer$.base_77|)) (exists ((|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15| (store (store (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15|) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15|) 4))) |v_#memory_$Pointer$.offset_72|)) (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_16| |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_10|) (exists ((|v_#memory_int_38| (Array Int (Array Int Int))) (|v_#memory_int_83| (Array Int (Array Int Int)))) (and (= |v_#memory_int_87| (store |v_#memory_int_38| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15| (store (select |v_#memory_int_38| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15|) 4 5))) (= (store |v_#memory_int_83| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15| (store (select |v_#memory_int_83| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15|) 0 (select (select |v_#memory_int_38| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15|) 0))) |v_#memory_int_38|))) (exists ((|v_#length_28| (Array Int Int))) (= |#length| (store |v_#length_28| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_15| 8))))) (<= 2 |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_10|))) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~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-12 00:13:35,813 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:13:35,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:13:35,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 36 [2023-11-12 00:13:35,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420988358] [2023-11-12 00:13:35,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:13:35,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-12 00:13:35,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:35,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-12 00:13:35,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2984, Unknown=41, NotChecked=336, Total=3540 [2023-11-12 00:13:35,819 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 36 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-12 00:13:38,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:38,581 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2023-11-12 00:13:38,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-12 00:13:38,582 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 28 [2023-11-12 00:13:38,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:38,584 INFO L225 Difference]: With dead ends: 78 [2023-11-12 00:13:38,584 INFO L226 Difference]: Without dead ends: 70 [2023-11-12 00:13:38,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1430 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=378, Invalid=5441, Unknown=45, NotChecked=456, Total=6320 [2023-11-12 00:13:38,588 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 119 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:38,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 371 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-12 00:13:38,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-12 00:13:38,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 33. [2023-11-12 00:13:38,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 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-12 00:13:38,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2023-11-12 00:13:38,600 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 28 [2023-11-12 00:13:38,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:38,601 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2023-11-12 00:13:38,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-12 00:13:38,602 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2023-11-12 00:13:38,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-12 00:13:38,603 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:38,603 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, 1, 1, 1, 1] [2023-11-12 00:13:38,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70b6b724-fcc2-487a-96b5-70e68daf333c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:13:38,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70b6b724-fcc2-487a-96b5-70e68daf333c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:13:38,805 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:13:38,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:38,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1656360026, now seen corresponding path program 1 times [2023-11-12 00:13:38,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:38,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369938139] [2023-11-12 00:13:38,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:38,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:39,892 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 00:13:39,893 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:39,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369938139] [2023-11-12 00:13:39,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369938139] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:13:39,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622473567] [2023-11-12 00:13:39,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:39,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:13:39,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70b6b724-fcc2-487a-96b5-70e68daf333c/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:13:39,896 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70b6b724-fcc2-487a-96b5-70e68daf333c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:13:39,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70b6b724-fcc2-487a-96b5-70e68daf333c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:13:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:40,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 108 conjunts are in the unsatisfiable core [2023-11-12 00:13:40,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:13:40,229 INFO L351 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-12 00:13:40,419 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 00:13:40,492 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-12 00:13:40,492 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-12 00:13:40,593 INFO L351 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 23 treesize of output 11 [2023-11-12 00:13:40,706 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-12 00:13:40,841 INFO L351 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 38 treesize of output 22 [2023-11-12 00:13:40,850 INFO L351 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-12 00:13:40,866 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 00:13:40,872 INFO L351 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-12 00:13:41,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:13:41,090 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2023-11-12 00:13:41,114 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-12 00:13:41,115 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-12 00:13:41,151 INFO L322 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-12 00:13:41,151 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-12 00:13:41,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:13:41,168 INFO L351 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-12 00:13:41,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:13:41,587 INFO L322 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2023-11-12 00:13:41,587 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 73 [2023-11-12 00:13:41,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:13:41,599 INFO L351 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2023-11-12 00:13:41,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:13:41,609 INFO L351 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-11-12 00:13:41,617 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-12 00:13:41,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:13:41,626 INFO L351 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-12 00:13:41,703 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-11-12 00:13:41,711 INFO L351 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-12 00:13:41,817 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 00:13:41,817 INFO L327 TraceCheckSpWp]: Computing backward predicates...