./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd --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 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:30:00,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:30:00,354 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 15:30:00,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:30:00,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:30:00,402 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:30:00,403 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:30:00,403 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:30:00,404 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:30:00,404 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:30:00,405 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:30:00,406 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:30:00,406 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:30:00,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:30:00,407 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:30:00,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:30:00,407 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:30:00,407 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:30:00,408 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:30:00,408 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:30:00,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:30:00,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:30:00,408 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:30:00,408 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:30:00,408 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:30:00,408 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:30:00,409 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:30:00,409 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:30:00,409 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:30:00,409 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:30:00,409 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:30:00,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:30:00,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:30:00,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:30:00,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:30:00,410 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:30:00,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:30:00,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:30:00,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:30:00,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:30:00,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:30:00,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:30:00,412 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_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd 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 -> 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 [2024-11-13 15:30:00,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:30:00,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:30:00,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:30:00,762 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:30:00,763 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:30:00,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i Unable to find full path for "g++" [2024-11-13 15:30:02,641 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:30:03,044 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:30:03,045 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2024-11-13 15:30:03,063 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/data/b9ecbae78/8958d897a3c04ee38dd53e4b9c345c76/FLAG5f4536e69 [2024-11-13 15:30:03,085 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/data/b9ecbae78/8958d897a3c04ee38dd53e4b9c345c76 [2024-11-13 15:30:03,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:30:03,089 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:30:03,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:30:03,092 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:30:03,096 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:30:03,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:30:03" (1/1) ... [2024-11-13 15:30:03,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fec2b73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:03, skipping insertion in model container [2024-11-13 15:30:03,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:30:03" (1/1) ... [2024-11-13 15:30:03,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:30:03,511 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_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i[24361,24374] [2024-11-13 15:30:03,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:30:03,527 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:30:03,569 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_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i[24361,24374] [2024-11-13 15:30:03,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:30:03,595 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:30:03,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:03 WrapperNode [2024-11-13 15:30:03,596 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:30:03,597 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:30:03,597 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:30:03,597 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:30:03,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:03" (1/1) ... [2024-11-13 15:30:03,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:03" (1/1) ... [2024-11-13 15:30:03,647 INFO L138 Inliner]: procedures = 127, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 113 [2024-11-13 15:30:03,651 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:30:03,652 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:30:03,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:30:03,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:30:03,663 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:03" (1/1) ... [2024-11-13 15:30:03,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:03" (1/1) ... [2024-11-13 15:30:03,668 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:03" (1/1) ... [2024-11-13 15:30:03,703 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 7, 12]. 57 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 10 writes are split as follows [0, 1, 9]. [2024-11-13 15:30:03,704 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:03" (1/1) ... [2024-11-13 15:30:03,704 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:03" (1/1) ... [2024-11-13 15:30:03,717 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:03" (1/1) ... [2024-11-13 15:30:03,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:03" (1/1) ... [2024-11-13 15:30:03,727 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:03" (1/1) ... [2024-11-13 15:30:03,732 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:03" (1/1) ... [2024-11-13 15:30:03,734 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:30:03,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:30:03,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:30:03,739 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:30:03,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:03" (1/1) ... [2024-11-13 15:30:03,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:30:03,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:30:03,774 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:30:03,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:30:03,806 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-13 15:30:03,806 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-13 15:30:03,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 15:30:03,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 15:30:03,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 15:30:03,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 15:30:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 15:30:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 15:30:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 15:30:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:30:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 15:30:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 15:30:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 15:30:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 15:30:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 15:30:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 15:30:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 15:30:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 15:30:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-13 15:30:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-13 15:30:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-13 15:30:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:30:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 15:30:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 15:30:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:30:03,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:30:03,989 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:30:03,991 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:30:04,016 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-13 15:30:04,188 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-11-13 15:30:04,188 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:30:04,197 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:30:04,197 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-13 15:30:04,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:30:04 BoogieIcfgContainer [2024-11-13 15:30:04,198 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:30:04,200 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:30:04,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:30:04,205 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:30:04,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:30:03" (1/3) ... [2024-11-13 15:30:04,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac4b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:30:04, skipping insertion in model container [2024-11-13 15:30:04,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:30:03" (2/3) ... [2024-11-13 15:30:04,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac4b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:30:04, skipping insertion in model container [2024-11-13 15:30:04,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:30:04" (3/3) ... [2024-11-13 15:30:04,208 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_equal.i [2024-11-13 15:30:04,226 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:30:04,227 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_prepend_equal.i that has 2 procedures, 30 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2024-11-13 15:30:04,289 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:30:04,301 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;@c75bf25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:30:04,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:30:04,305 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 25 states have (on average 1.52) internal successors, (38), 27 states have internal predecessors, (38), 2 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-13 15:30:04,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 15:30:04,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:30:04,314 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:30:04,315 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:30:04,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:30:04,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1704775824, now seen corresponding path program 1 times [2024-11-13 15:30:04,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:30:04,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881754560] [2024-11-13 15:30:04,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:04,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:30:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:04,569 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-13 15:30:04,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:30:04,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881754560] [2024-11-13 15:30:04,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881754560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:30:04,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:30:04,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:30:04,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723752813] [2024-11-13 15:30:04,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:30:04,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:30:04,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:30:04,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:30:04,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:30:04,629 INFO L87 Difference]: Start difference. First operand has 29 states, 25 states have (on average 1.52) internal successors, (38), 27 states have internal predecessors, (38), 2 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) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:30:04,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:30:04,643 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2024-11-13 15:30:04,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:30:04,645 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-13 15:30:04,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:30:04,650 INFO L225 Difference]: With dead ends: 50 [2024-11-13 15:30:04,650 INFO L226 Difference]: Without dead ends: 20 [2024-11-13 15:30:04,653 INFO L431 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-13 15:30:04,656 INFO L432 NwaCegarLoop]: 36 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, 36 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-13 15:30:04,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:30:04,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-13 15:30:04,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-13 15:30:04,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:30:04,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-11-13 15:30:04,684 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2024-11-13 15:30:04,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:30:04,685 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-13 15:30:04,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:30:04,685 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-11-13 15:30:04,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 15:30:04,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:30:04,686 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:30:04,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:30:04,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:30:04,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:30:04,689 INFO L85 PathProgramCache]: Analyzing trace with hash -747804486, now seen corresponding path program 1 times [2024-11-13 15:30:04,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:30:04,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863425444] [2024-11-13 15:30:04,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:04,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:30:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:04,958 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-13 15:30:04,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:30:04,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863425444] [2024-11-13 15:30:04,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863425444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:30:04,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:30:04,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:30:04,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559339071] [2024-11-13 15:30:04,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:30:04,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:30:04,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:30:04,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:30:04,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:30:04,962 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:30:04,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:30:04,979 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2024-11-13 15:30:04,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:30:04,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-13 15:30:04,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:30:04,980 INFO L225 Difference]: With dead ends: 38 [2024-11-13 15:30:04,980 INFO L226 Difference]: Without dead ends: 25 [2024-11-13 15:30:04,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:30:04,981 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:30:04,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 41 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:30:04,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-13 15:30:04,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2024-11-13 15:30:04,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:30:04,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-11-13 15:30:04,986 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2024-11-13 15:30:04,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:30:04,987 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-11-13 15:30:04,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:30:04,987 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-11-13 15:30:04,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 15:30:04,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:30:04,988 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:30:04,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:30:04,988 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:30:04,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:30:04,989 INFO L85 PathProgramCache]: Analyzing trace with hash 136170825, now seen corresponding path program 1 times [2024-11-13 15:30:04,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:30:04,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780792777] [2024-11-13 15:30:04,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:04,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:30:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:05,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:30:05,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:30:05,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780792777] [2024-11-13 15:30:05,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780792777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:30:05,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:30:05,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:30:05,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728439783] [2024-11-13 15:30:05,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:30:05,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:30:05,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:30:05,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:30:05,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:30:05,151 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:30:05,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:30:05,195 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-11-13 15:30:05,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:30:05,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-13 15:30:05,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:30:05,197 INFO L225 Difference]: With dead ends: 42 [2024-11-13 15:30:05,197 INFO L226 Difference]: Without dead ends: 24 [2024-11-13 15:30:05,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:30:05,199 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:30:05,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:30:05,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-13 15:30:05,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-13 15:30:05,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:30:05,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-11-13 15:30:05,206 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 19 [2024-11-13 15:30:05,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:30:05,206 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-13 15:30:05,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:30:05,208 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-11-13 15:30:05,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 15:30:05,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:30:05,209 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:30:05,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:30:05,210 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:30:05,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:30:05,211 INFO L85 PathProgramCache]: Analyzing trace with hash -874946425, now seen corresponding path program 1 times [2024-11-13 15:30:05,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:30:05,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706117319] [2024-11-13 15:30:05,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:05,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:30:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:05,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:30:05,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:30:05,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706117319] [2024-11-13 15:30:05,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706117319] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:30:05,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449452004] [2024-11-13 15:30:05,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:05,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:30:05,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:30:05,449 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:30:05,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:30:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:05,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 15:30:05,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:30:05,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:30:05,703 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:30:05,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:30:05,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449452004] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:30:05,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:30:05,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-13 15:30:05,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962072077] [2024-11-13 15:30:05,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:30:05,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:30:05,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:30:05,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:30:05,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:30:05,758 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:30:05,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:30:05,786 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2024-11-13 15:30:05,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:30:05,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-13 15:30:05,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:30:05,789 INFO L225 Difference]: With dead ends: 39 [2024-11-13 15:30:05,789 INFO L226 Difference]: Without dead ends: 26 [2024-11-13 15:30:05,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:30:05,790 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:30:05,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 56 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:30:05,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-13 15:30:05,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-13 15:30:05,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:30:05,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-11-13 15:30:05,798 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2024-11-13 15:30:05,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:30:05,799 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-13 15:30:05,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:30:05,799 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-11-13 15:30:05,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 15:30:05,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:30:05,801 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:30:05,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-13 15:30:06,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-13 15:30:06,006 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:30:06,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:30:06,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1969597852, now seen corresponding path program 1 times [2024-11-13 15:30:06,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:30:06,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287616936] [2024-11-13 15:30:06,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:06,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:30:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 15:30:06,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:30:06,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287616936] [2024-11-13 15:30:06,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287616936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:30:06,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:30:06,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:30:06,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831401190] [2024-11-13 15:30:06,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:30:06,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:30:06,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:30:06,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:30:06,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:30:06,560 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:30:06,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:30:06,654 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-11-13 15:30:06,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:30:06,656 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-13 15:30:06,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:30:06,656 INFO L225 Difference]: With dead ends: 30 [2024-11-13 15:30:06,656 INFO L226 Difference]: Without dead ends: 27 [2024-11-13 15:30:06,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:30:06,658 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:30:06,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 85 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:30:06,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-13 15:30:06,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-13 15:30:06,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:30:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-11-13 15:30:06,666 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 24 [2024-11-13 15:30:06,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:30:06,666 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-13 15:30:06,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:30:06,667 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-11-13 15:30:06,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 15:30:06,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:30:06,667 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:30:06,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 15:30:06,668 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:30:06,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:30:06,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1969599526, now seen corresponding path program 1 times [2024-11-13 15:30:06,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:30:06,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142075985] [2024-11-13 15:30:06,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:06,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:30:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:30:08,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:30:08,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142075985] [2024-11-13 15:30:08,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142075985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:30:08,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:30:08,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 15:30:08,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682736730] [2024-11-13 15:30:08,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:30:08,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:30:08,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:30:08,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:30:08,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:30:08,032 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:30:08,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:30:08,314 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2024-11-13 15:30:08,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:30:08,314 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-13 15:30:08,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:30:08,315 INFO L225 Difference]: With dead ends: 32 [2024-11-13 15:30:08,315 INFO L226 Difference]: Without dead ends: 30 [2024-11-13 15:30:08,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:30:08,316 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:30:08,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 68 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:30:08,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-13 15:30:08,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-11-13 15:30:08,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:30:08,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-13 15:30:08,320 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 24 [2024-11-13 15:30:08,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:30:08,320 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-13 15:30:08,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:30:08,321 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-13 15:30:08,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 15:30:08,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:30:08,321 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:30:08,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 15:30:08,321 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:30:08,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:30:08,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1295398953, now seen corresponding path program 1 times [2024-11-13 15:30:08,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:30:08,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532066777] [2024-11-13 15:30:08,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:08,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:30:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:09,309 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:30:09,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:30:09,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532066777] [2024-11-13 15:30:09,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532066777] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:30:09,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782464510] [2024-11-13 15:30:09,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:09,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:30:09,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:30:09,315 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:30:09,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 15:30:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:09,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-13 15:30:09,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:30:09,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 15:30:09,777 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-13 15:30:09,777 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 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-13 15:30:09,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-13 15:30:10,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:30:10,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2024-11-13 15:30:10,080 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 0 case distinctions, treesize of input 51 treesize of output 24 [2024-11-13 15:30:10,091 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 15:30:10,141 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 36 treesize of output 20 [2024-11-13 15:30:10,186 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 24 treesize of output 12 [2024-11-13 15:30:10,195 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:30:10,195 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:30:10,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:30:10,450 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 1 case distinctions, treesize of input 55 treesize of output 56 [2024-11-13 15:30:10,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:30:10,468 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 111 treesize of output 110 [2024-11-13 15:30:10,481 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 66 treesize of output 50 [2024-11-13 15:30:10,772 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 26 treesize of output 14 [2024-11-13 15:30:10,775 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-13 15:30:11,022 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:30:11,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782464510] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:30:11,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:30:11,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 29 [2024-11-13 15:30:11,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333376483] [2024-11-13 15:30:11,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:30:11,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-13 15:30:11,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:30:11,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-13 15:30:11,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=727, Unknown=4, NotChecked=0, Total=812 [2024-11-13 15:30:11,024 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 29 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 29 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:30:11,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:30:11,636 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2024-11-13 15:30:11,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 15:30:11,637 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 29 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-13 15:30:11,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:30:11,637 INFO L225 Difference]: With dead ends: 49 [2024-11-13 15:30:11,637 INFO L226 Difference]: Without dead ends: 29 [2024-11-13 15:30:11,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=943, Unknown=4, NotChecked=0, Total=1056 [2024-11-13 15:30:11,639 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 28 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:30:11,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 155 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:30:11,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-13 15:30:11,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-13 15:30:11,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:30:11,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2024-11-13 15:30:11,650 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 26 [2024-11-13 15:30:11,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:30:11,651 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-11-13 15:30:11,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 29 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:30:11,651 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2024-11-13 15:30:11,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 15:30:11,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:30:11,652 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:30:11,674 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 15:30:11,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-13 15:30:11,853 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:30:11,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:30:11,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1295397279, now seen corresponding path program 1 times [2024-11-13 15:30:11,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:30:11,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483622928] [2024-11-13 15:30:11,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:11,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:30:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:13,574 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:30:13,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:30:13,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483622928] [2024-11-13 15:30:13,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483622928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:30:13,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819238635] [2024-11-13 15:30:13,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:13,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:30:13,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:30:13,577 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:30:13,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 15:30:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:13,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-13 15:30:13,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:30:13,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 15:30:13,980 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 15:30:13,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 15:30:14,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-13 15:30:14,147 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-13 15:30:14,435 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-13 15:30:14,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-13 15:30:14,540 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 20 treesize of output 15 [2024-11-13 15:30:14,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-13 15:30:14,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-13 15:30:14,640 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 20 treesize of output 15 [2024-11-13 15:30:14,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:30:14,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2024-11-13 15:30:14,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:30:14,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2024-11-13 15:30:14,810 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:30:14,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:30:14,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 15 [2024-11-13 15:30:14,841 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 0 case distinctions, treesize of input 54 treesize of output 27 [2024-11-13 15:30:14,851 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 15:30:14,921 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 50 treesize of output 30 [2024-11-13 15:30:14,989 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 27 treesize of output 15 [2024-11-13 15:30:14,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 15:30:15,125 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:30:15,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:30:15,423 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_716 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (or (not (= v_ArrVal_716 (let ((.cse1 (+ (select .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 8))) (store (select |c_#memory_int#2| .cse0) .cse1 (select v_ArrVal_716 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#2| .cse0 v_ArrVal_716) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_714) .cse3) .cse4)) (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_715) .cse3) .cse4)))))))) is different from false [2024-11-13 15:30:15,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:30:15,448 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 1 case distinctions, treesize of input 119 treesize of output 120 [2024-11-13 15:30:15,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:30:15,471 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 238 treesize of output 237 [2024-11-13 15:30:15,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:30:15,485 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 1 case distinctions, treesize of input 194 treesize of output 180 [2024-11-13 15:30:15,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:30:15,510 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 332 treesize of output 301 [2024-11-13 15:30:15,521 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 69 treesize of output 53 [2024-11-13 15:30:15,531 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 53 treesize of output 37 [2024-11-13 15:30:20,134 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse29 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse25 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse16 (select .cse25 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse15 (select .cse29 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse19 (= .cse15 .cse5)) (.cse18 (+ .cse16 8))) (let ((.cse4 (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_arrayElimCell_34 Int) (v_arrayElimCell_33 Int)) (or (not (= v_ArrVal_716 (store (select |c_#memory_int#2| .cse15) .cse18 (select v_ArrVal_716 .cse18)))) (= (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_711) .cse15 v_ArrVal_716) v_arrayElimCell_33) v_arrayElimCell_34) |c_ULTIMATE.start_main_~data~0#1|)))) (.cse9 (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_arrayElimCell_34 Int) (v_arrayElimCell_33 Int)) (let ((.cse30 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_711))) (or (not (= v_ArrVal_716 (store (select .cse30 .cse15) .cse18 (select v_ArrVal_716 .cse18)))) (= (select (select (store .cse30 .cse15 v_ArrVal_716) v_arrayElimCell_33) v_arrayElimCell_34) |c_ULTIMATE.start_main_~data~0#1|))))) (.cse3 (not .cse19)) (.cse24 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse29 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (= .cse15 .cse24)) (.cse1 (or .cse9 .cse3)) (.cse12 (or .cse19 (forall ((v_ArrVal_711 (Array Int Int)) (v_arrayElimCell_30 Int) (v_ArrVal_716 (Array Int Int))) (let ((.cse28 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_711))) (or (not (= v_ArrVal_716 (store (select .cse28 .cse15) .cse18 (select v_ArrVal_716 .cse18)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse28 .cse15 v_ArrVal_716) v_arrayElimCell_30) .cse16))))))) (.cse13 (forall ((v_ArrVal_711 (Array Int Int)) (v_arrayElimCell_30 Int) (v_ArrVal_716 (Array Int Int)) (v_arrayElimCell_34 Int) (v_arrayElimCell_33 Int)) (let ((.cse26 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_711))) (let ((.cse27 (store .cse26 .cse15 v_ArrVal_716))) (or (not (= v_ArrVal_716 (store (select .cse26 .cse15) .cse18 (select v_ArrVal_716 .cse18)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse27 v_arrayElimCell_30) .cse16)) (= (select (select .cse27 v_arrayElimCell_33) v_arrayElimCell_34) |c_ULTIMATE.start_main_~data~0#1|)))))) (.cse0 (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse25 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_#res#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_node_create_#res#1.offset|)) (.cse14 (= |c_ULTIMATE.start_node_create_#res#1.base| .cse24)) (.cse11 (or .cse3 .cse4)) (.cse2 (forall ((v_ArrVal_711 (Array Int Int)) (v_arrayElimCell_30 Int) (v_ArrVal_716 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_34 Int) (v_arrayElimCell_33 Int)) (let ((.cse22 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_711))) (let ((.cse23 (store .cse22 .cse15 v_ArrVal_716))) (or (not (= v_ArrVal_716 (store (select .cse22 .cse15) .cse18 (select v_ArrVal_716 .cse18)))) (= (select (select .cse23 v_arrayElimCell_33) v_arrayElimCell_34) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse23 v_arrayElimCell_30) v_arrayElimCell_32))))))) (.cse6 (or .cse19 (forall ((v_ArrVal_711 (Array Int Int)) (v_arrayElimCell_32 Int) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_711) .cse15) .cse18 v_DerPreprocessor_1) v_arrayElimCell_32))))) (.cse7 (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_34 Int) (v_arrayElimCell_33 Int)) (let ((.cse21 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_711))) (or (not (= v_ArrVal_716 (store (select .cse21 .cse15) .cse18 (select v_ArrVal_716 .cse18)))) (= (select (select (store .cse21 .cse15 v_ArrVal_716) v_arrayElimCell_33) v_arrayElimCell_34) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_716 v_arrayElimCell_32)))))) (.cse8 (or .cse19 (forall ((v_ArrVal_711 (Array Int Int)) (v_arrayElimCell_30 Int) (v_ArrVal_716 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse20 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_711))) (or (not (= v_ArrVal_716 (store (select .cse20 .cse15) .cse18 (select v_ArrVal_716 .cse18)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse20 .cse15 v_ArrVal_716) v_arrayElimCell_30) v_arrayElimCell_32)))))))) (and (or .cse0 (and .cse1 .cse2 (or .cse3 .cse4 (= |c_ULTIMATE.start_node_create_#res#1.base| .cse5)) .cse6 .cse7 .cse8)) (or .cse9 (not .cse10)) (or (and .cse11 .cse12 .cse13) .cse14) (or .cse10 (forall ((v_ArrVal_711 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_711) .cse15) .cse16)))) (or (and .cse1 .cse12 .cse13) .cse0) (or .cse14 (and .cse11 (or .cse3 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_node_create_#res#1.offset|) .cse4) .cse2 .cse6 .cse7 .cse8)) (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_arrayElimCell_34 Int) (v_arrayElimCell_33 Int)) (let ((.cse17 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_711))) (or (not (= v_ArrVal_716 (store (select .cse17 .cse15) .cse18 (select v_ArrVal_716 .cse18)))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_716 .cse16)) (= (select (select (store .cse17 .cse15 v_ArrVal_716) v_arrayElimCell_33) v_arrayElimCell_34) |c_ULTIMATE.start_main_~data~0#1|)))))))))) is different from false [2024-11-13 15:30:20,583 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse30 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse28 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse2 (select .cse28 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse1 (select .cse30 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse20 (= .cse1 .cse10)) (.cse15 (+ .cse2 8))) (let ((.cse11 (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_arrayElimCell_34 Int) (v_arrayElimCell_33 Int)) (or (not (= v_ArrVal_716 (store (select |c_#memory_int#2| .cse1) .cse15 (select v_ArrVal_716 .cse15)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_711) .cse1 v_ArrVal_716) v_arrayElimCell_33) v_arrayElimCell_34))))) (.cse19 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse30 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_arrayElimCell_34 Int) (v_arrayElimCell_33 Int)) (let ((.cse29 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_711))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse29 .cse1 v_ArrVal_716) v_arrayElimCell_33) v_arrayElimCell_34)) (not (= v_ArrVal_716 (store (select .cse29 .cse1) .cse15 (select v_ArrVal_716 .cse15)))))))) (.cse12 (not .cse20))) (let ((.cse3 (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse28 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse4 (or .cse18 .cse12)) (.cse5 (forall ((v_ArrVal_711 (Array Int Int)) (v_arrayElimCell_30 Int) (v_ArrVal_716 (Array Int Int)) (v_arrayElimCell_34 Int) (v_arrayElimCell_33 Int)) (let ((.cse27 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_711))) (let ((.cse26 (store .cse27 .cse1 v_ArrVal_716))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse26 v_arrayElimCell_33) v_arrayElimCell_34)) (not (= v_ArrVal_716 (store (select .cse27 .cse1) .cse15 (select v_ArrVal_716 .cse15)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse26 v_arrayElimCell_30) .cse2))))))) (.cse6 (or .cse20 (forall ((v_ArrVal_711 (Array Int Int)) (v_arrayElimCell_30 Int) (v_ArrVal_716 (Array Int Int))) (let ((.cse25 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_711))) (or (not (= v_ArrVal_716 (store (select .cse25 .cse1) .cse15 (select v_ArrVal_716 .cse15)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse25 .cse1 v_ArrVal_716) v_arrayElimCell_30) .cse2))))))) (.cse0 (= .cse1 .cse19)) (.cse16 (or .cse11 .cse12)) (.cse7 (forall ((v_ArrVal_711 (Array Int Int)) (v_arrayElimCell_30 Int) (v_ArrVal_716 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_34 Int) (v_arrayElimCell_33 Int)) (let ((.cse24 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_711))) (let ((.cse23 (store .cse24 .cse1 v_ArrVal_716))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse23 v_arrayElimCell_33) v_arrayElimCell_34)) (not (= v_ArrVal_716 (store (select .cse24 .cse1) .cse15 (select v_ArrVal_716 .cse15)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse23 v_arrayElimCell_30) v_arrayElimCell_32))))))) (.cse8 (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_34 Int) (v_arrayElimCell_33 Int)) (let ((.cse22 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_711))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse22 .cse1 v_ArrVal_716) v_arrayElimCell_33) v_arrayElimCell_34)) (not (= v_ArrVal_716 (store (select .cse22 .cse1) .cse15 (select v_ArrVal_716 .cse15)))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_716 v_arrayElimCell_32)))))) (.cse9 (or .cse20 (forall ((v_ArrVal_711 (Array Int Int)) (v_arrayElimCell_30 Int) (v_ArrVal_716 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse21 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_711))) (or (not (= v_ArrVal_716 (store (select .cse21 .cse1) .cse15 (select v_ArrVal_716 .cse15)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse21 .cse1 v_ArrVal_716) v_arrayElimCell_30) v_arrayElimCell_32))))))) (.cse13 (or .cse20 (forall ((v_ArrVal_711 (Array Int Int)) (v_arrayElimCell_32 Int) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_711) .cse1) .cse15 v_DerPreprocessor_1) v_arrayElimCell_32))))) (.cse17 (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse19))) (and (or .cse0 (forall ((v_ArrVal_711 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_711) .cse1) .cse2)))) (or .cse3 (and .cse4 .cse5 .cse6)) (or .cse3 (and .cse4 .cse7 .cse8 .cse9 (or (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse10) .cse11 .cse12) .cse13)) (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_arrayElimCell_34 Int) (v_arrayElimCell_33 Int)) (let ((.cse14 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_711))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_716 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse14 .cse1 v_ArrVal_716) v_arrayElimCell_33) v_arrayElimCell_34)) (not (= v_ArrVal_716 (store (select .cse14 .cse1) .cse15 (select v_ArrVal_716 .cse15))))))) (or (and .cse16 .cse5 .cse6) .cse17) (or (not .cse0) .cse18) (or (and .cse16 .cse7 .cse8 .cse9 .cse13 (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_node_create_~temp~0#1.offset|) .cse11 .cse12)) .cse17))))))) is different from false [2024-11-13 15:30:21,037 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 149 treesize of output 117 [2024-11-13 15:30:21,042 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 121 treesize of output 93 [2024-11-13 15:30:21,098 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 13 treesize of output 1 [2024-11-13 15:30:25,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:30:25,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 777 treesize of output 789 [2024-11-13 15:30:25,901 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2024-11-13 15:30:25,902 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 2 case distinctions, treesize of input 289 treesize of output 293 [2024-11-13 15:30:25,946 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2024-11-13 15:30:25,946 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 2 case distinctions, treesize of input 267 treesize of output 282 [2024-11-13 15:30:25,999 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 262 treesize of output 258 [2024-11-13 15:30:26,027 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 258 treesize of output 256 [2024-11-13 15:30:26,047 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 256 treesize of output 254 [2024-11-13 15:30:28,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:30:28,082 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 25 treesize of output 6 [2024-11-13 15:30:33,470 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 12 treesize of output 8 [2024-11-13 15:30:33,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:30:33,517 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 210 treesize of output 208 [2024-11-13 15:30:34,069 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 12 treesize of output 8 [2024-11-13 15:30:34,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:30:34,122 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 341 treesize of output 341 [2024-11-13 15:30:35,263 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 12 treesize of output 8 [2024-11-13 15:30:35,307 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 12 treesize of output 8 [2024-11-13 15:30:35,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:30:35,428 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 307 treesize of output 307 [2024-11-13 15:30:36,515 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 12 treesize of output 8 [2024-11-13 15:30:36,541 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 12 treesize of output 8 [2024-11-13 15:30:36,633 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 12 treesize of output 8 [2024-11-13 15:30:36,660 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 12 treesize of output 8 [2024-11-13 15:30:36,859 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 12 treesize of output 8 [2024-11-13 15:30:37,070 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 12 treesize of output 8 [2024-11-13 15:30:37,135 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 12 treesize of output 8 [2024-11-13 15:30:37,243 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 12 treesize of output 8 [2024-11-13 15:30:37,472 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 12 treesize of output 8 [2024-11-13 15:30:38,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:30:38,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 162 [2024-11-13 15:30:38,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:30:38,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 189 treesize of output 185 [2024-11-13 15:30:39,143 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 18 treesize of output 12 [2024-11-13 15:30:39,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:30:39,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 107 [2024-11-13 15:30:39,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:30:39,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 33 [2024-11-13 15:30:39,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:30:39,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 33 [2024-11-13 15:30:40,274 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 12 treesize of output 8 [2024-11-13 15:30:40,294 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 12 treesize of output 8 [2024-11-13 15:30:40,412 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 12 treesize of output 8 [2024-11-13 15:30:40,432 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 12 treesize of output 8 [2024-11-13 15:30:40,466 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:30:40,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 147 [2024-11-13 15:30:41,011 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:30:41,012 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 24 treesize of output 16 [2024-11-13 15:30:41,056 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:30:41,056 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 18 treesize of output 12 [2024-11-13 15:30:41,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-13 15:30:41,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-13 15:30:41,152 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:30:41,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 147 [2024-11-13 15:30:41,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-13 15:30:41,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:30:41,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 155 treesize of output 161 [2024-11-13 15:30:42,550 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 12 treesize of output 8 [2024-11-13 15:30:42,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:30:42,705 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 3672 treesize of output 3460 [2024-11-13 15:31:16,236 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-13 15:31:16,264 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-13 15:31:16,285 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-13 15:31:16,309 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-13 15:31:16,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-13 15:31:16,417 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-13 15:31:16,442 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-13 15:31:16,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2024-11-13 15:31:16,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-13 15:31:16,571 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:31:16,572 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:31:16,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-13 15:31:16,578 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:31:16,580 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:31:16,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2024-11-13 15:31:16,604 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:31:16,606 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:31:16,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-13 15:31:16,623 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:31:16,625 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:31:16,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2024-11-13 15:31:16,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:31:16,642 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 579 treesize of output 576 [2024-11-13 15:31:16,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-13 15:31:16,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:31:16,752 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 177 treesize of output 180 [2024-11-13 15:31:16,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-13 15:31:16,852 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:31:16,853 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:31:16,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2024-11-13 15:31:16,863 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:31:16,864 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:31:16,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-13 15:31:16,878 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:31:16,879 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:31:16,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2024-11-13 15:31:16,886 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:31:16,887 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:31:16,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-13 15:31:16,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:31:16,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 269 treesize of output 310 [2024-11-13 15:31:20,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:31:20,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 314 treesize of output 385 [2024-11-13 15:31:25,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-13 15:31:25,608 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:31:25,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2024-11-13 15:31:25,622 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:31:25,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2024-11-13 15:31:25,635 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:31:25,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2024-11-13 15:31:25,654 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:31:25,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 109 [2024-11-13 15:31:25,663 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:31:25,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 109 [2024-11-13 15:31:25,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:31:25,703 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 1278 treesize of output 1277 [2024-11-13 15:31:25,938 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:31:25,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2024-11-13 15:31:25,948 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:31:25,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2024-11-13 15:31:25,972 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 479 treesize of output 469 [2024-11-13 15:31:25,987 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 258 treesize of output 254 [2024-11-13 15:31:26,009 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 120 treesize of output 118 [2024-11-13 15:31:26,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-13 15:31:26,030 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 251 treesize of output 245 [2024-11-13 15:31:26,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:31:26,058 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 433 treesize of output 446 [2024-11-13 15:31:26,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-13 15:31:26,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-13 15:31:26,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-13 15:31:26,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-13 15:31:26,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-13 15:31:26,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 15:31:26,303 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-13 15:31:26,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:31:26,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 6512 treesize of output 6639 [2024-11-13 15:31:28,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:31:28,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 694 treesize of output 1199 [2024-11-13 15:43:45,384 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-13 15:43:45,384 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-13 15:43:45,385 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-13 15:43:45,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 15:43:45,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:43:45,587 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:584) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 61 more [2024-11-13 15:43:45,593 INFO L158 Benchmark]: Toolchain (without parser) took 822503.31ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 93.9MB in the beginning and 347.2MB in the end (delta: -253.2MB). Peak memory consumption was 467.2MB. Max. memory is 16.1GB. [2024-11-13 15:43:45,594 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 142.6MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:43:45,594 INFO L158 Benchmark]: CACSL2BoogieTranslator took 504.86ms. Allocated memory is still 117.4MB. Free memory was 93.6MB in the beginning and 75.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 15:43:45,594 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.70ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 74.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:43:45,595 INFO L158 Benchmark]: Boogie Preprocessor took 86.42ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 71.6MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:43:45,595 INFO L158 Benchmark]: RCFGBuilder took 458.86ms. Allocated memory is still 117.4MB. Free memory was 71.6MB in the beginning and 55.5MB in the end (delta: 16.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:43:45,595 INFO L158 Benchmark]: TraceAbstraction took 821391.25ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 54.8MB in the beginning and 347.2MB in the end (delta: -292.3MB). Peak memory consumption was 433.6MB. Max. memory is 16.1GB. [2024-11-13 15:43:45,596 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 142.6MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 504.86ms. Allocated memory is still 117.4MB. Free memory was 93.6MB in the beginning and 75.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.70ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 74.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 86.42ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 71.6MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 458.86ms. Allocated memory is still 117.4MB. Free memory was 71.6MB in the beginning and 55.5MB in the end (delta: 16.1MB). There was no memory consumed. Max. memory is 16.1GB. * TraceAbstraction took 821391.25ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 54.8MB in the beginning and 347.2MB in the end (delta: -292.3MB). Peak memory consumption was 433.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd --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 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:43:48,300 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:43:48,436 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 15:43:48,448 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:43:48,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:43:48,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:43:48,483 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:43:48,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:43:48,484 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:43:48,484 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:43:48,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:43:48,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:43:48,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:43:48,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:43:48,485 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:43:48,485 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:43:48,485 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:43:48,486 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:43:48,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:43:48,486 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:43:48,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:43:48,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:43:48,486 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:43:48,486 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 15:43:48,486 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 15:43:48,486 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:43:48,487 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 15:43:48,487 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:43:48,487 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:43:48,487 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:43:48,487 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:43:48,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:43:48,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:43:48,488 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:43:48,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:43:48,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:43:48,488 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:43:48,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:43:48,488 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 15:43:48,488 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 15:43:48,488 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:43:48,489 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:43:48,489 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:43:48,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:43:48,489 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_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd 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 -> 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 [2024-11-13 15:43:48,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:43:48,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:43:48,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:43:48,828 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:43:48,829 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:43:48,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i Unable to find full path for "g++" [2024-11-13 15:43:50,802 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:43:51,134 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:43:51,135 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2024-11-13 15:43:51,151 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/data/6309e1420/d049e203b1994b4fa53e301b583428d3/FLAG245076e3d [2024-11-13 15:43:51,172 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/data/6309e1420/d049e203b1994b4fa53e301b583428d3 [2024-11-13 15:43:51,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:43:51,179 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:43:51,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:43:51,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:43:51,186 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:43:51,187 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:43:51" (1/1) ... [2024-11-13 15:43:51,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7370cf57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:43:51, skipping insertion in model container [2024-11-13 15:43:51,189 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:43:51" (1/1) ... [2024-11-13 15:43:51,234 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:43:51,654 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_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i[24361,24374] [2024-11-13 15:43:51,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:43:51,679 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:43:51,731 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_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i[24361,24374] [2024-11-13 15:43:51,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:43:51,764 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:43:51,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:43:51 WrapperNode [2024-11-13 15:43:51,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:43:51,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:43:51,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:43:51,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:43:51,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:43:51" (1/1) ... [2024-11-13 15:43:51,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:43:51" (1/1) ... [2024-11-13 15:43:51,827 INFO L138 Inliner]: procedures = 130, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2024-11-13 15:43:51,828 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:43:51,828 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:43:51,828 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:43:51,828 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:43:51,839 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:43:51" (1/1) ... [2024-11-13 15:43:51,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:43:51" (1/1) ... [2024-11-13 15:43:51,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:43:51" (1/1) ... [2024-11-13 15:43:51,878 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 12, 7]. 57 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2024-11-13 15:43:51,883 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:43:51" (1/1) ... [2024-11-13 15:43:51,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:43:51" (1/1) ... [2024-11-13 15:43:51,900 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:43:51" (1/1) ... [2024-11-13 15:43:51,906 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:43:51" (1/1) ... [2024-11-13 15:43:51,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:43:51" (1/1) ... [2024-11-13 15:43:51,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:43:51" (1/1) ... [2024-11-13 15:43:51,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:43:51,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:43:51,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:43:51,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:43:51,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:43:51" (1/1) ... [2024-11-13 15:43:51,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:43:51,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:43:51,967 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:43:51,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:43:52,002 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-13 15:43:52,002 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-13 15:43:52,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-13 15:43:52,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-13 15:43:52,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-13 15:43:52,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 15:43:52,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:43:52,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 15:43:52,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 15:43:52,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 15:43:52,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 15:43:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 15:43:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 15:43:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 15:43:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 15:43:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-13 15:43:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-13 15:43:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-13 15:43:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-13 15:43:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-13 15:43:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-13 15:43:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 15:43:52,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 15:43:52,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-13 15:43:52,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:43:52,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:43:52,186 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:43:52,188 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:43:52,214 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-13 15:43:52,553 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-11-13 15:43:52,553 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:43:52,563 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:43:52,563 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-13 15:43:52,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:43:52 BoogieIcfgContainer [2024-11-13 15:43:52,564 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:43:52,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:43:52,567 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:43:52,573 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:43:52,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:43:51" (1/3) ... [2024-11-13 15:43:52,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7913eeb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:43:52, skipping insertion in model container [2024-11-13 15:43:52,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:43:51" (2/3) ... [2024-11-13 15:43:52,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7913eeb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:43:52, skipping insertion in model container [2024-11-13 15:43:52,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:43:52" (3/3) ... [2024-11-13 15:43:52,576 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_equal.i [2024-11-13 15:43:52,594 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:43:52,596 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_prepend_equal.i that has 2 procedures, 30 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2024-11-13 15:43:52,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:43:52,679 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;@386206dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:43:52,680 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:43:52,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 25 states have (on average 1.52) internal successors, (38), 27 states have internal predecessors, (38), 2 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-13 15:43:52,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 15:43:52,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:43:52,691 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:43:52,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:43:52,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:43:52,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1704775824, now seen corresponding path program 1 times [2024-11-13 15:43:52,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:43:52,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [405540219] [2024-11-13 15:43:52,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:43:52,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:43:52,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:43:52,713 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:43:52,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:43:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:52,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 15:43:52,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:43:52,986 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-13 15:43:52,988 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:43:52,989 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:43:52,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405540219] [2024-11-13 15:43:52,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405540219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:43:52,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:43:52,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:43:52,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742120847] [2024-11-13 15:43:52,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:43:53,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:43:53,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:43:53,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:43:53,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:43:53,028 INFO L87 Difference]: Start difference. First operand has 29 states, 25 states have (on average 1.52) internal successors, (38), 27 states have internal predecessors, (38), 2 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) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:43:53,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:43:53,048 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2024-11-13 15:43:53,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:43:53,051 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-13 15:43:53,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:43:53,058 INFO L225 Difference]: With dead ends: 50 [2024-11-13 15:43:53,059 INFO L226 Difference]: Without dead ends: 20 [2024-11-13 15:43:53,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 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-13 15:43:53,068 INFO L432 NwaCegarLoop]: 36 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, 36 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-13 15:43:53,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:43:53,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-13 15:43:53,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-13 15:43:53,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:43:53,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-11-13 15:43:53,106 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2024-11-13 15:43:53,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:43:53,106 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-13 15:43:53,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:43:53,107 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-11-13 15:43:53,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 15:43:53,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:43:53,108 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:43:53,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 15:43:53,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:43:53,309 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:43:53,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:43:53,309 INFO L85 PathProgramCache]: Analyzing trace with hash -747804486, now seen corresponding path program 1 times [2024-11-13 15:43:53,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:43:53,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1462077717] [2024-11-13 15:43:53,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:43:53,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:43:53,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:43:53,313 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:43:53,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 15:43:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:53,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 15:43:53,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:43:53,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 15:43:53,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-13 15:43:53,856 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-13 15:43:53,857 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:43:53,857 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:43:53,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462077717] [2024-11-13 15:43:53,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462077717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:43:53,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:43:53,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:43:53,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067922102] [2024-11-13 15:43:53,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:43:53,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:43:53,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:43:53,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:43:53,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:43:53,862 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:43:54,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:43:54,173 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2024-11-13 15:43:54,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:43:54,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-13 15:43:54,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:43:54,175 INFO L225 Difference]: With dead ends: 24 [2024-11-13 15:43:54,175 INFO L226 Difference]: Without dead ends: 21 [2024-11-13 15:43:54,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:43:54,176 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:43:54,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 85 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:43:54,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-13 15:43:54,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-13 15:43:54,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:43:54,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-11-13 15:43:54,182 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2024-11-13 15:43:54,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:43:54,182 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-11-13 15:43:54,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:43:54,183 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-11-13 15:43:54,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 15:43:54,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:43:54,183 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:43:54,206 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 15:43:54,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:43:54,388 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:43:54,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:43:54,389 INFO L85 PathProgramCache]: Analyzing trace with hash -747802812, now seen corresponding path program 1 times [2024-11-13 15:43:54,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:43:54,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1503448614] [2024-11-13 15:43:54,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:43:54,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:43:54,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:43:54,391 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:43:54,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 15:43:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:54,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 15:43:54,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:43:54,748 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-13 15:43:54,748 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:43:54,749 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:43:54,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503448614] [2024-11-13 15:43:54,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503448614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:43:54,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:43:54,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:43:54,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839766796] [2024-11-13 15:43:54,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:43:54,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:43:54,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:43:54,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:43:54,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:43:54,751 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:43:55,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:43:55,350 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2024-11-13 15:43:55,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:43:55,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-13 15:43:55,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:43:55,353 INFO L225 Difference]: With dead ends: 51 [2024-11-13 15:43:55,353 INFO L226 Difference]: Without dead ends: 32 [2024-11-13 15:43:55,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:43:55,355 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:43:55,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 78 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:43:55,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-13 15:43:55,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-11-13 15:43:55,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:43:55,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2024-11-13 15:43:55,361 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 14 [2024-11-13 15:43:55,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:43:55,361 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-11-13 15:43:55,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:43:55,362 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2024-11-13 15:43:55,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 15:43:55,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:43:55,363 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:43:55,382 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 15:43:55,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:43:55,563 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:43:55,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:43:55,564 INFO L85 PathProgramCache]: Analyzing trace with hash -690544510, now seen corresponding path program 1 times [2024-11-13 15:43:55,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:43:55,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [610188009] [2024-11-13 15:43:55,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:43:55,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:43:55,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:43:55,567 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:43:55,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 15:43:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:55,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 15:43:55,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:43:55,733 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-13 15:43:55,734 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:43:55,734 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:43:55,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610188009] [2024-11-13 15:43:55,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610188009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:43:55,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:43:55,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:43:55,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138981561] [2024-11-13 15:43:55,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:43:55,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:43:55,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:43:55,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:43:55,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:43:55,738 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:43:55,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:43:55,762 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-11-13 15:43:55,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:43:55,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-13 15:43:55,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:43:55,766 INFO L225 Difference]: With dead ends: 40 [2024-11-13 15:43:55,766 INFO L226 Difference]: Without dead ends: 26 [2024-11-13 15:43:55,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:43:55,767 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:43:55,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 41 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:43:55,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-13 15:43:55,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-13 15:43:55,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:43:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-11-13 15:43:55,777 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2024-11-13 15:43:55,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:43:55,778 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-13 15:43:55,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:43:55,778 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-11-13 15:43:55,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 15:43:55,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:43:55,780 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:43:55,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-13 15:43:55,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:43:55,981 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:43:55,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:43:55,982 INFO L85 PathProgramCache]: Analyzing trace with hash -874944751, now seen corresponding path program 1 times [2024-11-13 15:43:55,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:43:55,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1084629905] [2024-11-13 15:43:55,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:43:55,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:43:55,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:43:55,985 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:43:55,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 15:43:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:56,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 15:43:56,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:43:56,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:43:56,218 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:43:56,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:43:56,334 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:43:56,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084629905] [2024-11-13 15:43:56,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084629905] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:43:56,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:43:56,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2024-11-13 15:43:56,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565552963] [2024-11-13 15:43:56,336 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:43:56,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:43:56,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:43:56,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:43:56,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:43:56,342 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:43:56,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:43:56,462 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2024-11-13 15:43:56,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:43:56,463 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-13 15:43:56,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:43:56,465 INFO L225 Difference]: With dead ends: 51 [2024-11-13 15:43:56,466 INFO L226 Difference]: Without dead ends: 37 [2024-11-13 15:43:56,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:43:56,467 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:43:56,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 101 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:43:56,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-13 15:43:56,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-13 15:43:56,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:43:56,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2024-11-13 15:43:56,477 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 19 [2024-11-13 15:43:56,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:43:56,477 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2024-11-13 15:43:56,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:43:56,477 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2024-11-13 15:43:56,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 15:43:56,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:43:56,478 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:43:56,500 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 15:43:56,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:43:56,683 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:43:56,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:43:56,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1969599526, now seen corresponding path program 1 times [2024-11-13 15:43:56,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:43:56,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [596363745] [2024-11-13 15:43:56,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:43:56,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:43:56,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:43:56,687 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:43:56,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 15:43:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:56,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-13 15:43:56,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:43:56,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-13 15:43:56,995 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-13 15:43:56,995 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 17 treesize of output 17 [2024-11-13 15:43:57,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 15:43:57,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 15:43:57,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:43:57,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-13 15:43:57,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 15:43:57,437 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 0 case distinctions, treesize of input 28 treesize of output 8 [2024-11-13 15:43:57,498 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 19 treesize of output 11 [2024-11-13 15:43:57,556 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 15 treesize of output 7 [2024-11-13 15:43:57,592 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:43:57,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:43:57,592 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:43:57,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596363745] [2024-11-13 15:43:57,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596363745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:43:57,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:43:57,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 15:43:57,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941904772] [2024-11-13 15:43:57,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:43:57,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:43:57,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:43:57,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:43:57,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:43:57,595 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:43:59,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:43:59,173 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2024-11-13 15:43:59,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:43:59,174 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-13 15:43:59,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:43:59,175 INFO L225 Difference]: With dead ends: 42 [2024-11-13 15:43:59,175 INFO L226 Difference]: Without dead ends: 40 [2024-11-13 15:43:59,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:43:59,176 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:43:59,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 68 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-13 15:43:59,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-13 15:43:59,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-11-13 15:43:59,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:43:59,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-11-13 15:43:59,194 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 24 [2024-11-13 15:43:59,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:43:59,194 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-11-13 15:43:59,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:43:59,194 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-11-13 15:43:59,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 15:43:59,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:43:59,195 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:43:59,222 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 15:43:59,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:43:59,396 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:43:59,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:43:59,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1295398953, now seen corresponding path program 1 times [2024-11-13 15:43:59,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:43:59,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [367896432] [2024-11-13 15:43:59,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:43:59,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:43:59,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:43:59,398 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:43:59,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 15:43:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:43:59,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-13 15:43:59,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:43:59,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-13 15:43:59,739 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-13 15:43:59,739 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 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-13 15:43:59,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-13 15:44:00,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:44:00,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2024-11-13 15:44:00,083 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 0 case distinctions, treesize of input 51 treesize of output 24 [2024-11-13 15:44:00,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 15:44:00,172 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 36 treesize of output 20 [2024-11-13 15:44:00,259 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 24 treesize of output 12 [2024-11-13 15:44:00,327 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:44:00,327 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:44:00,454 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 66 treesize of output 62 [2024-11-13 15:44:00,682 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse0 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (and (or (and .cse0 .cse1) (forall ((v_arrayElimCell_15 (_ BitVec 32)) (v_ArrVal_353 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_353) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) v_arrayElimCell_15)))))) (or (not .cse1) (forall ((v_ArrVal_353 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_353) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|))))) (not .cse0)))) is different from false [2024-11-13 15:44:00,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:44:00,723 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 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-13 15:44:00,730 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 51 treesize of output 39 [2024-11-13 15:44:00,740 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 8 treesize of output 4 [2024-11-13 15:44:00,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:44:00,780 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 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-13 15:44:00,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:44:00,819 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 63 treesize of output 62 [2024-11-13 15:44:00,832 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 38 treesize of output 34 [2024-11-13 15:44:01,080 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 26 treesize of output 14 [2024-11-13 15:44:01,408 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:44:01,408 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:44:01,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367896432] [2024-11-13 15:44:01,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367896432] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:44:01,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:44:01,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2024-11-13 15:44:01,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224779995] [2024-11-13 15:44:01,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:44:01,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-13 15:44:01,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:44:01,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-13 15:44:01,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=336, Unknown=1, NotChecked=36, Total=420 [2024-11-13 15:44:01,412 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:44:03,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:44:03,868 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2024-11-13 15:44:03,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 15:44:03,870 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-13 15:44:03,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:44:03,870 INFO L225 Difference]: With dead ends: 66 [2024-11-13 15:44:03,870 INFO L226 Difference]: Without dead ends: 39 [2024-11-13 15:44:03,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=69, Invalid=486, Unknown=1, NotChecked=44, Total=600 [2024-11-13 15:44:03,871 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 26 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:44:03,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 107 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 249 Invalid, 0 Unknown, 27 Unchecked, 2.2s Time] [2024-11-13 15:44:03,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-13 15:44:03,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-13 15:44:03,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:44:03,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-11-13 15:44:03,887 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 26 [2024-11-13 15:44:03,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:44:03,887 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-11-13 15:44:03,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:44:03,887 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-11-13 15:44:03,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 15:44:03,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:44:03,889 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:44:03,912 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 15:44:04,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:44:04,090 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:44:04,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:44:04,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1295397279, now seen corresponding path program 1 times [2024-11-13 15:44:04,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:44:04,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1294319945] [2024-11-13 15:44:04,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:44:04,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:44:04,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:44:04,094 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:44:04,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91d76d2a-d247-4d81-89ee-3ad3255d4c0b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 15:44:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:04,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-13 15:44:04,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:44:04,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-13 15:44:04,453 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-13 15:44:04,454 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 27 [2024-11-13 15:44:04,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-13 15:44:04,654 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-13 15:44:05,046 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-13 15:44:05,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2024-11-13 15:44:05,204 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 20 treesize of output 15 [2024-11-13 15:44:05,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-13 15:44:05,345 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 20 treesize of output 15 [2024-11-13 15:44:05,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-13 15:44:05,514 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:44:05,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:44:05,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 15 [2024-11-13 15:44:05,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:44:05,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2024-11-13 15:44:05,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:44:05,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2024-11-13 15:44:05,621 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 0 case distinctions, treesize of input 54 treesize of output 27 [2024-11-13 15:44:05,640 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 15:44:05,747 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 50 treesize of output 30 [2024-11-13 15:44:05,863 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 27 treesize of output 15 [2024-11-13 15:44:05,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 15:44:06,024 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 15 treesize of output 7 [2024-11-13 15:44:06,076 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:44:06,076 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:44:06,645 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (or (not (= v_ArrVal_447 (let ((.cse1 (bvadd (_ bv8 32) (select .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_447 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store |c_#memory_int#1| .cse0 v_ArrVal_447) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_446) .cse3) .cse4)) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_448) .cse3) .cse4)))))))) is different from false [2024-11-13 15:44:06,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:44:06,752 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 1 case distinctions, treesize of input 119 treesize of output 120 [2024-11-13 15:44:07,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:44:07,018 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 238 treesize of output 237 [2024-11-13 15:44:07,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:44:07,065 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 1 case distinctions, treesize of input 194 treesize of output 180 [2024-11-13 15:44:07,107 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 90 treesize of output 74 [2024-11-13 15:44:07,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:44:07,253 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 300 treesize of output 269 [2024-11-13 15:44:07,288 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 53 treesize of output 37 [2024-11-13 15:44:09,266 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse28 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse25 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse5 (select .cse25 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse18 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select .cse28 |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse9 (= .cse18 .cse3)) (.cse4 (bvadd (_ bv8 32) .cse5))) (let ((.cse1 (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_44 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32)) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_444))) (or (not (= v_ArrVal_447 (store (select .cse29 .cse3) .cse4 (select v_ArrVal_447 .cse4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse29 .cse3 v_ArrVal_447) v_arrayElimCell_41) v_arrayElimCell_44)))))) (.cse15 (not .cse9)) (.cse16 (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_44 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32)) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_447 (store (select |c_#memory_int#1| .cse3) .cse4 (select v_ArrVal_447 .cse4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_444) .cse3 v_ArrVal_447) v_arrayElimCell_41) v_arrayElimCell_44))))) (.cse26 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse28 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (= .cse3 .cse26)) (.cse7 (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_42 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32)) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_444))) (or (not (= v_ArrVal_447 (store (select .cse27 .cse3) .cse4 (select v_ArrVal_447 .cse4)))) (= (select v_ArrVal_447 v_arrayElimCell_42) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse27 .cse3 v_ArrVal_447) v_arrayElimCell_41) v_arrayElimCell_44)))))) (.cse6 (= |c_ULTIMATE.start_node_create_#res#1.base| .cse26)) (.cse8 (or .cse15 .cse16)) (.cse10 (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse25 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_#res#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_node_create_#res#1.offset|)) (.cse12 (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_42 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32)) (v_arrayElimCell_39 (_ BitVec 32)) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_444))) (let ((.cse24 (store .cse23 .cse3 v_ArrVal_447))) (or (not (= v_ArrVal_447 (store (select .cse23 .cse3) .cse4 (select v_ArrVal_447 .cse4)))) (= (select (select .cse24 v_arrayElimCell_39) v_arrayElimCell_42) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse24 v_arrayElimCell_41) v_arrayElimCell_44))))))) (.cse13 (or .cse9 (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_42 (_ BitVec 32)) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_444))) (or (not (= v_ArrVal_447 (store (select .cse22 .cse3) .cse4 (select v_ArrVal_447 .cse4)))) (= (select (select (store .cse22 .cse3 v_ArrVal_447) v_arrayElimCell_39) v_arrayElimCell_42) |c_ULTIMATE.start_main_~data~0#1|)))))) (.cse11 (or .cse15 .cse1)) (.cse14 (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_44 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32)) (v_arrayElimCell_39 (_ BitVec 32)) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_444))) (let ((.cse21 (store .cse20 .cse3 v_ArrVal_447))) (or (not (= v_ArrVal_447 (store (select .cse20 .cse3) .cse4 (select v_ArrVal_447 .cse4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse21 v_arrayElimCell_41) v_arrayElimCell_44)) (= (select (select .cse21 v_arrayElimCell_39) .cse5) |c_ULTIMATE.start_main_~data~0#1|)))))) (.cse17 (or .cse9 (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_444))) (or (not (= v_ArrVal_447 (store (select .cse19 .cse3) .cse4 (select v_ArrVal_447 .cse4)))) (= (select (select (store .cse19 .cse3 v_ArrVal_447) v_arrayElimCell_39) .cse5) |c_ULTIMATE.start_main_~data~0#1|))))))) (and (or (not .cse0) .cse1) (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_44 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32)) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_444))) (or (not (= v_ArrVal_447 (store (select .cse2 .cse3) .cse4 (select v_ArrVal_447 .cse4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse2 .cse3 v_ArrVal_447) v_arrayElimCell_41) v_arrayElimCell_44)) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_447 .cse5))))) (or .cse6 (and .cse7 .cse8 (or .cse9 (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (_ BitVec 32)) (v_arrayElimCell_42 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_444) .cse3) .cse4 v_DerPreprocessor_2) v_arrayElimCell_42)))))) (or (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_444) .cse3) .cse5) |c_ULTIMATE.start_main_~data~0#1|)) .cse0) (or .cse10 (and .cse11 .cse7 (or (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (_ BitVec 32)) (v_arrayElimCell_42 (_ BitVec 32))) (= (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_444) .cse3) .cse4 v_DerPreprocessor_3) v_arrayElimCell_42) |c_ULTIMATE.start_main_~data~0#1|)) .cse9))) (or .cse6 (and .cse12 .cse13 .cse14 .cse8 (or .cse15 (= |c_ULTIMATE.start_node_create_#res#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse16) .cse17)) (or .cse10 (and .cse12 .cse13 .cse11 .cse14 (or .cse15 .cse16 (= .cse18 |c_ULTIMATE.start_node_create_#res#1.base|)) .cse17)))))))) is different from false [2024-11-13 15:44:10,405 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse28 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse19 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse15 (select .cse19 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse18 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select .cse28 |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse2 (= .cse18 .cse3)) (.cse4 (bvadd (_ bv8 32) .cse15))) (let ((.cse7 (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_44 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32)) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_444))) (or (= (select (select (store .cse29 .cse3 v_ArrVal_447) v_arrayElimCell_41) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_447 (store (select .cse29 .cse3) .cse4 (select v_ArrVal_447 .cse4)))))))) (.cse27 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse28 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse12 (not .cse2)) (.cse13 (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_44 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32)) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_447 (store (select |c_#memory_int#1| .cse3) .cse4 (select v_ArrVal_447 .cse4)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_444) .cse3 v_ArrVal_447) v_arrayElimCell_41) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data~0#1|))))) (let ((.cse1 (or .cse12 .cse13)) (.cse0 (= .cse27 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (.cse6 (= .cse3 .cse27)) (.cse5 (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_42 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32)) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_444))) (or (= (select v_ArrVal_447 v_arrayElimCell_42) |c_ULTIMATE.start_main_~data~0#1|) (= (select (select (store .cse26 .cse3 v_ArrVal_447) v_arrayElimCell_41) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_447 (store (select .cse26 .cse3) .cse4 (select v_ArrVal_447 .cse4)))))))) (.cse8 (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_42 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32)) (v_arrayElimCell_39 (_ BitVec 32)) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_444))) (let ((.cse24 (store .cse25 .cse3 v_ArrVal_447))) (or (= (select (select .cse24 v_arrayElimCell_41) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse24 v_arrayElimCell_39) v_arrayElimCell_42)) (not (= v_ArrVal_447 (store (select .cse25 .cse3) .cse4 (select v_ArrVal_447 .cse4))))))))) (.cse9 (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_44 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32)) (v_arrayElimCell_39 (_ BitVec 32)) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_444))) (let ((.cse22 (store .cse23 .cse3 v_ArrVal_447))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse22 v_arrayElimCell_39) .cse15)) (= (select (select .cse22 v_arrayElimCell_41) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_447 (store (select .cse23 .cse3) .cse4 (select v_ArrVal_447 .cse4))))))))) (.cse10 (or .cse2 (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_444))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse21 .cse3 v_ArrVal_447) v_arrayElimCell_39) .cse15)) (not (= v_ArrVal_447 (store (select .cse21 .cse3) .cse4 (select v_ArrVal_447 .cse4))))))))) (.cse11 (or .cse2 (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_42 (_ BitVec 32)) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_444))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse20 .cse3 v_ArrVal_447) v_arrayElimCell_39) v_arrayElimCell_42)) (not (= v_ArrVal_447 (store (select .cse20 .cse3) .cse4 (select v_ArrVal_447 .cse4))))))))) (.cse16 (or .cse12 .cse7)) (.cse17 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse19 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (or .cse0 (and .cse1 (or .cse2 (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (_ BitVec 32)) (v_arrayElimCell_42 (_ BitVec 32))) (= (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_444) .cse3) .cse4 v_DerPreprocessor_2) v_arrayElimCell_42) |c_ULTIMATE.start_main_~data~0#1|))) .cse5)) (or (not .cse6) .cse7) (or (and .cse8 .cse1 .cse9 .cse10 .cse11 (or .cse12 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse13)) .cse0) (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_44 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32)) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_444))) (or (= (select (select (store .cse14 .cse3 v_ArrVal_447) v_arrayElimCell_41) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_447 (store (select .cse14 .cse3) .cse4 (select v_ArrVal_447 .cse4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_447 .cse15))))) (or (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_444) .cse3) .cse15) |c_ULTIMATE.start_main_~data~0#1|)) .cse6) (or (and (or .cse2 (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (_ BitVec 32)) (v_arrayElimCell_42 (_ BitVec 32))) (= (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_444) .cse3) .cse4 v_DerPreprocessor_3) v_arrayElimCell_42) |c_ULTIMATE.start_main_~data~0#1|))) .cse16 .cse5) .cse17) (or (and .cse8 .cse9 .cse10 (or .cse12 (= .cse18 |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse13) .cse11 .cse16) .cse17))))))) is different from false [2024-11-13 15:44:13,076 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 149 treesize of output 117 [2024-11-13 15:44:13,087 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 121 treesize of output 93 [2024-11-13 15:44:13,196 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 13 treesize of output 1 [2024-11-13 15:44:14,923 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 52 treesize of output 48 [2024-11-13 15:44:14,930 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 48 treesize of output 44 [2024-11-13 15:44:14,940 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 22 treesize of output 20 [2024-11-13 15:44:15,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:44:15,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 42 [2024-11-13 15:44:15,044 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:44:15,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-13 15:44:15,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-13 15:44:16,030 INFO L349 Elim1Store]: treesize reduction 82, result has 45.7 percent of original size [2024-11-13 15:44:16,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 151 treesize of output 197 [2024-11-13 15:44:16,079 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:44:16,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:44:16,114 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 285 treesize of output 279 [2024-11-13 15:44:16,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:44:16,172 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 265 treesize of output 261 [2024-11-13 15:44:16,199 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 246 treesize of output 242 [2024-11-13 15:44:16,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-13 15:44:16,917 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 17 treesize of output 13