./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76cbabe8-51f8-4b21-b024-a227029adee1/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76cbabe8-51f8-4b21-b024-a227029adee1/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76cbabe8-51f8-4b21-b024-a227029adee1/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76cbabe8-51f8-4b21-b024-a227029adee1/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76cbabe8-51f8-4b21-b024-a227029adee1/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76cbabe8-51f8-4b21-b024-a227029adee1/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 19:51:06,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 19:51:06,698 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76cbabe8-51f8-4b21-b024-a227029adee1/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 19:51:06,703 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 19:51:06,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 19:51:06,749 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 19:51:06,750 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 19:51:06,751 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 19:51:06,752 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 19:51:06,752 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 19:51:06,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 19:51:06,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 19:51:06,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 19:51:06,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 19:51:06,754 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 19:51:06,755 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 19:51:06,755 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 19:51:06,755 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 19:51:06,755 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 19:51:06,757 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 19:51:06,757 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 19:51:06,757 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 19:51:06,758 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 19:51:06,758 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 19:51:06,758 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 19:51:06,758 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 19:51:06,758 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 19:51:06,758 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 19:51:06,759 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 19:51:06,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:51:06,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:51:06,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:51:06,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:51:06,759 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 19:51:06,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:51:06,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:51:06,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:51:06,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:51:06,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 19:51:06,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 19:51:06,760 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 19:51:06,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 19:51:06,760 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 19:51:06,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 19:51:06,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 19:51:06,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 19:51:06,760 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 19:51:06,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 19:51:06,760 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_76cbabe8-51f8-4b21-b024-a227029adee1/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 [2024-11-27 19:51:07,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 19:51:07,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 19:51:07,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 19:51:07,149 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 19:51:07,149 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 19:51:07,151 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76cbabe8-51f8-4b21-b024-a227029adee1/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2024-11-27 19:51:10,185 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76cbabe8-51f8-4b21-b024-a227029adee1/bin/uautomizer-verify-aQ6SnzHsRB/data/01b3372a2/24853744d02f42b081bdb214a6c3aef7/FLAG09338d4f2 [2024-11-27 19:51:10,634 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 19:51:10,635 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76cbabe8-51f8-4b21-b024-a227029adee1/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2024-11-27 19:51:10,658 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76cbabe8-51f8-4b21-b024-a227029adee1/bin/uautomizer-verify-aQ6SnzHsRB/data/01b3372a2/24853744d02f42b081bdb214a6c3aef7/FLAG09338d4f2 [2024-11-27 19:51:10,683 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76cbabe8-51f8-4b21-b024-a227029adee1/bin/uautomizer-verify-aQ6SnzHsRB/data/01b3372a2/24853744d02f42b081bdb214a6c3aef7 [2024-11-27 19:51:10,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 19:51:10,688 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 19:51:10,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 19:51:10,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 19:51:10,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 19:51:10,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:51:10" (1/1) ... [2024-11-27 19:51:10,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f6d0622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:10, skipping insertion in model container [2024-11-27 19:51:10,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:51:10" (1/1) ... [2024-11-27 19:51:10,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 19:51:11,411 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76cbabe8-51f8-4b21-b024-a227029adee1/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2024-11-27 19:51:11,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:51:11,507 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 19:51:11,573 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76cbabe8-51f8-4b21-b024-a227029adee1/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2024-11-27 19:51:11,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:51:11,680 INFO L204 MainTranslator]: Completed translation [2024-11-27 19:51:11,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:11 WrapperNode [2024-11-27 19:51:11,681 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 19:51:11,682 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 19:51:11,682 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 19:51:11,682 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 19:51:11,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:11" (1/1) ... [2024-11-27 19:51:11,705 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:11" (1/1) ... [2024-11-27 19:51:11,731 INFO L138 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 114 [2024-11-27 19:51:11,732 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 19:51:11,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 19:51:11,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 19:51:11,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 19:51:11,743 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:11" (1/1) ... [2024-11-27 19:51:11,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:11" (1/1) ... [2024-11-27 19:51:11,748 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:11" (1/1) ... [2024-11-27 19:51:11,794 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2024-11-27 19:51:11,794 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:11" (1/1) ... [2024-11-27 19:51:11,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:11" (1/1) ... [2024-11-27 19:51:11,815 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:11" (1/1) ... [2024-11-27 19:51:11,820 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:11" (1/1) ... [2024-11-27 19:51:11,826 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:11" (1/1) ... [2024-11-27 19:51:11,828 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:11" (1/1) ... [2024-11-27 19:51:11,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:11" (1/1) ... [2024-11-27 19:51:11,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 19:51:11,835 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 19:51:11,836 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 19:51:11,836 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 19:51:11,837 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:11" (1/1) ... [2024-11-27 19:51:11,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:51:11,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76cbabe8-51f8-4b21-b024-a227029adee1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:51:11,877 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76cbabe8-51f8-4b21-b024-a227029adee1/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 19:51:11,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76cbabe8-51f8-4b21-b024-a227029adee1/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 19:51:11,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-27 19:51:11,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-27 19:51:11,915 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2024-11-27 19:51:11,916 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2024-11-27 19:51:11,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 19:51:11,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-27 19:51:11,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-27 19:51:11,917 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2024-11-27 19:51:11,917 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2024-11-27 19:51:11,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-27 19:51:11,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-27 19:51:11,917 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-27 19:51:11,917 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-27 19:51:11,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-27 19:51:11,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-27 19:51:11,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 19:51:11,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 19:51:11,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-27 19:51:11,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-27 19:51:11,919 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2024-11-27 19:51:11,919 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2024-11-27 19:51:11,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 19:51:11,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-27 19:51:11,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 19:51:11,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 19:51:12,122 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 19:51:12,124 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 19:51:12,652 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-11-27 19:51:12,652 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 19:51:12,667 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 19:51:12,668 INFO L312 CfgBuilder]: Removed 23 assume(true) statements. [2024-11-27 19:51:12,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:51:12 BoogieIcfgContainer [2024-11-27 19:51:12,668 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 19:51:12,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 19:51:12,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 19:51:12,678 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 19:51:12,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 07:51:10" (1/3) ... [2024-11-27 19:51:12,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@614e45a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:51:12, skipping insertion in model container [2024-11-27 19:51:12,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:11" (2/3) ... [2024-11-27 19:51:12,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@614e45a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:51:12, skipping insertion in model container [2024-11-27 19:51:12,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:51:12" (3/3) ... [2024-11-27 19:51:12,681 INFO L128 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-1.i [2024-11-27 19:51:12,702 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 19:51:12,704 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bubble_sort_linux-1.i that has 5 procedures, 118 locations, 1 initial locations, 23 loop locations, and 1 error locations. [2024-11-27 19:51:12,779 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 19:51:12,801 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3ea5a7b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 19:51:12,801 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 19:51:12,806 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 89 states have (on average 1.7415730337078652) internal successors, (155), 108 states have internal predecessors, (155), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-27 19:51:12,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-27 19:51:12,813 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:12,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:12,815 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:12,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:12,821 INFO L85 PathProgramCache]: Analyzing trace with hash 680608999, now seen corresponding path program 1 times [2024-11-27 19:51:12,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:12,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668644456] [2024-11-27 19:51:12,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:12,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:13,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:13,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:13,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668644456] [2024-11-27 19:51:13,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668644456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:13,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:13,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:51:13,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124410424] [2024-11-27 19:51:13,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:13,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 19:51:13,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:13,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 19:51:13,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 19:51:13,075 INFO L87 Difference]: Start difference. First operand has 118 states, 89 states have (on average 1.7415730337078652) internal successors, (155), 108 states have internal predecessors, (155), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:51:13,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:13,145 INFO L93 Difference]: Finished difference Result 230 states and 397 transitions. [2024-11-27 19:51:13,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 19:51:13,149 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-27 19:51:13,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:13,161 INFO L225 Difference]: With dead ends: 230 [2024-11-27 19:51:13,161 INFO L226 Difference]: Without dead ends: 106 [2024-11-27 19:51:13,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 19:51:13,174 INFO L435 NwaCegarLoop]: 136 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, 136 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 [2024-11-27 19:51:13,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:51:13,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-27 19:51:13,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-27 19:51:13,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 96 states have internal predecessors, (101), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-27 19:51:13,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2024-11-27 19:51:13,236 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 9 [2024-11-27 19:51:13,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:13,238 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2024-11-27 19:51:13,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:51:13,239 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2024-11-27 19:51:13,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-27 19:51:13,241 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:13,242 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:13,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 19:51:13,243 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:13,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:13,244 INFO L85 PathProgramCache]: Analyzing trace with hash 157250861, now seen corresponding path program 1 times [2024-11-27 19:51:13,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:13,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791927993] [2024-11-27 19:51:13,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:13,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:13,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:13,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:13,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791927993] [2024-11-27 19:51:13,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791927993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:13,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:13,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:51:13,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669300513] [2024-11-27 19:51:13,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:13,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:51:13,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:13,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:51:13,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:51:13,868 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 19:51:14,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:14,095 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2024-11-27 19:51:14,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:51:14,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-27 19:51:14,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:14,099 INFO L225 Difference]: With dead ends: 108 [2024-11-27 19:51:14,099 INFO L226 Difference]: Without dead ends: 105 [2024-11-27 19:51:14,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-27 19:51:14,100 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 175 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:14,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 246 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:51:14,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-27 19:51:14,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-27 19:51:14,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 95 states have internal predecessors, (100), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-27 19:51:14,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 125 transitions. [2024-11-27 19:51:14,143 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 125 transitions. Word has length 20 [2024-11-27 19:51:14,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:14,144 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 125 transitions. [2024-11-27 19:51:14,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 19:51:14,144 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 125 transitions. [2024-11-27 19:51:14,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-27 19:51:14,145 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:14,145 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:14,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 19:51:14,145 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:14,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:14,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1461205823, now seen corresponding path program 1 times [2024-11-27 19:51:14,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:14,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360896749] [2024-11-27 19:51:14,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:14,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:15,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:15,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:15,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360896749] [2024-11-27 19:51:15,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360896749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:15,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:15,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-27 19:51:15,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699705403] [2024-11-27 19:51:15,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:15,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 19:51:15,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:15,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 19:51:15,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-27 19:51:15,145 INFO L87 Difference]: Start difference. First operand 105 states and 125 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 19:51:16,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:16,189 INFO L93 Difference]: Finished difference Result 197 states and 234 transitions. [2024-11-27 19:51:16,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 19:51:16,190 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-27 19:51:16,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:16,197 INFO L225 Difference]: With dead ends: 197 [2024-11-27 19:51:16,197 INFO L226 Difference]: Without dead ends: 191 [2024-11-27 19:51:16,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-11-27 19:51:16,199 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 360 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:16,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 575 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-27 19:51:16,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-27 19:51:16,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 171. [2024-11-27 19:51:16,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 143 states have (on average 1.2447552447552448) internal successors, (178), 157 states have internal predecessors, (178), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-27 19:51:16,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 208 transitions. [2024-11-27 19:51:16,258 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 208 transitions. Word has length 23 [2024-11-27 19:51:16,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:16,259 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 208 transitions. [2024-11-27 19:51:16,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 19:51:16,259 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 208 transitions. [2024-11-27 19:51:16,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-27 19:51:16,260 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:16,260 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:16,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 19:51:16,264 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:16,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:16,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1585129764, now seen corresponding path program 1 times [2024-11-27 19:51:16,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:16,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748201866] [2024-11-27 19:51:16,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:16,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:17,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:17,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:17,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748201866] [2024-11-27 19:51:17,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748201866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:17,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:17,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-27 19:51:17,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045888760] [2024-11-27 19:51:17,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:17,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 19:51:17,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:17,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 19:51:17,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-27 19:51:17,893 INFO L87 Difference]: Start difference. First operand 171 states and 208 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 19:51:19,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:19,621 INFO L93 Difference]: Finished difference Result 272 states and 327 transitions. [2024-11-27 19:51:19,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-27 19:51:19,622 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-27 19:51:19,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:19,624 INFO L225 Difference]: With dead ends: 272 [2024-11-27 19:51:19,624 INFO L226 Difference]: Without dead ends: 269 [2024-11-27 19:51:19,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2024-11-27 19:51:19,626 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 307 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:19,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 227 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-27 19:51:19,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-27 19:51:19,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 251. [2024-11-27 19:51:19,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 216 states have (on average 1.2407407407407407) internal successors, (268), 231 states have internal predecessors, (268), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-27 19:51:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 307 transitions. [2024-11-27 19:51:19,684 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 307 transitions. Word has length 26 [2024-11-27 19:51:19,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:19,685 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 307 transitions. [2024-11-27 19:51:19,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 19:51:19,685 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 307 transitions. [2024-11-27 19:51:19,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-27 19:51:19,686 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:19,686 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-11-27 19:51:19,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 19:51:19,687 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:19,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:19,688 INFO L85 PathProgramCache]: Analyzing trace with hash 284844051, now seen corresponding path program 1 times [2024-11-27 19:51:19,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:19,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788990722] [2024-11-27 19:51:19,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:19,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:20,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:20,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:20,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788990722] [2024-11-27 19:51:20,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788990722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:20,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:20,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-27 19:51:20,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345228571] [2024-11-27 19:51:20,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:20,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 19:51:20,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:20,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 19:51:20,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-27 19:51:20,834 INFO L87 Difference]: Start difference. First operand 251 states and 307 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 19:51:22,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:22,255 INFO L93 Difference]: Finished difference Result 271 states and 325 transitions. [2024-11-27 19:51:22,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-27 19:51:22,256 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-11-27 19:51:22,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:22,258 INFO L225 Difference]: With dead ends: 271 [2024-11-27 19:51:22,258 INFO L226 Difference]: Without dead ends: 268 [2024-11-27 19:51:22,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-27 19:51:22,260 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 346 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:22,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 220 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-27 19:51:22,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-27 19:51:22,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 251. [2024-11-27 19:51:22,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 216 states have (on average 1.2361111111111112) internal successors, (267), 231 states have internal predecessors, (267), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-27 19:51:22,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 306 transitions. [2024-11-27 19:51:22,317 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 306 transitions. Word has length 29 [2024-11-27 19:51:22,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:22,318 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 306 transitions. [2024-11-27 19:51:22,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 19:51:22,318 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 306 transitions. [2024-11-27 19:51:22,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-27 19:51:22,320 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:22,321 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:22,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 19:51:22,323 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:22,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:22,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1328732599, now seen corresponding path program 1 times [2024-11-27 19:51:22,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:22,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073679887] [2024-11-27 19:51:22,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:22,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:23,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:23,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:23,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073679887] [2024-11-27 19:51:23,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073679887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:23,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:23,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-27 19:51:23,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043659404] [2024-11-27 19:51:23,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:23,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-27 19:51:23,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:23,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 19:51:23,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-27 19:51:23,581 INFO L87 Difference]: Start difference. First operand 251 states and 306 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 19:51:24,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:24,984 INFO L93 Difference]: Finished difference Result 270 states and 323 transitions. [2024-11-27 19:51:24,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 19:51:24,984 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-11-27 19:51:24,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:24,986 INFO L225 Difference]: With dead ends: 270 [2024-11-27 19:51:24,986 INFO L226 Difference]: Without dead ends: 267 [2024-11-27 19:51:24,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-11-27 19:51:24,987 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 340 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:24,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 250 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-27 19:51:24,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-27 19:51:25,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 251. [2024-11-27 19:51:25,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 216 states have (on average 1.2314814814814814) internal successors, (266), 231 states have internal predecessors, (266), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-27 19:51:25,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 305 transitions. [2024-11-27 19:51:25,038 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 305 transitions. Word has length 32 [2024-11-27 19:51:25,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:25,039 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 305 transitions. [2024-11-27 19:51:25,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 19:51:25,039 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 305 transitions. [2024-11-27 19:51:25,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-27 19:51:25,040 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:25,040 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:25,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 19:51:25,041 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:25,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:25,041 INFO L85 PathProgramCache]: Analyzing trace with hash -2100451710, now seen corresponding path program 1 times [2024-11-27 19:51:25,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:25,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336269123] [2024-11-27 19:51:25,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:25,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:26,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:26,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336269123] [2024-11-27 19:51:26,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336269123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:26,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:26,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-27 19:51:26,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828211990] [2024-11-27 19:51:26,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:26,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-27 19:51:26,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:26,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 19:51:26,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-27 19:51:26,467 INFO L87 Difference]: Start difference. First operand 251 states and 305 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 19:51:28,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:28,104 INFO L93 Difference]: Finished difference Result 269 states and 321 transitions. [2024-11-27 19:51:28,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 19:51:28,107 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2024-11-27 19:51:28,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:28,109 INFO L225 Difference]: With dead ends: 269 [2024-11-27 19:51:28,109 INFO L226 Difference]: Without dead ends: 266 [2024-11-27 19:51:28,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-11-27 19:51:28,111 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 333 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:28,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 243 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-27 19:51:28,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-27 19:51:28,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 251. [2024-11-27 19:51:28,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 216 states have (on average 1.2268518518518519) internal successors, (265), 231 states have internal predecessors, (265), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-27 19:51:28,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 304 transitions. [2024-11-27 19:51:28,165 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 304 transitions. Word has length 35 [2024-11-27 19:51:28,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:28,166 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 304 transitions. [2024-11-27 19:51:28,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 19:51:28,166 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 304 transitions. [2024-11-27 19:51:28,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-27 19:51:28,167 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:28,167 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:28,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 19:51:28,167 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:28,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:28,168 INFO L85 PathProgramCache]: Analyzing trace with hash 311075704, now seen corresponding path program 1 times [2024-11-27 19:51:28,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:28,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213676332] [2024-11-27 19:51:28,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:28,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:30,819 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-27 19:51:30,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:30,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213676332] [2024-11-27 19:51:30,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213676332] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:51:30,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690225487] [2024-11-27 19:51:30,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:30,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:51:30,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76cbabe8-51f8-4b21-b024-a227029adee1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:51:30,825 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76cbabe8-51f8-4b21-b024-a227029adee1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:51:30,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76cbabe8-51f8-4b21-b024-a227029adee1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 19:51:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:31,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-27 19:51:31,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:51:31,319 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-27 19:51:31,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-27 19:51:31,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-27 19:51:31,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-27 19:51:31,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-27 19:51:31,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-27 19:51:31,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2024-11-27 19:51:31,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2024-11-27 19:51:31,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2024-11-27 19:51:31,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:51:31,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 16 [2024-11-27 19:51:31,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:51:31,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 24 [2024-11-27 19:51:32,031 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-27 19:51:32,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-27 19:51:32,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-27 19:51:32,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:51:32,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 8 [2024-11-27 19:51:33,014 INFO L349 Elim1Store]: treesize reduction 178, result has 16.0 percent of original size [2024-11-27 19:51:33,015 INFO L378 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 109 treesize of output 98 [2024-11-27 19:51:33,060 INFO L349 Elim1Store]: treesize reduction 54, result has 5.3 percent of original size [2024-11-27 19:51:33,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 78 [2024-11-27 19:51:33,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:51:33,092 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-27 19:51:33,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 34 [2024-11-27 19:51:33,119 INFO L349 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2024-11-27 19:51:33,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 42 [2024-11-27 19:51:33,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-27 19:51:33,167 INFO L349 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2024-11-27 19:51:33,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 131 treesize of output 87 [2024-11-27 19:51:33,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:51:33,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2024-11-27 19:51:33,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:51:33,211 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-27 19:51:33,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 48 [2024-11-27 19:51:33,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-27 19:51:33,479 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-27 19:51:33,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 94 [2024-11-27 19:51:35,595 INFO L349 Elim1Store]: treesize reduction 136, result has 39.0 percent of original size [2024-11-27 19:51:35,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 231 treesize of output 158 [2024-11-27 19:51:35,898 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:35,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:51:36,131 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_415 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_415) |c_~#gl_list~0.base|) (+ |c_~#gl_list~0.offset| 4)) |c_~#gl_list~0.base|))) is different from false [2024-11-27 19:51:36,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690225487] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:51:36,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 19:51:36,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2024-11-27 19:51:36,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553178449] [2024-11-27 19:51:36,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 19:51:36,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-27 19:51:36,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:36,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-27 19:51:36,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1149, Unknown=1, NotChecked=68, Total=1332 [2024-11-27 19:51:36,665 INFO L87 Difference]: Start difference. First operand 251 states and 304 transitions. Second operand has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 21 states have internal predecessors, (63), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-27 19:51:48,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:48,884 INFO L93 Difference]: Finished difference Result 385 states and 452 transitions. [2024-11-27 19:51:48,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-27 19:51:48,886 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 21 states have internal predecessors, (63), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 38 [2024-11-27 19:51:48,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:48,891 INFO L225 Difference]: With dead ends: 385 [2024-11-27 19:51:48,891 INFO L226 Difference]: Without dead ends: 382 [2024-11-27 19:51:48,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=456, Invalid=3087, Unknown=1, NotChecked=116, Total=3660 [2024-11-27 19:51:48,894 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 1876 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 2408 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1879 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 2771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 2408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:48,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1879 Valid, 445 Invalid, 2771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 2408 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-27 19:51:48,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-27 19:51:49,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 263. [2024-11-27 19:51:49,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 225 states have (on average 1.2133333333333334) internal successors, (273), 241 states have internal predecessors, (273), 29 states have call successors, (29), 10 states have call predecessors, (29), 8 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-27 19:51:49,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 314 transitions. [2024-11-27 19:51:49,005 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 314 transitions. Word has length 38 [2024-11-27 19:51:49,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:49,005 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 314 transitions. [2024-11-27 19:51:49,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 21 states have internal predecessors, (63), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-27 19:51:49,006 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 314 transitions. [2024-11-27 19:51:49,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-27 19:51:49,007 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:49,007 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:49,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76cbabe8-51f8-4b21-b024-a227029adee1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-27 19:51:49,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76cbabe8-51f8-4b21-b024-a227029adee1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:51:49,209 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:49,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:49,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1408326437, now seen corresponding path program 1 times [2024-11-27 19:51:49,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:49,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500319519] [2024-11-27 19:51:49,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:49,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:50,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:50,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:50,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500319519] [2024-11-27 19:51:50,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500319519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:50,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:50,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-27 19:51:50,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284417555] [2024-11-27 19:51:50,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:50,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-27 19:51:50,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:50,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 19:51:50,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-27 19:51:50,059 INFO L87 Difference]: Start difference. First operand 263 states and 314 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 19:51:51,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:51,706 INFO L93 Difference]: Finished difference Result 277 states and 326 transitions. [2024-11-27 19:51:51,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-27 19:51:51,706 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2024-11-27 19:51:51,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:51,708 INFO L225 Difference]: With dead ends: 277 [2024-11-27 19:51:51,708 INFO L226 Difference]: Without dead ends: 274 [2024-11-27 19:51:51,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2024-11-27 19:51:51,709 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 410 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:51,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 234 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-27 19:51:51,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-27 19:51:51,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 263. [2024-11-27 19:51:51,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 225 states have (on average 1.208888888888889) internal successors, (272), 241 states have internal predecessors, (272), 29 states have call successors, (29), 10 states have call predecessors, (29), 8 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-27 19:51:51,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 313 transitions. [2024-11-27 19:51:51,804 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 313 transitions. Word has length 38 [2024-11-27 19:51:51,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:51,804 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 313 transitions. [2024-11-27 19:51:51,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 19:51:51,805 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 313 transitions. [2024-11-27 19:51:51,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-27 19:51:51,806 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:51,806 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:51,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 19:51:51,806 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:51,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:51,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1562903049, now seen corresponding path program 1 times [2024-11-27 19:51:51,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:51,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974166925] [2024-11-27 19:51:51,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:51,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:53,725 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:53,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:53,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974166925] [2024-11-27 19:51:53,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974166925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:51:53,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039396559] [2024-11-27 19:51:53,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:53,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:51:53,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76cbabe8-51f8-4b21-b024-a227029adee1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:51:53,729 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76cbabe8-51f8-4b21-b024-a227029adee1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:51:53,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76cbabe8-51f8-4b21-b024-a227029adee1/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 19:51:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:53,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 125 conjuncts are in the unsatisfiable core [2024-11-27 19:51:53,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:51:54,041 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-27 19:51:54,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-27 19:51:54,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-27 19:51:54,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2024-11-27 19:51:54,180 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:51:54,199 INFO L349 Elim1Store]: treesize reduction 14, result has 39.1 percent of original size [2024-11-27 19:51:54,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 25 [2024-11-27 19:51:54,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-27 19:51:54,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-27 19:51:54,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2024-11-27 19:51:54,418 INFO L349 Elim1Store]: treesize reduction 90, result has 30.2 percent of original size [2024-11-27 19:51:54,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 46 treesize of output 91 [2024-11-27 19:51:54,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-27 19:51:54,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-27 19:51:54,549 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-27 19:51:54,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2024-11-27 19:51:54,611 INFO L349 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2024-11-27 19:51:54,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 40 [2024-11-27 19:51:54,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:51:54,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-11-27 19:51:54,769 INFO L349 Elim1Store]: treesize reduction 38, result has 32.1 percent of original size [2024-11-27 19:51:54,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 103 [2024-11-27 19:51:55,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2024-11-27 19:51:55,429 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:51:55,454 INFO L349 Elim1Store]: treesize reduction 14, result has 39.1 percent of original size [2024-11-27 19:51:55,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 25 [2024-11-27 19:51:55,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-27 19:51:55,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-27 19:51:59,550 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| 3) 1) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |c_list_add_#in~new#1.base|)) (.cse42 (select |c_#memory_$Pointer$#1.base| |c_list_add_#in~new#1.base|)) (.cse10 (+ |c_list_add_#in~new#1.offset| 4))) (let ((.cse8 (select |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~new#1.base|)) (.cse11 (select .cse42 .cse10)) (.cse27 (= |c_list_add_#in~new#1.offset| (select .cse2 |c_list_add_#in~head#1.offset|))) (.cse43 (= |c_list_add_#in~new#1.offset| |c_list_add_#in~head#1.offset|)) (.cse25 (= |c_list_add_#in~head#1.base| |c_list_add_#in~new#1.base|))) (or (let ((.cse1 (not .cse25))) (and (let ((.cse9 (select .cse42 |c_list_add_#in~new#1.offset|)) (.cse0 (= .cse10 |c_list_add_#in~head#1.offset|))) (or (and (or (not .cse0) .cse1) (let ((.cse17 (select |c_#memory_$Pointer$#1.offset| |c_list_add_#in~head#1.base|))) (let ((.cse4 (exists ((|v_list_add___list_add_~next#1.base_26| Int) (|v_list_add___list_add_~next#1.offset_28| Int)) (let ((.cse35 (+ |v_list_add___list_add_~next#1.offset_28| 4))) (and (<= |c_list_add_#in~new#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |v_list_add___list_add_~next#1.base_26|) .cse35)) (not (= |c_list_add_#in~head#1.base| |v_list_add___list_add_~next#1.base_26|)) (= (let ((.cse36 (let ((.cse37 (store |c_old(#memory_$Pointer$#1.base)| |v_list_add___list_add_~next#1.base_26| (store (select |c_old(#memory_$Pointer$#1.base)| |v_list_add___list_add_~next#1.base_26|) .cse35 |c_list_add_#in~new#1.base|)))) (store .cse37 |c_list_add_#in~new#1.base| (store (store (select .cse37 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse9) .cse10 .cse11))))) (store .cse36 |c_list_add_#in~head#1.base| (store (select .cse36 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))) |c_#memory_$Pointer$#1.base|))))) (.cse16 (select |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~head#1.base|)) (.cse19 (= |c_list_add_#in~new#1.offset| (select .cse17 |c_list_add_#in~head#1.offset|))) (.cse18 (store .cse2 |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|))) (or (and (or (and (or (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_$Pointer$#1.offset| |c_list_add_#in~new#1.base| v_DerPreprocessor_5) |c_list_add_#in~head#1.base| v_DerPreprocessor_6) |c_list_add_#in~new#1.base|))) (and (= .cse2 .cse3) (= .cse3 v_DerPreprocessor_5)))) .cse4) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_list_add___list_add_~next#1.offset_28| Int)) (let ((.cse6 (+ |v_list_add___list_add_~next#1.offset_28| 4)) (.cse5 (select (store (store |c_#memory_$Pointer$#1.offset| |c_list_add_#in~new#1.base| v_DerPreprocessor_5) |c_list_add_#in~head#1.base| v_DerPreprocessor_6) |c_list_add_#in~new#1.base|))) (and (= .cse2 .cse5) (<= |c_list_add_#in~new#1.offset| (select v_DerPreprocessor_6 .cse6)) (= |c_#memory_$Pointer$#1.base| (let ((.cse7 (store |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~new#1.base| (store (store (store .cse8 .cse6 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse9) .cse10 .cse11)))) (store .cse7 |c_list_add_#in~head#1.base| (store (select .cse7 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)))) (= .cse5 v_DerPreprocessor_5)))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_list_add___list_add_~next#1.offset_28| Int)) (let ((.cse12 (select (store (store |c_#memory_$Pointer$#1.offset| |c_list_add_#in~new#1.base| v_DerPreprocessor_5) |c_list_add_#in~head#1.base| v_DerPreprocessor_6) |c_list_add_#in~new#1.base|)) (.cse13 (+ |v_list_add___list_add_~next#1.offset_28| 4))) (and (= .cse2 .cse12) (<= |c_list_add_#in~new#1.offset| (select v_DerPreprocessor_6 .cse13)) (= .cse12 v_DerPreprocessor_5) (= |c_#memory_$Pointer$#1.base| (let ((.cse15 (store |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~head#1.base| (store .cse16 .cse13 |c_list_add_#in~new#1.base|)))) (let ((.cse14 (store (store (select .cse15 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse9) .cse10 .cse11))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~new#1.base| .cse14) |c_list_add_#in~head#1.base| (store (select (store .cse15 |c_list_add_#in~new#1.base| .cse14) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))))))))) (= .cse17 .cse18)) (and .cse19 (or (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_list_add___list_add_~next#1.offset_28| Int)) (let ((.cse20 (+ |v_list_add___list_add_~next#1.offset_28| 4))) (and (= (select v_DerPreprocessor_6 |c_list_add_#in~head#1.offset|) |c_list_add_#in~new#1.offset|) (<= |c_list_add_#in~new#1.offset| (select v_DerPreprocessor_6 .cse20)) (= |c_#memory_$Pointer$#1.base| (let ((.cse21 (store |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~new#1.base| (store (store (store .cse8 .cse20 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse9) .cse10 .cse11)))) (store .cse21 |c_list_add_#in~head#1.base| (store (select .cse21 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)))) (= (select (store (store |c_#memory_$Pointer$#1.offset| |c_list_add_#in~new#1.base| v_DerPreprocessor_5) |c_list_add_#in~head#1.base| v_DerPreprocessor_6) |c_list_add_#in~new#1.base|) v_DerPreprocessor_5)))) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (and (= (select v_DerPreprocessor_6 |c_list_add_#in~head#1.offset|) |c_list_add_#in~new#1.offset|) (= (select (store (store |c_#memory_$Pointer$#1.offset| |c_list_add_#in~new#1.base| v_DerPreprocessor_5) |c_list_add_#in~head#1.base| v_DerPreprocessor_6) |c_list_add_#in~new#1.base|) v_DerPreprocessor_5))) .cse4) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_list_add___list_add_~next#1.offset_28| Int)) (let ((.cse22 (+ |v_list_add___list_add_~next#1.offset_28| 4))) (and (= (select v_DerPreprocessor_6 |c_list_add_#in~head#1.offset|) |c_list_add_#in~new#1.offset|) (<= |c_list_add_#in~new#1.offset| (select v_DerPreprocessor_6 .cse22)) (= (select (store (store |c_#memory_$Pointer$#1.offset| |c_list_add_#in~new#1.base| v_DerPreprocessor_5) |c_list_add_#in~head#1.base| v_DerPreprocessor_6) |c_list_add_#in~new#1.base|) v_DerPreprocessor_5) (= |c_#memory_$Pointer$#1.base| (let ((.cse24 (store |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~head#1.base| (store .cse16 .cse22 |c_list_add_#in~new#1.base|)))) (let ((.cse23 (store (store (select .cse24 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse9) .cse10 .cse11))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~new#1.base| .cse23) |c_list_add_#in~head#1.base| (store (select (store .cse24 |c_list_add_#in~new#1.base| .cse23) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))))))))))) .cse25) (and (let ((.cse26 (exists ((|v_list_add___list_add_~next#1.offset_28| Int)) (= |c_#memory_$Pointer$#1.base| (let ((.cse34 (store |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~new#1.base| (store (store (store .cse8 (+ |v_list_add___list_add_~next#1.offset_28| 4) |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse9) .cse10 .cse11)))) (store .cse34 |c_list_add_#in~head#1.base| (store (select .cse34 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))))))) (or (and .cse26 .cse19) (and .cse19 .cse4) (and .cse26 .cse19 .cse27) (and .cse19 (exists ((|v_list_add___list_add_~next#1.offset_28| Int)) (let ((.cse28 (+ |v_list_add___list_add_~next#1.offset_28| 4))) (and (<= |c_list_add_#in~new#1.offset| (select .cse17 .cse28)) (= |c_#memory_$Pointer$#1.base| (let ((.cse30 (store |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~head#1.base| (store .cse16 .cse28 |c_list_add_#in~new#1.base|)))) (let ((.cse29 (store (store (select .cse30 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse9) .cse10 .cse11))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~new#1.base| .cse29) |c_list_add_#in~head#1.base| (store (select (store .cse30 |c_list_add_#in~new#1.base| .cse29) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))))))))) (and .cse19 (exists ((|v_list_add___list_add_~next#1.base_26| Int) (|v_list_add___list_add_~next#1.offset_28| Int)) (let ((.cse31 (+ |v_list_add___list_add_~next#1.offset_28| 4))) (and (<= |c_list_add_#in~new#1.offset| (select .cse18 .cse31)) (not (= |c_list_add_#in~head#1.base| |v_list_add___list_add_~next#1.base_26|)) (= (let ((.cse32 (let ((.cse33 (store |c_old(#memory_$Pointer$#1.base)| |v_list_add___list_add_~next#1.base_26| (store (select |c_old(#memory_$Pointer$#1.base)| |v_list_add___list_add_~next#1.base_26|) .cse31 |c_list_add_#in~new#1.base|)))) (store .cse33 |c_list_add_#in~new#1.base| (store (store (select .cse33 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse9) .cse10 .cse11))))) (store .cse32 |c_list_add_#in~head#1.base| (store (select .cse32 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))) |c_#memory_$Pointer$#1.base|) (= .cse18 (select |c_#memory_$Pointer$#1.offset| |v_list_add___list_add_~next#1.base_26|)))))))) .cse1))))) (and (or (exists ((|v_list_add___list_add_~next#1.offset_28| Int)) (= |c_#memory_$Pointer$#1.base| (let ((.cse38 (store |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~new#1.base| (store (store .cse8 (+ |v_list_add___list_add_~next#1.offset_28| 4) |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse9)))) (store .cse38 |c_list_add_#in~head#1.base| (store (select .cse38 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))))) (exists ((|v_list_add___list_add_~next#1.base_26| Int) (|v_list_add___list_add_~next#1.offset_28| Int)) (let ((.cse41 (+ |v_list_add___list_add_~next#1.offset_28| 4))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse39 (let ((.cse40 (store |c_old(#memory_$Pointer$#1.base)| |v_list_add___list_add_~next#1.base_26| (store (select |c_old(#memory_$Pointer$#1.base)| |v_list_add___list_add_~next#1.base_26|) .cse41 |c_list_add_#in~new#1.base|)))) (store .cse40 |c_list_add_#in~new#1.base| (store (select .cse40 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse9))))) (store .cse39 |c_list_add_#in~head#1.base| (store (select .cse39 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)))) (<= |c_list_add_#in~new#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |v_list_add___list_add_~next#1.base_26|) .cse41)))))) .cse27 .cse25 .cse0))) (or (not .cse43) .cse1))) (and (or (exists ((|v_list_add___list_add_~next#1.base_26| Int) (|v_list_add___list_add_~next#1.offset_28| Int)) (let ((.cse44 (+ |v_list_add___list_add_~next#1.offset_28| 4))) (and (<= |c_list_add_#in~new#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |v_list_add___list_add_~next#1.base_26|) .cse44)) (= (let ((.cse45 (let ((.cse46 (store |c_old(#memory_$Pointer$#1.base)| |v_list_add___list_add_~next#1.base_26| (store (select |c_old(#memory_$Pointer$#1.base)| |v_list_add___list_add_~next#1.base_26|) .cse44 |c_list_add_#in~new#1.base|)))) (store .cse46 |c_list_add_#in~new#1.base| (store (select .cse46 |c_list_add_#in~new#1.base|) .cse10 .cse11))))) (store .cse45 |c_list_add_#in~head#1.base| (store (select .cse45 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))) |c_#memory_$Pointer$#1.base|)))) (exists ((|v_list_add___list_add_~next#1.offset_28| Int)) (= |c_#memory_$Pointer$#1.base| (let ((.cse47 (store |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~new#1.base| (store (store .cse8 (+ |v_list_add___list_add_~next#1.offset_28| 4) |c_list_add_#in~new#1.base|) .cse10 .cse11)))) (store .cse47 |c_list_add_#in~head#1.base| (store (select .cse47 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)))))) .cse27 .cse43 .cse25)))) (= |c_~#gl_list~0.offset| 0) (= 3 |c_~#gl_list~0.base|)) is different from false [2024-11-27 19:52:02,636 INFO L349 Elim1Store]: treesize reduction 499, result has 6.7 percent of original size [2024-11-27 19:52:02,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 11 new quantified variables, introduced 19 case distinctions, treesize of input 479 treesize of output 603 [2024-11-27 19:52:02,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:03,129 INFO L224 Elim1Store]: Index analysis took 352 ms [2024-11-27 19:52:08,706 WARN L286 SmtUtils]: Spent 5.53s on a formula simplification. DAG size of input: 108 DAG size of output: 40 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 19:52:08,706 INFO L349 Elim1Store]: treesize reduction 329, result has 22.4 percent of original size [2024-11-27 19:52:08,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 9 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 432 treesize of output 1062 [2024-11-27 19:52:31,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:31,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:31,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:31,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:31,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:31,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:31,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 373 treesize of output 466 [2024-11-27 19:52:31,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:31,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:31,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:31,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:31,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:31,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:31,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 264 treesize of output 360 [2024-11-27 19:52:31,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:31,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:31,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:31,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 47 [2024-11-27 19:52:31,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 18 [2024-11-27 19:52:31,598 INFO L349 Elim1Store]: treesize reduction 40, result has 28.6 percent of original size [2024-11-27 19:52:31,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 24 treesize of output 16 [2024-11-27 19:52:31,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:31,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:31,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:31,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:31,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:31,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:31,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 261 treesize of output 352 [2024-11-27 19:52:31,662 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-27 19:52:31,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 239 treesize of output 213 [2024-11-27 19:52:31,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:31,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:31,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:31,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:31,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:31,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:31,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 264 treesize of output 360 [2024-11-27 19:52:31,756 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-27 19:52:31,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 239 treesize of output 213 [2024-11-27 19:52:34,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:34,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:35,850 INFO L349 Elim1Store]: treesize reduction 267, result has 18.3 percent of original size [2024-11-27 19:52:35,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 13 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 740 treesize of output 1639 [2024-11-27 19:52:36,420 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:52:36,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:36,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:36,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:36,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:36,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:36,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:36,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:37,084 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:52:37,085 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:52:37,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:37,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:37,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:37,342 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:52:37,342 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:52:37,371 INFO L224 Elim1Store]: Index analysis took 1213 ms [2024-11-27 19:52:37,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 369 treesize of output 560 [2024-11-27 19:52:37,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:37,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:37,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 260 treesize of output 252 [2024-11-27 19:52:38,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:38,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:38,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:38,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:38,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:38,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:38,093 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:52:38,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 13 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 1017 treesize of output 2233 [2024-11-27 19:52:39,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:40,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 319 treesize of output 484 [2024-11-27 19:52:40,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:40,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:40,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 168 [2024-11-27 19:52:40,357 INFO L349 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2024-11-27 19:52:40,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 79 [2024-11-27 19:52:40,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:40,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:40,432 INFO L190 IndexEqualityManager]: detected not equals via solver