./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:58:49,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:58:49,123 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 21:58:49,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:58:49,133 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:58:49,186 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:58:49,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:58:49,187 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:58:49,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:58:49,190 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:58:49,191 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:58:49,192 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:58:49,193 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:58:49,200 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:58:49,201 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:58:49,201 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:58:49,203 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:58:49,204 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:58:49,204 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:58:49,205 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:58:49,205 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:58:49,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:58:49,208 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:58:49,208 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:58:49,209 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:58:49,209 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:58:49,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:58:49,210 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:58:49,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:58:49,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:58:49,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:58:49,212 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:58:49,212 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:58:49,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:58:49,213 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:58:49,213 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:58:49,214 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:58:49,214 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:58:49,214 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:58:49,214 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/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_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> Automizer 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 -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2023-11-06 21:58:49,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:58:49,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:58:49,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:58:49,586 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:58:49,587 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:58:49,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2023-11-06 21:58:52,674 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:58:53,056 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:58:53,057 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2023-11-06 21:58:53,071 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/data/f4526e22e/cb42191dfed14573bb4e4f363aee5ff8/FLAGfb8d2f668 [2023-11-06 21:58:53,083 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/data/f4526e22e/cb42191dfed14573bb4e4f363aee5ff8 [2023-11-06 21:58:53,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:58:53,088 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:58:53,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:58:53,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:58:53,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:58:53,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:58:53" (1/1) ... [2023-11-06 21:58:53,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@794d557a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:58:53, skipping insertion in model container [2023-11-06 21:58:53,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:58:53" (1/1) ... [2023-11-06 21:58:53,159 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:58:53,520 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_da606fa3-d258-454e-a7bd-752fc9e026b1/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2023-11-06 21:58:53,529 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:58:53,541 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:58:53,596 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_da606fa3-d258-454e-a7bd-752fc9e026b1/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2023-11-06 21:58:53,597 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:58:53,632 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:58:53,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:58:53 WrapperNode [2023-11-06 21:58:53,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:58:53,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:58:53,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:58:53,635 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:58:53,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:58:53" (1/1) ... [2023-11-06 21:58:53,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:58:53" (1/1) ... [2023-11-06 21:58:53,683 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 140 [2023-11-06 21:58:53,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:58:53,685 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:58:53,685 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:58:53,685 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:58:53,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:58:53" (1/1) ... [2023-11-06 21:58:53,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:58:53" (1/1) ... [2023-11-06 21:58:53,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:58:53" (1/1) ... [2023-11-06 21:58:53,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:58:53" (1/1) ... [2023-11-06 21:58:53,711 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:58:53" (1/1) ... [2023-11-06 21:58:53,716 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:58:53" (1/1) ... [2023-11-06 21:58:53,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:58:53" (1/1) ... [2023-11-06 21:58:53,720 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:58:53" (1/1) ... [2023-11-06 21:58:53,724 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:58:53,725 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:58:53,725 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:58:53,725 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:58:53,726 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:58:53" (1/1) ... [2023-11-06 21:58:53,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:58:53,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:58:53,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:58:53,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:58:53,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 21:58:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 21:58:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-06 21:58:53,816 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-06 21:58:53,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 21:58:53,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:58:53,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 21:58:53,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 21:58:53,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 21:58:53,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 21:58:53,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 21:58:53,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:58:53,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:58:53,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:58:54,011 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:58:54,015 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:58:54,375 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:58:54,383 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:58:54,386 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-06 21:58:54,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:58:54 BoogieIcfgContainer [2023-11-06 21:58:54,389 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:58:54,394 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:58:54,395 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:58:54,398 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:58:54,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:58:53" (1/3) ... [2023-11-06 21:58:54,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c6e3072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:58:54, skipping insertion in model container [2023-11-06 21:58:54,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:58:53" (2/3) ... [2023-11-06 21:58:54,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c6e3072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:58:54, skipping insertion in model container [2023-11-06 21:58:54,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:58:54" (3/3) ... [2023-11-06 21:58:54,404 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2023-11-06 21:58:54,429 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:58:54,430 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:58:54,483 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:58:54,489 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@1859b792, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:58:54,490 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 21:58:54,495 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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-06 21:58:54,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 21:58:54,504 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:58:54,505 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:58:54,507 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:58:54,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:58:54,513 INFO L85 PathProgramCache]: Analyzing trace with hash -483023916, now seen corresponding path program 1 times [2023-11-06 21:58:54,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:58:54,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684346295] [2023-11-06 21:58:54,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:58:54,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:58:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:54,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:58:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:54,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 21:58:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:54,977 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 21:58:54,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:58:54,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684346295] [2023-11-06 21:58:54,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684346295] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:58:54,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:58:54,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:58:54,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344855371] [2023-11-06 21:58:54,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:58:54,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:58:54,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:58:55,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:58:55,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:58:55,030 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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-06 21:58:55,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:58:55,137 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2023-11-06 21:58:55,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:58:55,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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 24 [2023-11-06 21:58:55,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:58:55,147 INFO L225 Difference]: With dead ends: 65 [2023-11-06 21:58:55,147 INFO L226 Difference]: Without dead ends: 28 [2023-11-06 21:58:55,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-06 21:58:55,156 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:58:55,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:58:55,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-06 21:58:55,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-06 21:58:55,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 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-06 21:58:55,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-11-06 21:58:55,202 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2023-11-06 21:58:55,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:58:55,204 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-11-06 21:58:55,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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-06 21:58:55,205 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-11-06 21:58:55,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 21:58:55,207 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:58:55,207 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:58:55,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:58:55,208 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:58:55,209 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:58:55,209 INFO L85 PathProgramCache]: Analyzing trace with hash -938400178, now seen corresponding path program 1 times [2023-11-06 21:58:55,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:58:55,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569417928] [2023-11-06 21:58:55,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:58:55,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:58:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:55,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:58:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:55,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 21:58:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:55,488 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 21:58:55,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:58:55,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569417928] [2023-11-06 21:58:55,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569417928] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:58:55,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:58:55,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:58:55,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902866089] [2023-11-06 21:58:55,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:58:55,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:58:55,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:58:55,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:58:55,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:58:55,492 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-06 21:58:55,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:58:55,555 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2023-11-06 21:58:55,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:58:55,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 24 [2023-11-06 21:58:55,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:58:55,558 INFO L225 Difference]: With dead ends: 52 [2023-11-06 21:58:55,558 INFO L226 Difference]: Without dead ends: 31 [2023-11-06 21:58:55,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:58:55,560 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:58:55,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 70 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:58:55,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-06 21:58:55,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-11-06 21:58:55,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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-06 21:58:55,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-11-06 21:58:55,569 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2023-11-06 21:58:55,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:58:55,570 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-11-06 21:58:55,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-06 21:58:55,570 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-11-06 21:58:55,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-06 21:58:55,572 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:58:55,572 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:58:55,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:58:55,572 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:58:55,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:58:55,573 INFO L85 PathProgramCache]: Analyzing trace with hash 436872902, now seen corresponding path program 1 times [2023-11-06 21:58:55,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:58:55,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671788672] [2023-11-06 21:58:55,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:58:55,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:58:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:56,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:58:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:56,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:58:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:56,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 21:58:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:56,320 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:58:56,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:58:56,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671788672] [2023-11-06 21:58:56,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671788672] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:58:56,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236832164] [2023-11-06 21:58:56,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:58:56,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:58:56,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:58:56,327 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:58:56,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 21:58:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:56,530 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-06 21:58:56,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:58:56,818 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-06 21:58:56,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:58:56,937 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-06 21:58:56,994 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-06 21:58:57,019 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:58:57,019 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:58:57,122 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_10| Int) (v_ArrVal_300 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_10| v_ArrVal_300) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_10| 1)))) is different from false [2023-11-06 21:58:57,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236832164] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:58:57,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:58:57,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2023-11-06 21:58:57,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959593327] [2023-11-06 21:58:57,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:58:57,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-06 21:58:57,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:58:57,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-06 21:58:57,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=482, Unknown=1, NotChecked=44, Total=600 [2023-11-06 21:58:57,134 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 4 states have call successors, (6), 3 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-06 21:58:57,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:58:57,719 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2023-11-06 21:58:57,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 21:58:57,720 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 4 states have call successors, (6), 3 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 32 [2023-11-06 21:58:57,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:58:57,721 INFO L225 Difference]: With dead ends: 39 [2023-11-06 21:58:57,721 INFO L226 Difference]: Without dead ends: 31 [2023-11-06 21:58:57,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=797, Unknown=1, NotChecked=58, Total=992 [2023-11-06 21:58:57,723 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 68 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:58:57,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 186 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 21:58:57,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-06 21:58:57,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-11-06 21:58:57,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 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-06 21:58:57,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-11-06 21:58:57,733 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 32 [2023-11-06 21:58:57,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:58:57,734 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-11-06 21:58:57,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 4 states have call successors, (6), 3 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-06 21:58:57,735 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-11-06 21:58:57,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-06 21:58:57,736 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:58:57,736 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:58:57,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 21:58:57,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:58:57,943 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:58:57,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:58:57,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1205420011, now seen corresponding path program 1 times [2023-11-06 21:58:57,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:58:57,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090829442] [2023-11-06 21:58:57,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:58:57,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:58:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:59,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:58:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:59,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:58:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:59,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 21:58:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:59,692 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:58:59,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:58:59,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090829442] [2023-11-06 21:58:59,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090829442] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:58:59,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907380765] [2023-11-06 21:58:59,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:58:59,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:58:59,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:58:59,695 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:58:59,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 21:58:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:59,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 85 conjunts are in the unsatisfiable core [2023-11-06 21:58:59,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:58:59,950 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-06 21:59:00,289 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 21:59:00,290 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-06 21:59:00,403 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-06 21:59:00,537 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 21:59:00,537 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 34 treesize of output 33 [2023-11-06 21:59:00,720 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 21:59:00,721 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 39 treesize of output 22 [2023-11-06 21:59:00,730 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 21:59:00,738 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-06 21:59:00,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:00,922 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 21:59:00,922 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 47 treesize of output 38 [2023-11-06 21:59:00,944 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-06 21:59:00,945 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-06 21:59:00,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:00,962 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-06 21:59:01,104 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-06 21:59:01,180 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 21:59:01,180 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 35 treesize of output 18 [2023-11-06 21:59:01,220 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:59:01,220 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:59:01,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907380765] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:59:01,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:59:01,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 36 [2023-11-06 21:59:01,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173080061] [2023-11-06 21:59:01,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:59:01,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-06 21:59:01,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:59:01,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-06 21:59:01,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1356, Unknown=0, NotChecked=0, Total=1482 [2023-11-06 21:59:01,556 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 36 states, 32 states have (on average 1.5) internal successors, (48), 27 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 21:59:02,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:59:02,899 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2023-11-06 21:59:02,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 21:59:02,900 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 32 states have (on average 1.5) internal successors, (48), 27 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2023-11-06 21:59:02,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:59:02,901 INFO L225 Difference]: With dead ends: 53 [2023-11-06 21:59:02,901 INFO L226 Difference]: Without dead ends: 44 [2023-11-06 21:59:02,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=226, Invalid=1936, Unknown=0, NotChecked=0, Total=2162 [2023-11-06 21:59:02,903 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 63 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 21:59:02,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 317 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 21:59:02,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-11-06 21:59:02,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2023-11-06 21:59:02,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-06 21:59:02,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2023-11-06 21:59:02,924 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 35 [2023-11-06 21:59:02,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:59:02,924 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2023-11-06 21:59:02,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 32 states have (on average 1.5) internal successors, (48), 27 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 21:59:02,925 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2023-11-06 21:59:02,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 21:59:02,931 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:59:02,932 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:59:02,944 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 21:59:03,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:59:03,139 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:59:03,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:59:03,140 INFO L85 PathProgramCache]: Analyzing trace with hash 790772624, now seen corresponding path program 1 times [2023-11-06 21:59:03,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:59:03,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444265844] [2023-11-06 21:59:03,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:59:03,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:59:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:05,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:59:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:05,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:59:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:05,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 21:59:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:06,478 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:59:06,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:59:06,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444265844] [2023-11-06 21:59:06,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444265844] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:59:06,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098357260] [2023-11-06 21:59:06,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:59:06,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:59:06,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:59:06,483 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:59:06,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 21:59:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:06,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 115 conjunts are in the unsatisfiable core [2023-11-06 21:59:06,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:59:06,724 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-06 21:59:06,793 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 5 treesize of output 3 [2023-11-06 21:59:07,008 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 21:59:07,009 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-06 21:59:07,226 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-06 21:59:07,304 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-06 21:59:07,304 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-11-06 21:59:07,432 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-06 21:59:07,623 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 21:59:07,623 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 1 case distinctions, treesize of input 42 treesize of output 39 [2023-11-06 21:59:07,951 INFO L322 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-06 21:59:07,952 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 71 treesize of output 26 [2023-11-06 21:59:07,961 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-11-06 21:59:08,128 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 13 treesize of output 9 [2023-11-06 21:59:08,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:08,283 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 21:59:08,283 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 79 treesize of output 62 [2023-11-06 21:59:08,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:08,297 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 62 treesize of output 53 [2023-11-06 21:59:08,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:08,323 INFO L322 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-11-06 21:59:08,323 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 37 [2023-11-06 21:59:09,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:09,253 INFO L322 Elim1Store]: treesize reduction 49, result has 16.9 percent of original size [2023-11-06 21:59:09,253 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 198 treesize of output 220 [2023-11-06 21:59:09,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:09,272 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 32 [2023-11-06 21:59:09,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:09,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:09,320 INFO L322 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2023-11-06 21:59:09,320 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 154 treesize of output 120 [2023-11-06 21:59:09,331 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 21 [2023-11-06 21:59:09,343 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 20 treesize of output 19 [2023-11-06 21:59:09,353 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 95 [2023-11-06 21:59:09,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:09,368 INFO L322 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2023-11-06 21:59:09,369 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 116 treesize of output 80 [2023-11-06 21:59:09,376 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 38 [2023-11-06 21:59:09,386 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 47 treesize of output 29 [2023-11-06 21:59:09,553 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 70 treesize of output 38 [2023-11-06 21:59:09,561 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 21 treesize of output 13 [2023-11-06 21:59:09,699 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 21:59:09,700 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:59:09,867 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_674 (Array Int Int)) (v_ArrVal_676 (Array Int Int)) (v_ArrVal_675 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_675) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_676) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_669) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_671))) (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_674) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_675 (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_675 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) is different from false [2023-11-06 21:59:09,927 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_674 (Array Int Int)) (v_ArrVal_676 (Array Int Int)) (v_ArrVal_675 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_675) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_676) .cse0 v_ArrVal_669) (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_671))) (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) .cse0 v_ArrVal_670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_674) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse0 v_ArrVal_668) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (not (= v_ArrVal_675 (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_675 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) is different from false [2023-11-06 21:59:09,990 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_674 (Array Int Int)) (v_ArrVal_676 (Array Int Int)) (v_ArrVal_675 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse2))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_675) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_676) .cse0 v_ArrVal_669) (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_671))) (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) .cse0 v_ArrVal_670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_674) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse0 v_ArrVal_668) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (= v_ArrVal_675 (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_675 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) is different from false [2023-11-06 21:59:10,018 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_674 (Array Int Int)) (v_ArrVal_676 (Array Int Int)) (v_ArrVal_675 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse2))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_675) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_676) .cse0 v_ArrVal_669) (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_671))) (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|))) .cse0 v_ArrVal_670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_674) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) .cse0 v_ArrVal_668) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (= v_ArrVal_675 (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| (select v_ArrVal_675 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)))))) is different from false [2023-11-06 21:59:10,213 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:59:10,214 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 2794 treesize of output 2754 [2023-11-06 21:59:10,249 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 1298 treesize of output 1074 [2023-11-06 21:59:10,306 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 536 treesize of output 424 [2023-11-06 21:59:10,518 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 1005 treesize of output 837 [2023-11-06 21:59:10,549 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 59 treesize of output 3 [2023-11-06 21:59:10,574 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 946 treesize of output 834 [2023-11-06 21:59:10,632 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:59:10,634 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:59:10,638 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-06 21:59:10,649 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-06 21:59:11,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098357260] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:59:11,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:59:11,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 45 [2023-11-06 21:59:11,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364657270] [2023-11-06 21:59:11,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:59:11,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-06 21:59:11,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:59:11,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-06 21:59:11,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=2139, Unknown=4, NotChecked=380, Total=2652 [2023-11-06 21:59:11,276 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 45 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 36 states have internal predecessors, (56), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 21:59:15,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:59:15,317 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2023-11-06 21:59:15,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-06 21:59:15,319 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 36 states have internal predecessors, (56), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2023-11-06 21:59:15,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:59:15,321 INFO L225 Difference]: With dead ends: 67 [2023-11-06 21:59:15,321 INFO L226 Difference]: Without dead ends: 65 [2023-11-06 21:59:15,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=310, Invalid=3862, Unknown=4, NotChecked=516, Total=4692 [2023-11-06 21:59:15,324 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 145 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:59:15,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 423 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-06 21:59:15,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-06 21:59:15,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 45. [2023-11-06 21:59:15,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-06 21:59:15,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2023-11-06 21:59:15,339 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 37 [2023-11-06 21:59:15,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:59:15,340 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2023-11-06 21:59:15,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 36 states have internal predecessors, (56), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 21:59:15,340 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2023-11-06 21:59:15,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-06 21:59:15,341 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:59:15,342 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:59:15,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 21:59:15,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:59:15,549 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:59:15,549 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:59:15,549 INFO L85 PathProgramCache]: Analyzing trace with hash -718486453, now seen corresponding path program 2 times [2023-11-06 21:59:15,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:59:15,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700687134] [2023-11-06 21:59:15,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:59:15,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:59:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:17,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:59:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:17,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:59:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:17,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 21:59:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:17,610 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:59:17,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:59:17,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700687134] [2023-11-06 21:59:17,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700687134] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:59:17,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036614201] [2023-11-06 21:59:17,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 21:59:17,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:59:17,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:59:17,613 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:59:17,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 21:59:17,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 21:59:17,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:59:17,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-06 21:59:17,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:59:17,898 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-06 21:59:18,212 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2023-11-06 21:59:18,215 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2023-11-06 21:59:18,242 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-06 21:59:18,261 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-06 21:59:18,269 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2023-11-06 21:59:18,271 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2023-11-06 21:59:18,338 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 21:59:18,338 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 48 treesize of output 34 [2023-11-06 21:59:18,370 INFO L322 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-06 21:59:18,370 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 27 treesize of output 22 [2023-11-06 21:59:18,392 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 1))) (= (select (select |c_#memory_$Pointer$.base| .cse1) 0) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0))) is different from false [2023-11-06 21:59:18,395 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 1))) (= (select (select |c_#memory_$Pointer$.base| .cse1) 0) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0))) is different from true [2023-11-06 21:59:18,446 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse2) 0) .cse0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)))) is different from false [2023-11-06 21:59:18,450 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse2) 0) .cse0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)))) is different from true [2023-11-06 21:59:18,483 INFO L322 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-11-06 21:59:18,483 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 43 [2023-11-06 21:59:18,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:18,510 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 21:59:18,510 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2023-11-06 21:59:18,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:18,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:18,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:18,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:18,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:18,697 INFO L322 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-06 21:59:18,698 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2023-11-06 21:59:18,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:18,779 INFO L322 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-11-06 21:59:18,780 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 72 [2023-11-06 21:59:18,832 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (<= (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| 2) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse1) 0) .cse0) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 1)))))) is different from false [2023-11-06 21:59:18,836 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (<= (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| 2) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse1) 0) .cse0) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 1)))))) is different from true [2023-11-06 21:59:18,890 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse1) 0) .cse0) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0)))) is different from false [2023-11-06 21:59:18,893 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse1) 0) .cse0) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0)))) is different from true [2023-11-06 21:59:18,951 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse1) 0) .cse0) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse0)))) is different from false [2023-11-06 21:59:18,955 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse1) 0) .cse0) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse0)))) is different from true [2023-11-06 21:59:19,084 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) 0) (= .cse1 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$.base| .cse1) 0) .cse0) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0)))) is different from false [2023-11-06 21:59:19,086 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) 0) (= .cse1 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$.base| .cse1) 0) .cse0) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0)))) is different from true [2023-11-06 21:59:19,133 INFO L322 Elim1Store]: treesize reduction 41, result has 16.3 percent of original size [2023-11-06 21:59:19,133 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 55 [2023-11-06 21:59:19,189 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base|) 0) 0) (exists ((|ULTIMATE.start_sll_circular_prepend_~head#1.base| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0))) |v_old(#valid)_AFTER_CALL_12|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2) |ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|)) is different from false [2023-11-06 21:59:19,192 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base|) 0) 0) (exists ((|ULTIMATE.start_sll_circular_prepend_~head#1.base| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0))) |v_old(#valid)_AFTER_CALL_12|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2) |ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|)) is different from true [2023-11-06 21:59:19,195 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-06 21:59:19,195 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:59:19,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036614201] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:59:19,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:59:19,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 36 [2023-11-06 21:59:19,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472128025] [2023-11-06 21:59:19,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:59:19,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-06 21:59:19,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:59:19,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-06 21:59:19,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=902, Unknown=18, NotChecked=612, Total=1640 [2023-11-06 21:59:19,635 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 36 states, 32 states have (on average 1.59375) internal successors, (51), 27 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 21:59:19,865 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2023-11-06 21:59:19,868 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2023-11-06 21:59:19,875 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2023-11-06 21:59:19,877 WARN L861 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2023-11-06 21:59:19,883 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 1))) (= (select (select |c_#memory_$Pointer$.base| .cse1) 0) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (= (select |c_#valid| .cse1) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0))) is different from false [2023-11-06 21:59:19,886 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 1))) (= (select (select |c_#memory_$Pointer$.base| .cse1) 0) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (= (select |c_#valid| .cse1) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0))) is different from true [2023-11-06 21:59:19,893 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) 0)) (.cse5 (+ |c_#StackHeapBarrier| 1))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.base| .cse0) 0) .cse1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 1))) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse4) 0) .cse2) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 0) 0) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (<= .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-11-06 21:59:19,896 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) 0)) (.cse5 (+ |c_#StackHeapBarrier| 1))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.base| .cse0) 0) .cse1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 1))) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse4) 0) .cse2) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 0) 0) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (<= .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-11-06 21:59:19,910 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse4 (select .cse8 0)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse5) 0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| .cse5) 0))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse4) 0))) (and (<= (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| 2) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (or (= .cse0 0) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) 0)) (= (select .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 0) 0) (= (select .cse3 0) 0) (= .cse0 .cse5) (= (select (select |c_#memory_$Pointer$.base| .cse6) 0) .cse4) (= (select (select |c_#memory_$Pointer$.offset| .cse6) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse7 (select |v_old(#valid)_AFTER_CALL_12| .cse7))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse6) 1)))))))) is different from false [2023-11-06 21:59:19,913 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse4 (select .cse8 0)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse5) 0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| .cse5) 0))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse4) 0))) (and (<= (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| 2) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (or (= .cse0 0) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) 0)) (= (select .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 0) 0) (= (select .cse3 0) 0) (= .cse0 .cse5) (= (select (select |c_#memory_$Pointer$.base| .cse6) 0) .cse4) (= (select (select |c_#memory_$Pointer$.offset| .cse6) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse7 (select |v_old(#valid)_AFTER_CALL_12| .cse7))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse6) 1)))))))) is different from true [2023-11-06 21:59:19,930 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse3 (select .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse7 (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select .cse9 0)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) .cse7)) (.cse6 (select (select |c_#memory_$Pointer$.offset| .cse3) .cse7))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6)) (.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem10#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select .cse1 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse2) 0) .cse0) (= .cse3 .cse4) (or (= (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) .cse7) (and (= .cse4 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem10#1.base| .cse3))) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse8 (select |v_old(#valid)_AFTER_CALL_12| .cse8))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0)))))) is different from false [2023-11-06 21:59:19,933 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse3 (select .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse7 (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select .cse9 0)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) .cse7)) (.cse6 (select (select |c_#memory_$Pointer$.offset| .cse3) .cse7))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6)) (.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem10#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select .cse1 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse2) 0) .cse0) (= .cse3 .cse4) (or (= (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) .cse7) (and (= .cse4 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem10#1.base| .cse3))) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse8 (select |v_old(#valid)_AFTER_CALL_12| .cse8))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0)))))) is different from true [2023-11-06 21:59:19,938 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse4 (select .cse2 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse4) 0))) (and (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) (select .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 0) 0) (= (select .cse3 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse5) 0) .cse4) (= (select (select |c_#memory_$Pointer$.offset| .cse5) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse6 (select |v_old(#valid)_AFTER_CALL_12| .cse6))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse5) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse4))))) is different from false [2023-11-06 21:59:19,941 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse4 (select .cse2 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse4) 0))) (and (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) (select .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 0) 0) (= (select .cse3 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse5) 0) .cse4) (= (select (select |c_#memory_$Pointer$.offset| .cse5) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse6 (select |v_old(#valid)_AFTER_CALL_12| .cse6))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse5) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse4))))) is different from true [2023-11-06 21:59:19,977 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse4 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select .cse1 0) 0) (= .cse2 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$.base| .cse2) 0) .cse0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))))) is different from false [2023-11-06 21:59:19,980 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse4 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select .cse1 0) 0) (= .cse2 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$.base| .cse2) 0) .cse0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))))) is different from true [2023-11-06 21:59:19,990 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base|) 0) 0) (exists ((|ULTIMATE.start_sll_circular_prepend_~head#1.base| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0))) |v_old(#valid)_AFTER_CALL_12|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2) |ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|)) is different from false [2023-11-06 21:59:19,993 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base|) 0) 0) (exists ((|ULTIMATE.start_sll_circular_prepend_~head#1.base| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0))) |v_old(#valid)_AFTER_CALL_12|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2) |ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|)) is different from true [2023-11-06 21:59:20,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:59:20,123 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2023-11-06 21:59:20,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 21:59:20,124 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 32 states have (on average 1.59375) internal successors, (51), 27 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2023-11-06 21:59:20,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:59:20,125 INFO L225 Difference]: With dead ends: 56 [2023-11-06 21:59:20,126 INFO L226 Difference]: Without dead ends: 45 [2023-11-06 21:59:20,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=140, Invalid=1018, Unknown=36, NotChecked=1458, Total=2652 [2023-11-06 21:59:20,128 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 756 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:59:20,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 287 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 261 Invalid, 0 Unknown, 756 Unchecked, 0.3s Time] [2023-11-06 21:59:20,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-06 21:59:20,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-11-06 21:59:20,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-06 21:59:20,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2023-11-06 21:59:20,143 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 39 [2023-11-06 21:59:20,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:59:20,143 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2023-11-06 21:59:20,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 32 states have (on average 1.59375) internal successors, (51), 27 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 21:59:20,144 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2023-11-06 21:59:20,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-06 21:59:20,145 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:59:20,145 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:59:20,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 21:59:20,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-06 21:59:20,352 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:59:20,352 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:59:20,352 INFO L85 PathProgramCache]: Analyzing trace with hash 12485255, now seen corresponding path program 1 times [2023-11-06 21:59:20,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:59:20,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577949882] [2023-11-06 21:59:20,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:59:20,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:59:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:21,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:59:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:21,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:59:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:21,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 21:59:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:59:22,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:59:22,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577949882] [2023-11-06 21:59:22,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577949882] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:59:22,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906987486] [2023-11-06 21:59:22,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:59:22,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:59:22,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:59:22,255 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:59:22,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 21:59:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:22,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 99 conjunts are in the unsatisfiable core [2023-11-06 21:59:22,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:59:22,528 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-06 21:59:22,915 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 18 treesize of output 10 [2023-11-06 21:59:22,921 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-06 21:59:23,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:23,185 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 36 treesize of output 24 [2023-11-06 21:59:23,201 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-06 21:59:23,202 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 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-06 21:59:23,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:23,218 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-06 21:59:24,078 INFO L322 Elim1Store]: treesize reduction 158, result has 19.0 percent of original size [2023-11-06 21:59:24,078 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 5 case distinctions, treesize of input 361 treesize of output 219 [2023-11-06 21:59:24,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:24,131 INFO L322 Elim1Store]: treesize reduction 96, result has 19.3 percent of original size [2023-11-06 21:59:24,131 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 162 treesize of output 41 [2023-11-06 21:59:24,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:24,282 INFO L322 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-06 21:59:24,282 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 treesize of output 10 [2023-11-06 21:59:24,552 INFO L322 Elim1Store]: treesize reduction 48, result has 21.3 percent of original size [2023-11-06 21:59:24,552 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 41 [2023-11-06 21:59:24,626 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:59:24,626 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:59:29,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906987486] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:59:29,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:59:29,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 41 [2023-11-06 21:59:29,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047375225] [2023-11-06 21:59:29,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:59:29,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-06 21:59:29,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:59:29,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-06 21:59:29,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2091, Unknown=1, NotChecked=0, Total=2256 [2023-11-06 21:59:29,530 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 41 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 35 states have internal predecessors, (62), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 21:59:31,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:59:31,850 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2023-11-06 21:59:31,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-06 21:59:31,850 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 35 states have internal predecessors, (62), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2023-11-06 21:59:31,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:59:31,851 INFO L225 Difference]: With dead ends: 60 [2023-11-06 21:59:31,852 INFO L226 Difference]: Without dead ends: 57 [2023-11-06 21:59:31,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=328, Invalid=3577, Unknown=1, NotChecked=0, Total=3906 [2023-11-06 21:59:31,855 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 88 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:59:31,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 350 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 21:59:31,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-06 21:59:31,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2023-11-06 21:59:31,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-06 21:59:31,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2023-11-06 21:59:31,873 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 40 [2023-11-06 21:59:31,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:59:31,874 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2023-11-06 21:59:31,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 35 states have internal predecessors, (62), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 21:59:31,874 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2023-11-06 21:59:31,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-06 21:59:31,875 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:59:31,876 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:59:31,883 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-06 21:59:32,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:59:32,082 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:59:32,083 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:59:32,083 INFO L85 PathProgramCache]: Analyzing trace with hash 387084070, now seen corresponding path program 1 times [2023-11-06 21:59:32,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:59:32,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169400666] [2023-11-06 21:59:32,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:59:32,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:59:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:35,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:59:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:35,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:59:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:35,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 21:59:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:36,230 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:59:36,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:59:36,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169400666] [2023-11-06 21:59:36,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169400666] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:59:36,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664324002] [2023-11-06 21:59:36,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:59:36,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:59:36,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:59:36,236 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:59:36,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 21:59:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:36,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 162 conjunts are in the unsatisfiable core [2023-11-06 21:59:36,476 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:59:36,484 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-06 21:59:36,586 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 5 treesize of output 3 [2023-11-06 21:59:36,811 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 21:59:36,811 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-06 21:59:37,068 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-06 21:59:37,189 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-06 21:59:37,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:37,349 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 21:59:37,349 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2023-11-06 21:59:37,555 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 21:59:37,573 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-06 21:59:37,595 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-06 21:59:37,867 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 21:59:37,868 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 74 treesize of output 63 [2023-11-06 21:59:37,889 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 24 treesize of output 11 [2023-11-06 21:59:37,899 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 24 treesize of output 11 [2023-11-06 21:59:38,265 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 21:59:38,265 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 82 treesize of output 41 [2023-11-06 21:59:38,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:38,275 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-11-06 21:59:38,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:38,285 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2023-11-06 21:59:38,290 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-06 21:59:38,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:38,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:38,665 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-06 21:59:38,665 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-11-06 21:59:40,031 INFO L322 Elim1Store]: treesize reduction 133, result has 16.4 percent of original size [2023-11-06 21:59:40,032 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 573 treesize of output 219 [2023-11-06 21:59:40,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:40,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:40,054 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 15 [2023-11-06 21:59:40,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:40,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:40,065 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 59 [2023-11-06 21:59:40,958 INFO L322 Elim1Store]: treesize reduction 69, result has 14.8 percent of original size [2023-11-06 21:59:40,958 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 174 treesize of output 86 [2023-11-06 21:59:40,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:40,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:40,978 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-06 21:59:41,266 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:59:41,267 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:59:45,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664324002] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:59:45,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:59:45,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 49 [2023-11-06 21:59:45,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934178780] [2023-11-06 21:59:45,731 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:59:45,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-06 21:59:45,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:59:45,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-06 21:59:45,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=3230, Unknown=0, NotChecked=0, Total=3422 [2023-11-06 21:59:45,735 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 49 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 40 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 21:59:53,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:59:53,448 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2023-11-06 21:59:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-06 21:59:53,449 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 40 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 41 [2023-11-06 21:59:53,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:59:53,450 INFO L225 Difference]: With dead ends: 80 [2023-11-06 21:59:53,450 INFO L226 Difference]: Without dead ends: 78 [2023-11-06 21:59:53,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=444, Invalid=5876, Unknown=0, NotChecked=0, Total=6320 [2023-11-06 21:59:53,458 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 149 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:59:53,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 363 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-06 21:59:53,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-06 21:59:53,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 61. [2023-11-06 21:59:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 54 states have internal predecessors, (63), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-06 21:59:53,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2023-11-06 21:59:53,494 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 41 [2023-11-06 21:59:53,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:59:53,494 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2023-11-06 21:59:53,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 40 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 21:59:53,495 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2023-11-06 21:59:53,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-06 21:59:53,498 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:59:53,499 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:59:53,510 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 21:59:53,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:59:53,706 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:59:53,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:59:53,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1003701405, now seen corresponding path program 2 times [2023-11-06 21:59:53,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:59:53,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66937698] [2023-11-06 21:59:53,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:59:53,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:59:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:53,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:59:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:53,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:59:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:53,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:59:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:53,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 21:59:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:53,857 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-06 21:59:53,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:59:53,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66937698] [2023-11-06 21:59:53,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66937698] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:59:53,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482155219] [2023-11-06 21:59:53,858 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 21:59:53,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:59:53,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:59:53,860 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:59:53,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 21:59:54,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 21:59:54,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:59:54,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 21:59:54,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:59:54,147 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 21:59:54,147 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:59:54,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482155219] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:59:54,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 21:59:54,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-11-06 21:59:54,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357134290] [2023-11-06 21:59:54,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:59:54,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:59:54,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:59:54,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:59:54,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:59:54,153 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 21:59:54,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:59:54,191 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2023-11-06 21:59:54,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:59:54,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2023-11-06 21:59:54,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:59:54,193 INFO L225 Difference]: With dead ends: 73 [2023-11-06 21:59:54,193 INFO L226 Difference]: Without dead ends: 45 [2023-11-06 21:59:54,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:59:54,196 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:59:54,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 55 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:59:54,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-06 21:59:54,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-11-06 21:59:54,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 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-06 21:59:54,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2023-11-06 21:59:54,232 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 43 [2023-11-06 21:59:54,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:59:54,233 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2023-11-06 21:59:54,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 21:59:54,233 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2023-11-06 21:59:54,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-06 21:59:54,237 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:59:54,237 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:59:54,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 21:59:54,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:59:54,444 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:59:54,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:59:54,445 INFO L85 PathProgramCache]: Analyzing trace with hash -364798159, now seen corresponding path program 1 times [2023-11-06 21:59:54,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:59:54,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79583392] [2023-11-06 21:59:54,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:59:54,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:59:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:57,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:59:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:57,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:59:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:57,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 21:59:57,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:57,836 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:59:57,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:59:57,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79583392] [2023-11-06 21:59:57,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79583392] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:59:57,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604484626] [2023-11-06 21:59:57,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:59:57,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:59:57,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:59:57,840 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:59:57,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 21:59:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:58,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 116 conjunts are in the unsatisfiable core [2023-11-06 21:59:58,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:59:58,135 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-06 21:59:58,599 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 19 treesize of output 11 [2023-11-06 21:59:58,610 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 5 treesize of output 3 [2023-11-06 21:59:58,615 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-06 21:59:58,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:58,806 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 16 treesize of output 11 [2023-11-06 21:59:58,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:58,814 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 27 treesize of output 20 [2023-11-06 21:59:58,828 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-06 21:59:58,828 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-06 21:59:59,795 INFO L322 Elim1Store]: treesize reduction 181, result has 17.4 percent of original size [2023-11-06 21:59:59,796 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 654 treesize of output 247 [2023-11-06 21:59:59,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:59:59,850 INFO L322 Elim1Store]: treesize reduction 148, result has 12.9 percent of original size [2023-11-06 21:59:59,851 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 287 treesize of output 138 [2023-11-06 22:00:02,508 INFO L322 Elim1Store]: treesize reduction 152, result has 65.2 percent of original size [2023-11-06 22:00:02,509 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 16 new quantified variables, introduced 36 case distinctions, treesize of input 290 treesize of output 423 [2023-11-06 22:00:02,989 INFO L322 Elim1Store]: treesize reduction 168, result has 55.0 percent of original size [2023-11-06 22:00:02,990 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 36 case distinctions, treesize of input 299 treesize of output 416 [2023-11-06 22:00:24,256 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:00:24,256 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:00:36,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604484626] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:00:36,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:00:36,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 44 [2023-11-06 22:00:36,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649519777] [2023-11-06 22:00:36,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:00:36,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-06 22:00:36,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:00:36,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-06 22:00:36,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=2230, Unknown=0, NotChecked=0, Total=2450 [2023-11-06 22:00:36,896 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 44 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 38 states have internal predecessors, (66), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-06 22:00:40,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:00:40,864 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2023-11-06 22:00:40,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-06 22:00:40,868 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 38 states have internal predecessors, (66), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 44 [2023-11-06 22:00:40,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:00:40,869 INFO L225 Difference]: With dead ends: 60 [2023-11-06 22:00:40,869 INFO L226 Difference]: Without dead ends: 57 [2023-11-06 22:00:40,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=430, Invalid=4126, Unknown=0, NotChecked=0, Total=4556 [2023-11-06 22:00:40,872 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 96 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:00:40,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 332 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 22:00:40,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-06 22:00:40,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2023-11-06 22:00:40,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.125) internal successors, (54), 48 states have internal predecessors, (54), 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-06 22:00:40,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2023-11-06 22:00:40,901 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 44 [2023-11-06 22:00:40,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:00:40,902 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2023-11-06 22:00:40,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 38 states have internal predecessors, (66), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-06 22:00:40,902 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2023-11-06 22:00:40,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-06 22:00:40,903 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:00:40,903 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 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-06 22:00:40,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:00:41,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-06 22:00:41,110 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:00:41,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:00:41,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1576200124, now seen corresponding path program 2 times [2023-11-06 22:00:41,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:00:41,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127826981] [2023-11-06 22:00:41,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:00:41,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:00:41,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:00:45,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:00:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:00:45,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:00:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:00:45,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:00:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:00:46,180 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:00:46,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:00:46,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127826981] [2023-11-06 22:00:46,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127826981] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:00:46,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487693602] [2023-11-06 22:00:46,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:00:46,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:00:46,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:00:46,182 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:00:46,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 22:00:46,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:00:46,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:00:46,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 180 conjunts are in the unsatisfiable core [2023-11-06 22:00:46,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:00:46,498 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-06 22:00:46,582 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 5 treesize of output 3 [2023-11-06 22:00:46,748 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-06 22:00:46,858 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 22:00:46,859 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-06 22:00:47,144 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-06 22:00:47,470 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-06 22:00:47,470 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-11-06 22:00:47,515 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-06 22:00:47,683 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-06 22:00:47,706 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:00:47,731 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-06 22:00:47,958 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:00:47,958 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 1 case distinctions, treesize of input 96 treesize of output 81 [2023-11-06 22:00:47,964 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 39 treesize of output 15 [2023-11-06 22:00:47,977 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 24 treesize of output 11 [2023-11-06 22:00:48,327 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:00:48,328 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 77 treesize of output 40 [2023-11-06 22:00:48,335 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-11-06 22:00:48,346 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-06 22:00:48,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:00:48,667 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:00:48,667 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 85 treesize of output 62 [2023-11-06 22:00:48,693 INFO L322 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2023-11-06 22:00:48,693 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 1 case distinctions, treesize of input 24 treesize of output 31 [2023-11-06 22:00:48,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:00:48,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:00:48,754 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-06 22:00:48,754 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 33 [2023-11-06 22:00:48,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:00:48,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:00:48,796 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-06 22:00:48,796 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-11-06 22:00:49,936 INFO L322 Elim1Store]: treesize reduction 133, result has 16.4 percent of original size [2023-11-06 22:00:49,936 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 585 treesize of output 223 [2023-11-06 22:00:49,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:00:49,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:00:49,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:00:49,951 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 56 [2023-11-06 22:00:49,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:00:49,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:00:49,975 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 59 [2023-11-06 22:00:49,985 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2023-11-06 22:00:51,406 INFO L322 Elim1Store]: treesize reduction 122, result has 13.5 percent of original size [2023-11-06 22:00:51,407 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 190 treesize of output 99 [2023-11-06 22:00:51,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:00:51,649 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-06 22:00:51,839 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:00:51,839 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:00:58,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487693602] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:00:58,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:00:58,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 55 [2023-11-06 22:00:58,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134277391] [2023-11-06 22:00:58,775 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:00:58,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-11-06 22:00:58,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:00:58,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-11-06 22:00:58,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=4087, Unknown=3, NotChecked=0, Total=4290 [2023-11-06 22:00:58,777 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 55 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 45 states have internal predecessors, (75), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:01:06,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:06,430 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2023-11-06 22:01:06,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-06 22:01:06,431 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 45 states have internal predecessors, (75), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 45 [2023-11-06 22:01:06,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:06,432 INFO L225 Difference]: With dead ends: 62 [2023-11-06 22:01:06,432 INFO L226 Difference]: Without dead ends: 60 [2023-11-06 22:01:06,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=420, Invalid=7233, Unknown=3, NotChecked=0, Total=7656 [2023-11-06 22:01:06,435 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 79 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:06,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 248 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-06 22:01:06,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-06 22:01:06,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2023-11-06 22:01:06,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 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-06 22:01:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2023-11-06 22:01:06,461 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 45 [2023-11-06 22:01:06,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:06,462 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2023-11-06 22:01:06,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 45 states have internal predecessors, (75), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:01:06,462 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2023-11-06 22:01:06,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-06 22:01:06,463 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:06,463 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:01:06,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:01:06,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:06,664 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:01:06,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:06,664 INFO L85 PathProgramCache]: Analyzing trace with hash -298690853, now seen corresponding path program 2 times [2023-11-06 22:01:06,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:06,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480738489] [2023-11-06 22:01:06,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:06,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:06,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:01:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:06,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:01:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:06,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:01:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:06,882 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-06 22:01:06,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:06,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480738489] [2023-11-06 22:01:06,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480738489] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:06,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805867097] [2023-11-06 22:01:06,883 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:01:06,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:06,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:06,885 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:01:06,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 22:01:07,182 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:01:07,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:01:07,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 22:01:07,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:07,294 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:01:07,294 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:01:07,360 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:01:07,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805867097] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:01:07,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:01:07,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2023-11-06 22:01:07,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471059153] [2023-11-06 22:01:07,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:01:07,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:01:07,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:07,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:01:07,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:01:07,363 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 22:01:07,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:07,523 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2023-11-06 22:01:07,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:01:07,524 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2023-11-06 22:01:07,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:07,525 INFO L225 Difference]: With dead ends: 60 [2023-11-06 22:01:07,525 INFO L226 Difference]: Without dead ends: 57 [2023-11-06 22:01:07,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:01:07,526 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 13 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:07,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 207 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:01:07,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-06 22:01:07,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-06 22:01:07,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 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-06 22:01:07,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2023-11-06 22:01:07,550 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 48 [2023-11-06 22:01:07,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:07,550 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2023-11-06 22:01:07,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 22:01:07,551 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2023-11-06 22:01:07,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-06 22:01:07,551 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:07,551 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:01:07,557 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:01:07,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-06 22:01:07,752 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:01:07,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:07,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1439494014, now seen corresponding path program 3 times [2023-11-06 22:01:07,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:07,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384212502] [2023-11-06 22:01:07,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:07,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:11,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:01:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:11,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:01:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:11,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:01:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:11,233 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 47 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:01:11,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:11,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384212502] [2023-11-06 22:01:11,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384212502] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:11,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558848084] [2023-11-06 22:01:11,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:01:11,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:01:11,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:11,234 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:01:11,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-06 22:01:12,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-06 22:01:12,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:01:12,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 148 conjunts are in the unsatisfiable core [2023-11-06 22:01:12,453 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:12,463 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-06 22:01:12,735 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 5 treesize of output 3 [2023-11-06 22:01:12,951 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 22:01:12,952 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-06 22:01:13,079 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-06 22:01:13,087 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-06 22:01:13,264 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:01:13,264 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 59 treesize of output 52 [2023-11-06 22:01:13,277 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 24 treesize of output 11 [2023-11-06 22:01:13,511 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:01:13,511 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 72 treesize of output 35 [2023-11-06 22:01:13,518 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-06 22:01:13,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:01:13,532 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2023-11-06 22:01:13,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:01:13,787 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:01:13,787 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 80 treesize of output 61 [2023-11-06 22:01:13,817 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-06 22:01:13,817 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-06 22:01:13,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:01:13,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:01:13,852 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2023-11-06 22:01:14,749 INFO L322 Elim1Store]: treesize reduction 133, result has 16.4 percent of original size [2023-11-06 22:01:14,750 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 505 treesize of output 187 [2023-11-06 22:01:14,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:01:14,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:01:14,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:01:14,764 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 59 [2023-11-06 22:01:16,475 INFO L322 Elim1Store]: treesize reduction 40, result has 18.4 percent of original size [2023-11-06 22:01:16,475 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 149 treesize of output 67 [2023-11-06 22:01:16,655 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 37 proven. 23 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:01:16,655 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:01:20,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558848084] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:20,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:01:20,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 49 [2023-11-06 22:01:20,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116355301] [2023-11-06 22:01:20,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:01:20,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-06 22:01:20,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:20,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-06 22:01:20,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2668, Unknown=0, NotChecked=0, Total=2862 [2023-11-06 22:01:20,241 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 49 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 41 states have internal predecessors, (84), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 22:01:23,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:23,665 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2023-11-06 22:01:23,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 22:01:23,665 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 41 states have internal predecessors, (84), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2023-11-06 22:01:23,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:23,665 INFO L225 Difference]: With dead ends: 57 [2023-11-06 22:01:23,666 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:01:23,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=375, Invalid=4317, Unknown=0, NotChecked=0, Total=4692 [2023-11-06 22:01:23,668 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 42 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:23,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 154 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 22:01:23,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:01:23,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:01:23,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:01:23,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:01:23,670 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2023-11-06 22:01:23,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:23,670 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:01:23,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 41 states have internal predecessors, (84), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 22:01:23,670 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:01:23,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:01:23,673 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:01:23,684 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-06 22:01:23,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-06 22:01:23,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:01:29,120 INFO L899 garLoopResultBuilder]: For program point L613-4(lines 613 615) no Hoare annotation was computed. [2023-11-06 22:01:29,121 INFO L895 garLoopResultBuilder]: At program point sll_circular_create_returnLabel#1(lines 583 594) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (not (= |ULTIMATE.start_sll_circular_create_#res#1.base| 0)) (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |#memory_$Pointer$.base| .cse0) 0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |#valid| .cse1))) |#valid|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= (+ |ULTIMATE.start_sll_circular_create_~head~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_sll_circular_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select (select |#memory_int| .cse0) 4) 1) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_#res#1.base|) 4) 1) (<= (+ .cse0 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) 1) (= (select (select |#memory_$Pointer$.offset| .cse0) 0) 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| 0)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) 0) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.base| 1) |#StackHeapBarrier|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) 1) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))) [2023-11-06 22:01:29,121 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 621 642) the Hoare annotation is: true [2023-11-06 22:01:29,121 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:01:29,122 INFO L899 garLoopResultBuilder]: For program point L606(lines 606 620) no Hoare annotation was computed. [2023-11-06 22:01:29,122 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:01:29,122 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 640) no Hoare annotation was computed. [2023-11-06 22:01:29,122 INFO L902 garLoopResultBuilder]: At program point L598-2(lines 598 602) the Hoare annotation is: true [2023-11-06 22:01:29,122 INFO L899 garLoopResultBuilder]: For program point L598-3(lines 598 602) no Hoare annotation was computed. [2023-11-06 22:01:29,123 INFO L895 garLoopResultBuilder]: At program point L586-2(lines 586 591) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)) (.cse1 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse3 (<= (+ |ULTIMATE.start_sll_circular_create_~head~0#1.base| 1) |#StackHeapBarrier|)) (.cse4 (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1)) (.cse5 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) 1)) (.cse7 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse8 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse9 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse10 (= |ULTIMATE.start_sll_circular_create_~data#1| 1))) (or (and (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) .cse8 .cse9 .cse10) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) .cse0 .cse1 .cse2 .cse3 .cse4 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) .cse5 .cse6 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| 0)) .cse7 (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_11| |#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse11 (select |#valid| .cse11))) |#valid|))) .cse8 .cse9 (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.base| 1) |#StackHeapBarrier|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) 1) .cse10))) [2023-11-06 22:01:29,123 INFO L899 garLoopResultBuilder]: For program point L586-3(lines 586 591) no Hoare annotation was computed. [2023-11-06 22:01:29,123 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:01:29,123 INFO L895 garLoopResultBuilder]: At program point L607(line 607) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) 0)) (.cse3 (select (select |#memory_$Pointer$.base| .cse2) 0)) (.cse5 (select (select |#memory_$Pointer$.base| .cse1) 0))) (and (not (= |ULTIMATE.start_sll_circular_create_#res#1.base| 0)) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= .cse0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select (select |#memory_int| .cse1) 4) 1) (= .cse2 (select (select |#memory_$Pointer$.base| .cse3) 0)) (<= (+ |ULTIMATE.start_sll_circular_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select (select |#memory_int| .cse0) 4) 1) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_#res#1.base|) 4) 1) (= (select (select |#memory_$Pointer$.offset| .cse3) 0) 0) (<= (+ .cse0 1) |#StackHeapBarrier|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse1) 0) 0) (= (select |#valid| .cse0) 1) (= (select (select |#memory_$Pointer$.offset| .cse0) 0) 0) (<= (+ .cse1 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_11| |#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse4 (select |#valid| .cse4))) |#valid|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) 0) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_circular_prepend_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| .cse2) 1) (= |ULTIMATE.start_sll_circular_prepend_~data#1| 1) (= (select (select |#memory_int| .cse5) 4) 1) (<= (+ .cse5 1) |#StackHeapBarrier|) (not (= .cse2 0))))) [2023-11-06 22:01:29,123 INFO L899 garLoopResultBuilder]: For program point L607-1(line 607) no Hoare annotation was computed. [2023-11-06 22:01:29,124 INFO L899 garLoopResultBuilder]: For program point L628-1(lines 628 634) no Hoare annotation was computed. [2023-11-06 22:01:29,124 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 605) no Hoare annotation was computed. [2023-11-06 22:01:29,124 INFO L899 garLoopResultBuilder]: For program point L628-2(lines 628 634) no Hoare annotation was computed. [2023-11-06 22:01:29,125 INFO L895 garLoopResultBuilder]: At program point L628-4(lines 628 634) the Hoare annotation is: (let ((.cse29 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) 0)) (.cse16 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse10 (select (select |#memory_$Pointer$.offset| .cse16) 0)) (.cse9 (select (select |#memory_$Pointer$.base| .cse16) 0)) (.cse0 (not (= |ULTIMATE.start_sll_circular_create_#res#1.base| 0))) (.cse1 (exists ((v_arrayElimIndex_61 Int)) (let ((.cse35 (select (select |#memory_$Pointer$.base| v_arrayElimIndex_61) 0))) (let ((.cse34 (select (select |#memory_$Pointer$.base| .cse35) 0))) (let ((.cse33 (select (select |#memory_$Pointer$.base| .cse34) 0))) (and (= v_arrayElimIndex_61 .cse33) (= (select (select |#memory_$Pointer$.offset| .cse33) 0) 0) (<= (+ 2 .cse33) |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse34 .cse35)) (= (select (select |#memory_$Pointer$.offset| .cse35) 0) 0) (<= (+ .cse34 2) |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ 2 .cse35) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse16 .cse33) (= (select (select |#memory_$Pointer$.offset| .cse34) 0) 0))))))) (.cse22 (exists ((v_arrayElimIndex_50 Int)) (let ((.cse31 (select (select |#memory_$Pointer$.base| v_arrayElimIndex_50) 0))) (let ((.cse32 (select (select |#memory_$Pointer$.base| .cse31) 0))) (let ((.cse30 (select (select |#memory_$Pointer$.base| .cse32) 0))) (and (= .cse30 v_arrayElimIndex_50) (<= (+ 2 .cse30) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse30) 0) 0) (= (select (select |#memory_$Pointer$.offset| .cse31) 0) 0) (= (select (select |#memory_$Pointer$.offset| .cse32) 0) 0) (not (= .cse31 .cse30)) (= .cse16 .cse30) (not (= .cse32 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_int| .cse32) 4) 1))))))) (.cse2 (not (= .cse29 |ULTIMATE.start_main_~#s~0#1.base|))) (.cse3 (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)) (.cse4 (not (= .cse29 |ULTIMATE.start_sll_circular_create_#res#1.base|))) (.cse5 (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse6 (= (select |#valid| |ULTIMATE.start_sll_circular_create_#res#1.base|) 1)) (.cse7 (= |ULTIMATE.start_main_~ptr~0#1.offset| 0)) (.cse8 (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_#res#1.base|) 4) 1)) (.cse11 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse12 (= (select (select |#memory_$Pointer$.offset| .cse29) 0) 0)) (.cse13 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse23 (exists ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_23| Int) (v_arrayElimCell_87 Int)) (let ((.cse28 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_23|) v_arrayElimCell_87))) (let ((.cse27 (select (select |#memory_$Pointer$.base| .cse28) 0))) (and (not (= .cse27 0)) (not (= .cse27 .cse28)) (<= (+ 2 .cse28) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse16 .cse28)))))) (.cse17 (exists ((v_arrayElimIndex_26 Int)) (let ((.cse24 (select (select |#memory_$Pointer$.base| v_arrayElimIndex_26) 0))) (let ((.cse25 (select (select |#memory_$Pointer$.base| .cse24) 0))) (let ((.cse26 (select (select |#memory_$Pointer$.base| .cse25) 0))) (and (<= (+ 2 .cse24) |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse25 |ULTIMATE.start_main_~#s~0#1.base|)) (= .cse26 v_arrayElimIndex_26) (= .cse16 .cse26) (= (select (select |#memory_$Pointer$.offset| .cse26) 0) 0) (= (select (select |#memory_$Pointer$.offset| .cse25) 0) 0) (<= (+ 2 .cse26) |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse25 .cse24)) (= (select (select |#memory_int| .cse24) 4) 1) (= (select (select |#memory_$Pointer$.offset| .cse24) 0) 0))))))) (.cse18 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (.cse19 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse20 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) 0) 0)) (.cse21 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (and .cse0 .cse1 .cse2 (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| .cse9) .cse10)) .cse11 .cse12 .cse13 (exists ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_23| Int) (v_arrayElimCell_87 Int)) (let ((.cse15 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_23|) v_arrayElimCell_87))) (let ((.cse14 (select (select |#memory_$Pointer$.base| .cse15) 0))) (and (not (= .cse14 0)) (not (= .cse14 .cse15)) (<= (+ 2 .cse15) |ULTIMATE.start_main_~#s~0#1.base|) (= .cse16 .cse15) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_23|) v_arrayElimCell_87) 0) (= 0 (select (select |#memory_$Pointer$.offset| .cse15) 0)))))) .cse17 .cse18 .cse19 .cse20 .cse21 (= 2 |ULTIMATE.start_main_~count~0#1|)) (and .cse0 .cse1 .cse22 .cse2 (= |ULTIMATE.start_main_~count~0#1| 1) .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse10) .cse6 .cse8 .cse11 .cse12 .cse13 .cse23 .cse17 .cse18 .cse19 .cse20 .cse21 (= |ULTIMATE.start_main_~ptr~0#1.base| .cse9)) (and .cse0 .cse1 .cse22 .cse2 .cse3 .cse4 .cse5 .cse6 (= (select (select |#memory_int| .cse16) 4) 1) .cse7 .cse8 (= |ULTIMATE.start_main_~count~0#1| 0) .cse11 .cse12 .cse13 .cse23 .cse17 .cse18 .cse19 .cse20 .cse21 (= .cse16 |ULTIMATE.start_main_~ptr~0#1.base|))))) [2023-11-06 22:01:29,125 INFO L899 garLoopResultBuilder]: For program point L628-5(lines 621 642) no Hoare annotation was computed. [2023-11-06 22:01:29,125 INFO L895 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: (and (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= (+ |ULTIMATE.start_sll_circular_create_~head~0#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_circular_create_~data#1| 1)) [2023-11-06 22:01:29,125 INFO L899 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2023-11-06 22:01:29,126 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:01:29,126 INFO L899 garLoopResultBuilder]: For program point L608(lines 608 619) no Hoare annotation was computed. [2023-11-06 22:01:29,126 INFO L895 garLoopResultBuilder]: At program point main_ERROR#1(lines 621 642) the Hoare annotation is: false [2023-11-06 22:01:29,126 INFO L899 garLoopResultBuilder]: For program point L629(lines 629 631) no Hoare annotation was computed. [2023-11-06 22:01:29,126 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 604) no Hoare annotation was computed. [2023-11-06 22:01:29,126 INFO L895 garLoopResultBuilder]: At program point L584(line 584) the Hoare annotation is: (and (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_circular_create_~data#1| 1)) [2023-11-06 22:01:29,126 INFO L899 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2023-11-06 22:01:29,127 INFO L899 garLoopResultBuilder]: For program point L613-1(lines 613 615) no Hoare annotation was computed. [2023-11-06 22:01:29,127 INFO L895 garLoopResultBuilder]: At program point L613-3(lines 613 615) the Hoare annotation is: (let ((.cse11 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |#memory_$Pointer$.base| .cse1) 0)) (.cse12 (select (select |#memory_$Pointer$.base| .cse11) 0)) (.cse38 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (let ((.cse0 (not (= |ULTIMATE.start_sll_circular_create_#res#1.base| 0))) (.cse2 (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1)) (.cse4 (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)) (.cse5 (not (= .cse38 |ULTIMATE.start_sll_circular_create_#res#1.base|))) (.cse6 (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse7 (= (select |#valid| |ULTIMATE.start_sll_circular_create_#res#1.base|) 1)) (.cse8 (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0)) (.cse9 (= (select (select |#memory_int| .cse1) 4) 1)) (.cse10 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) 0)) (.cse13 (<= (+ |ULTIMATE.start_sll_circular_create_#res#1.base| 1) |#StackHeapBarrier|)) (.cse14 (= (select (select |#memory_int| .cse38) 4) 1)) (.cse15 (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_#res#1.base|) 4) 1)) (.cse16 (= (select (select |#memory_$Pointer$.offset| .cse12) 0) 0)) (.cse17 (<= (+ .cse38 1) |#StackHeapBarrier|)) (.cse18 (= |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0)) (.cse19 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse20 (= (select (select |#memory_$Pointer$.offset| .cse1) 0) 0)) (.cse21 (= (select |#valid| .cse38) 1)) (.cse22 (= (select (select |#memory_$Pointer$.offset| .cse38) 0) 0)) (.cse23 (<= (+ .cse1 1) |#StackHeapBarrier|)) (.cse24 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse25 (= 0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) (.cse26 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) 0)) (.cse27 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (.cse28 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse29 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) 0) 0)) (.cse30 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse31 (= |ULTIMATE.start_sll_circular_prepend_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse32 (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse11) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse11) 1) (= (let ((.cse37 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse37 (select |v_old(#valid)_AFTER_CALL_12| .cse37))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse12) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2) |ULTIMATE.start_sll_circular_prepend_~head#1.base|)))) (.cse33 (= |ULTIMATE.start_sll_circular_prepend_~data#1| 1)) (.cse34 (= (select (select |#memory_int| .cse3) 4) 1)) (.cse35 (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse36 (<= (+ .cse3 1) |#StackHeapBarrier|))) (or (and .cse0 (not (= .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) .cse2 (= (select |#valid| .cse3) 1) .cse4 .cse5 .cse6 (= (select |#valid| .cse1) 1) .cse7 .cse8 .cse9 .cse10 (= .cse11 (select (select |#memory_$Pointer$.base| .cse12) 0)) .cse13 .cse14 .cse15 .cse16 .cse17 (not (= .cse1 0)) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (= .cse12 |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36) (and .cse0 .cse2 .cse4 (not (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 (= .cse11 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 0)) 0)) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (= .cse11 |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 (= (select |#valid| .cse11) 1) (= (select |#valid| .cse12) 1) .cse33 .cse34 .cse35 .cse36 (not (= .cse11 0))))))) [2023-11-06 22:01:29,127 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-11-06 22:01:29,128 INFO L899 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2023-11-06 22:01:29,128 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2023-11-06 22:01:29,128 INFO L899 garLoopResultBuilder]: For program point node_createFINAL(lines 574 582) no Hoare annotation was computed. [2023-11-06 22:01:29,128 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2023-11-06 22:01:29,128 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2023-11-06 22:01:29,132 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1] [2023-11-06 22:01:29,134 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:01:29,141 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:587) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:347) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:480) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:455) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-06 22:01:29,144 INFO L158 Benchmark]: Toolchain (without parser) took 156056.81ms. Allocated memory was 146.8MB in the beginning and 536.9MB in the end (delta: 390.1MB). Free memory was 114.1MB in the beginning and 178.9MB in the end (delta: -64.8MB). Peak memory consumption was 329.4MB. Max. memory is 16.1GB. [2023-11-06 22:01:29,145 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 121.6MB. Free memory is still 95.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:01:29,145 INFO L158 Benchmark]: CACSL2BoogieTranslator took 543.75ms. Allocated memory is still 146.8MB. Free memory was 114.1MB in the beginning and 96.4MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-06 22:01:29,145 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.30ms. Allocated memory is still 146.8MB. Free memory was 96.4MB in the beginning and 94.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:01:29,146 INFO L158 Benchmark]: Boogie Preprocessor took 39.18ms. Allocated memory is still 146.8MB. Free memory was 94.3MB in the beginning and 92.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:01:29,146 INFO L158 Benchmark]: RCFGBuilder took 663.91ms. Allocated memory is still 146.8MB. Free memory was 92.2MB in the beginning and 75.0MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 22:01:29,146 INFO L158 Benchmark]: TraceAbstraction took 154749.57ms. Allocated memory was 146.8MB in the beginning and 536.9MB in the end (delta: 390.1MB). Free memory was 74.5MB in the beginning and 178.9MB in the end (delta: -104.4MB). Peak memory consumption was 289.6MB. Max. memory is 16.1GB. [2023-11-06 22:01:29,148 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 121.6MB. Free memory is still 95.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 543.75ms. Allocated memory is still 146.8MB. Free memory was 114.1MB in the beginning and 96.4MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.30ms. Allocated memory is still 146.8MB. Free memory was 96.4MB in the beginning and 94.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.18ms. Allocated memory is still 146.8MB. Free memory was 94.3MB in the beginning and 92.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 663.91ms. Allocated memory is still 146.8MB. Free memory was 92.2MB in the beginning and 75.0MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 154749.57ms. Allocated memory was 146.8MB in the beginning and 536.9MB in the end (delta: 390.1MB). Free memory was 74.5MB in the beginning and 178.9MB in the end (delta: -104.4MB). Peak memory consumption was 289.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 640]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 154.7s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 32.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 756 SdHoareTripleChecker+Valid, 11.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 752 mSDsluCounter, 3056 SdHoareTripleChecker+Invalid, 10.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 756 IncrementalHoareTripleChecker+Unchecked, 2767 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7156 IncrementalHoareTripleChecker+Invalid, 8018 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 289 mSDtfsCounter, 7156 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1043 GetRequests, 470 SyntacticMatches, 5 SemanticMatches, 568 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 6798 ImplicationChecksByTransitivity, 73.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=8, InterpolantAutomatonStates: 213, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 61 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 24 PreInvPairs, 36 NumberOfFragments, 3011 HoareAnnotationTreeSize, 24 FomulaSimplifications, 754 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 2324 FormulaSimplificationTreeSizeReductionInter, 5.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 110.2s InterpolantComputationTime, 970 NumberOfCodeBlocks, 970 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 993 ConstructedInterpolants, 52 QuantifiedInterpolants, 29041 SizeOfPredicates, 220 NumberOfNonLiveVariables, 4078 ConjunctsInSsa, 1074 ConjunctsInUnsatCore, 25 InterpolantComputations, 3 PerfectInterpolantSequences, 371/622 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:587) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-06 22:01:29,265 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:01:31,752 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:01:31,882 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:01:31,890 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:01:31,891 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:01:31,935 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:01:31,936 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:01:31,936 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:01:31,938 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:01:31,943 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:01:31,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:01:31,944 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:01:31,944 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:01:31,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:01:31,947 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:01:31,948 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:01:31,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:01:31,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:01:31,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:01:31,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:01:31,951 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:01:31,951 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:01:31,952 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:01:31,952 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:01:31,953 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:01:31,953 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:01:31,954 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:01:31,954 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:01:31,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:01:31,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:01:31,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:01:31,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:01:31,957 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:01:31,958 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:01:31,958 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:01:31,959 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:01:31,959 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:01:31,959 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:01:31,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:01:31,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:01:31,961 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:01:31,961 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:01:31,962 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/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_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> Automizer 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 -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2023-11-06 22:01:32,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:01:32,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:01:32,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:01:32,407 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:01:32,407 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:01:32,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2023-11-06 22:01:35,504 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:01:35,885 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:01:35,886 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2023-11-06 22:01:35,909 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/data/4b9b23e60/38799570d3a94fd89c0135974fc1de58/FLAG8f5fcb6f1 [2023-11-06 22:01:35,930 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/data/4b9b23e60/38799570d3a94fd89c0135974fc1de58 [2023-11-06 22:01:35,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:01:35,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:01:35,940 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:01:35,940 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:01:35,946 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:01:35,947 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:01:35" (1/1) ... [2023-11-06 22:01:35,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f8d28a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:35, skipping insertion in model container [2023-11-06 22:01:35,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:01:35" (1/1) ... [2023-11-06 22:01:36,007 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:01:36,308 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_da606fa3-d258-454e-a7bd-752fc9e026b1/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2023-11-06 22:01:36,313 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:01:36,327 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:01:36,428 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_da606fa3-d258-454e-a7bd-752fc9e026b1/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2023-11-06 22:01:36,429 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:01:36,519 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:01:36,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:36 WrapperNode [2023-11-06 22:01:36,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:01:36,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:01:36,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:01:36,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:01:36,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:36" (1/1) ... [2023-11-06 22:01:36,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:36" (1/1) ... [2023-11-06 22:01:36,593 INFO L138 Inliner]: procedures = 130, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 141 [2023-11-06 22:01:36,593 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:01:36,594 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:01:36,594 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:01:36,594 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:01:36,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:36" (1/1) ... [2023-11-06 22:01:36,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:36" (1/1) ... [2023-11-06 22:01:36,622 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:36" (1/1) ... [2023-11-06 22:01:36,622 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:36" (1/1) ... [2023-11-06 22:01:36,647 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:36" (1/1) ... [2023-11-06 22:01:36,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:36" (1/1) ... [2023-11-06 22:01:36,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:36" (1/1) ... [2023-11-06 22:01:36,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:36" (1/1) ... [2023-11-06 22:01:36,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:01:36,673 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:01:36,674 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:01:36,674 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:01:36,675 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:36" (1/1) ... [2023-11-06 22:01:36,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:01:36,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:36,729 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:01:36,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:01:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 22:01:36,769 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-06 22:01:36,769 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-06 22:01:36,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:01:36,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:01:36,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:01:36,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:01:36,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:01:36,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:01:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:01:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 22:01:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:01:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:01:36,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:01:36,966 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:01:36,969 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:01:37,401 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:01:37,409 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:01:37,409 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-06 22:01:37,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:01:37 BoogieIcfgContainer [2023-11-06 22:01:37,412 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:01:37,415 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:01:37,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:01:37,420 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:01:37,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:01:35" (1/3) ... [2023-11-06 22:01:37,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c89453e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:01:37, skipping insertion in model container [2023-11-06 22:01:37,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:36" (2/3) ... [2023-11-06 22:01:37,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c89453e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:01:37, skipping insertion in model container [2023-11-06 22:01:37,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:01:37" (3/3) ... [2023-11-06 22:01:37,428 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2023-11-06 22:01:37,450 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:01:37,451 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:01:37,540 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:01:37,547 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@69bc22a8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:01:37,547 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:01:37,552 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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-06 22:01:37,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 22:01:37,562 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:37,563 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:01:37,563 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:01:37,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:37,570 INFO L85 PathProgramCache]: Analyzing trace with hash -483023916, now seen corresponding path program 1 times [2023-11-06 22:01:37,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:01:37,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [702342470] [2023-11-06 22:01:37,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:37,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:01:37,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:01:37,595 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:01:37,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:01:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:37,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:01:37,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:37,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:01:37,859 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:01:37,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:01:37,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [702342470] [2023-11-06 22:01:37,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [702342470] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:37,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:01:37,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:01:37,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936305014] [2023-11-06 22:01:37,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:37,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:01:37,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:01:37,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:01:37,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:01:37,921 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:01:37,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:37,951 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2023-11-06 22:01:37,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:01:37,954 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-11-06 22:01:37,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:37,961 INFO L225 Difference]: With dead ends: 65 [2023-11-06 22:01:37,962 INFO L226 Difference]: Without dead ends: 28 [2023-11-06 22:01:37,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:01:37,970 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:37,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:01:37,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-06 22:01:38,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-06 22:01:38,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 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-06 22:01:38,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-11-06 22:01:38,018 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2023-11-06 22:01:38,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:38,020 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-11-06 22:01:38,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:01:38,021 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-11-06 22:01:38,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 22:01:38,022 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:38,023 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:01:38,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:01:38,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:01:38,243 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:01:38,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:38,244 INFO L85 PathProgramCache]: Analyzing trace with hash -938400178, now seen corresponding path program 1 times [2023-11-06 22:01:38,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:01:38,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557347653] [2023-11-06 22:01:38,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:38,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:01:38,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:01:38,247 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:01:38,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 22:01:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:38,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:01:38,451 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:38,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:01:38,533 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:01:38,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:01:38,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557347653] [2023-11-06 22:01:38,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1557347653] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:38,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:01:38,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:01:38,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948319904] [2023-11-06 22:01:38,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:38,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:01:38,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:01:38,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:01:38,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:01:38,544 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:01:38,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:38,584 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2023-11-06 22:01:38,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:01:38,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-11-06 22:01:38,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:38,587 INFO L225 Difference]: With dead ends: 52 [2023-11-06 22:01:38,587 INFO L226 Difference]: Without dead ends: 31 [2023-11-06 22:01:38,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-06 22:01:38,590 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:38,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 59 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:01:38,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-06 22:01:38,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-11-06 22:01:38,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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-06 22:01:38,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-11-06 22:01:38,606 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2023-11-06 22:01:38,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:38,607 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-11-06 22:01:38,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:01:38,608 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-11-06 22:01:38,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-06 22:01:38,612 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:38,612 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:01:38,631 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:01:38,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:01:38,829 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:01:38,830 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:38,830 INFO L85 PathProgramCache]: Analyzing trace with hash 436872902, now seen corresponding path program 1 times [2023-11-06 22:01:38,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:01:38,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942590635] [2023-11-06 22:01:38,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:38,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:01:38,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:01:38,832 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:01:38,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 22:01:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:39,090 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-06 22:01:39,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:39,406 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-06 22:01:39,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:01:39,658 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-06 22:01:39,743 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-06 22:01:39,768 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:01:39,769 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:01:39,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:01:39,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942590635] [2023-11-06 22:01:39,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942590635] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:39,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [868194181] [2023-11-06 22:01:39,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:39,999 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-06 22:01:39,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/cvc4 [2023-11-06 22:01:40,036 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-06 22:01:40,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-11-06 22:01:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:40,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-06 22:01:40,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:40,883 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-06 22:01:41,076 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:01:41,077 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 17 treesize of output 16 [2023-11-06 22:01:41,206 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 20 treesize of output 12 [2023-11-06 22:01:41,245 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:01:41,245 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:01:41,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [868194181] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:41,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:01:41,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2023-11-06 22:01:41,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042715554] [2023-11-06 22:01:41,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:01:41,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-06 22:01:41,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:01:41,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-06 22:01:41,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=461, Unknown=6, NotChecked=0, Total=552 [2023-11-06 22:01:41,378 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 22 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 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-06 22:01:43,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:01:43,544 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2023-11-06 22:01:43,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:01:43,545 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 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 32 [2023-11-06 22:01:43,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:01:43,546 INFO L225 Difference]: With dead ends: 39 [2023-11-06 22:01:43,546 INFO L226 Difference]: Without dead ends: 31 [2023-11-06 22:01:43,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=171, Invalid=815, Unknown=6, NotChecked=0, Total=992 [2023-11-06 22:01:43,549 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 74 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:01:43,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 154 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-06 22:01:43,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-06 22:01:43,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-11-06 22:01:43,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 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-06 22:01:43,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-11-06 22:01:43,558 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 32 [2023-11-06 22:01:43,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:01:43,559 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-11-06 22:01:43,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 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-06 22:01:43,559 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-11-06 22:01:43,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-06 22:01:43,560 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:01:43,561 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:01:43,572 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:01:43,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:01:43,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt [2023-11-06 22:01:43,964 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:01:43,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:43,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1205420011, now seen corresponding path program 1 times [2023-11-06 22:01:43,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:01:43,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564746733] [2023-11-06 22:01:43,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:43,966 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:01:43,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:01:43,967 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:01:44,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-06 22:01:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:44,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-06 22:01:44,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:44,309 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 7 [2023-11-06 22:01:44,661 INFO L322 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-06 22:01:44,662 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 19 treesize of output 27 [2023-11-06 22:01:44,754 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-06 22:01:44,900 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:01:44,900 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 36 treesize of output 35 [2023-11-06 22:01:45,095 INFO L322 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2023-11-06 22:01:45,096 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 51 treesize of output 35 [2023-11-06 22:01:45,107 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 13 treesize of output 9 [2023-11-06 22:01:45,117 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 15 treesize of output 11 [2023-11-06 22:01:45,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:01:45,498 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:01:45,498 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 59 treesize of output 50 [2023-11-06 22:01:45,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:01:45,521 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 48 treesize of output 41 [2023-11-06 22:01:45,568 INFO L322 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2023-11-06 22:01:45,569 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 36 treesize of output 38 [2023-11-06 22:01:45,731 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 44 treesize of output 32 [2023-11-06 22:01:45,925 INFO L322 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-11-06 22:01:45,925 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 55 treesize of output 31 [2023-11-06 22:01:46,033 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:01:46,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:01:46,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:01:46,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564746733] [2023-11-06 22:01:46,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1564746733] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:01:46,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1850048039] [2023-11-06 22:01:46,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:46,522 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-06 22:01:46,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/cvc4 [2023-11-06 22:01:46,523 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-06 22:01:46,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da606fa3-d258-454e-a7bd-752fc9e026b1/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-11-06 22:01:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:46,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-06 22:01:47,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:01:47,892 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-06 22:01:48,214 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-06 22:01:48,234 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-06 22:01:48,538 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:01:48,539 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-06 22:01:52,656 INFO L322 Elim1Store]: treesize reduction 431, result has 5.7 percent of original size [2023-11-06 22:01:52,656 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 9 new quantified variables, introduced 17 case distinctions, treesize of input 856 treesize of output 674 [2023-11-06 22:01:53,172 INFO L322 Elim1Store]: treesize reduction 5580, result has 0.0 percent of original size [2023-11-06 22:01:53,175 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 12 new quantified variables, introduced 57 case distinctions, treesize of input 42101 treesize of output 41013 [2023-11-06 22:01:53,784 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:01:53,796 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:01:53,805 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:01:53,823 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:01:53,825 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:01:53,826 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:01:53,895 INFO L322 Elim1Store]: treesize reduction 186, result has 0.5 percent of original size [2023-11-06 22:01:53,896 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 10 new quantified variables, introduced 6 case distinctions, treesize of input 6617 treesize of output 6744 [2023-11-06 22:01:54,407 INFO L322 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2023-11-06 22:01:54,409 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 6711 treesize of output 5948 [2023-11-06 22:01:55,057 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:01:55,082 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:01:55,084 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:01:55,096 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:01:55,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:01:55,140 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:01:55,141 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:01:55,154 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:01:55,459 INFO L322 Elim1Store]: treesize reduction 5580, result has 0.0 percent of original size [2023-11-06 22:01:55,462 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 12 new quantified variables, introduced 57 case distinctions, treesize of input 42101 treesize of output 41013 [2023-11-06 22:01:56,033 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:01:56,048 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:01:56,058 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:01:56,080 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:01:56,082 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:01:56,084 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:01:56,139 INFO L322 Elim1Store]: treesize reduction 186, result has 0.5 percent of original size [2023-11-06 22:01:56,141 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 10 new quantified variables, introduced 6 case distinctions, treesize of input 6617 treesize of output 6744 [2023-11-06 22:01:56,709 INFO L322 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2023-11-06 22:01:56,711 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 6711 treesize of output 5948 [2023-11-06 22:01:57,220 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:01:57,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:01:57,263 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:01:57,264 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:01:57,276 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:02:03,539 WARN L293 SmtUtils]: Spent 6.18s on a formula simplification. DAG size of input: 407 DAG size of output: 47 (called from [L 319] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-06 22:02:03,539 INFO L322 Elim1Store]: treesize reduction 5460, result has 2.2 percent of original size [2023-11-06 22:02:03,541 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 12 new quantified variables, introduced 57 case distinctions, treesize of input 41991 treesize of output 41023 [2023-11-06 22:02:04,187 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:02:04,198 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:02:04,232 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:02:04,234 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:02:18,204 WARN L293 SmtUtils]: Spent 13.96s on a formula simplification. DAG size of input: 165 DAG size of output: 38 (called from [L 319] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-06 22:02:18,204 INFO L322 Elim1Store]: treesize reduction 907, result has 5.6 percent of original size [2023-11-06 22:02:18,206 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 10 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 15 new quantified variables, introduced 27 case distinctions, treesize of input 8497 treesize of output 9289 [2023-11-06 22:02:18,811 INFO L322 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2023-11-06 22:02:18,813 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 9060 treesize of output 8040