./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.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_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/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_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/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_bd37033f-0c75-48bc-8719-bafbed5a5c77/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 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:29:44,521 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:29:44,618 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:29:44,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:29:44,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:29:44,662 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:29:44,665 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:29:44,666 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:29:44,666 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:29:44,666 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:29:44,666 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:29:44,666 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:29:44,667 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:29:44,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:29:44,667 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:29:44,667 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:29:44,667 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:29:44,667 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:29:44,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:29:44,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:29:44,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:29:44,668 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:29:44,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:29:44,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:29:44,670 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:29:44,670 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:29:44,670 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:29:44,670 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:29:44,671 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:29:44,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:29:44,671 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:29:44,671 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:29:44,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:29:44,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:29:44,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:29:44,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:29:44,671 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:29:44,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:29:44,672 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:29:44,672 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:29:44,672 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:29:44,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:29:44,672 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_bd37033f-0c75-48bc-8719-bafbed5a5c77/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 -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2024-11-13 14:29:44,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:29:44,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:29:45,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:29:45,002 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:29:45,002 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:29:45,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i Unable to find full path for "g++" [2024-11-13 14:29:46,964 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:29:47,427 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:29:47,427 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2024-11-13 14:29:47,450 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/data/a1ccf8c99/ad8328085ca44faca4c744fda9c53e66/FLAGe5efe2291 [2024-11-13 14:29:47,473 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/data/a1ccf8c99/ad8328085ca44faca4c744fda9c53e66 [2024-11-13 14:29:47,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:29:47,478 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:29:47,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:29:47,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:29:47,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:29:47,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:29:47" (1/1) ... [2024-11-13 14:29:47,490 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ea21a95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:47, skipping insertion in model container [2024-11-13 14:29:47,490 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:29:47" (1/1) ... [2024-11-13 14:29:47,540 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:29:47,982 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_bd37033f-0c75-48bc-8719-bafbed5a5c77/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2024-11-13 14:29:47,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:29:47,998 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:29:48,062 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_bd37033f-0c75-48bc-8719-bafbed5a5c77/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2024-11-13 14:29:48,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:29:48,092 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:29:48,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:48 WrapperNode [2024-11-13 14:29:48,093 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:29:48,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:29:48,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:29:48,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:29:48,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:48" (1/1) ... [2024-11-13 14:29:48,115 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:48" (1/1) ... [2024-11-13 14:29:48,154 INFO L138 Inliner]: procedures = 127, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 182 [2024-11-13 14:29:48,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:29:48,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:29:48,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:29:48,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:29:48,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:48" (1/1) ... [2024-11-13 14:29:48,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:48" (1/1) ... [2024-11-13 14:29:48,174 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:48" (1/1) ... [2024-11-13 14:29:48,212 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 12, 26]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 18 writes are split as follows [0, 1, 17]. [2024-11-13 14:29:48,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:48" (1/1) ... [2024-11-13 14:29:48,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:48" (1/1) ... [2024-11-13 14:29:48,235 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:48" (1/1) ... [2024-11-13 14:29:48,242 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:48" (1/1) ... [2024-11-13 14:29:48,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:48" (1/1) ... [2024-11-13 14:29:48,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:48" (1/1) ... [2024-11-13 14:29:48,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:29:48,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:29:48,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:29:48,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:29:48,256 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:48" (1/1) ... [2024-11-13 14:29:48,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:29:48,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:29:48,300 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:29:48,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:29:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 14:29:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 14:29:48,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 14:29:48,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 14:29:48,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 14:29:48,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 14:29:48,342 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-13 14:29:48,342 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-13 14:29:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 14:29:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:29:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 14:29:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 14:29:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 14:29:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 14:29:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 14:29:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 14:29:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 14:29:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 14:29:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-13 14:29:48,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-13 14:29:48,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-13 14:29:48,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:29:48,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 14:29:48,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 14:29:48,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:29:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:29:48,551 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:29:48,554 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:29:48,997 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-11-13 14:29:48,997 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:29:49,015 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:29:49,016 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-13 14:29:49,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:29:49 BoogieIcfgContainer [2024-11-13 14:29:49,016 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:29:49,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:29:49,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:29:49,027 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:29:49,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:29:47" (1/3) ... [2024-11-13 14:29:49,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d99f757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:29:49, skipping insertion in model container [2024-11-13 14:29:49,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:29:48" (2/3) ... [2024-11-13 14:29:49,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d99f757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:29:49, skipping insertion in model container [2024-11-13 14:29:49,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:29:49" (3/3) ... [2024-11-13 14:29:49,033 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2024-11-13 14:29:49,055 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:29:49,058 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_insert_unequal.i that has 2 procedures, 42 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2024-11-13 14:29:49,141 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:29:49,162 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;@5a8dcf3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:29:49,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:29:49,167 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 37 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:29:49,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 14:29:49,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:29:49,178 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] [2024-11-13 14:29:49,179 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:29:49,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:29:49,185 INFO L85 PathProgramCache]: Analyzing trace with hash 828589496, now seen corresponding path program 1 times [2024-11-13 14:29:49,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:29:49,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076960696] [2024-11-13 14:29:49,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:29:49,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:29:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:29:49,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:29:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:29:49,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:29:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:29:49,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 14:29:49,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:29:49,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076960696] [2024-11-13 14:29:49,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076960696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:29:49,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:29:49,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:29:49,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665491778] [2024-11-13 14:29:49,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:29:49,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:29:49,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:29:49,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:29:49,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:29:49,851 INFO L87 Difference]: Start difference. First operand has 42 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 37 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:29:49,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:29:49,980 INFO L93 Difference]: Finished difference Result 75 states and 110 transitions. [2024-11-13 14:29:49,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:29:49,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-11-13 14:29:49,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:29:49,991 INFO L225 Difference]: With dead ends: 75 [2024-11-13 14:29:49,991 INFO L226 Difference]: Without dead ends: 34 [2024-11-13 14:29:49,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:29:49,998 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:29:49,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:29:50,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-13 14:29:50,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-13 14:29:50,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:29:50,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2024-11-13 14:29:50,053 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 25 [2024-11-13 14:29:50,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:29:50,055 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2024-11-13 14:29:50,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:29:50,056 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2024-11-13 14:29:50,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 14:29:50,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:29:50,059 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] [2024-11-13 14:29:50,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:29:50,059 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:29:50,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:29:50,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1124400795, now seen corresponding path program 1 times [2024-11-13 14:29:50,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:29:50,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055674188] [2024-11-13 14:29:50,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:29:50,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:29:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:29:50,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:29:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:29:50,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:29:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:29:50,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 14:29:50,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:29:50,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055674188] [2024-11-13 14:29:50,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055674188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:29:50,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:29:50,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:29:50,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735937056] [2024-11-13 14:29:50,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:29:50,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:29:50,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:29:50,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:29:50,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:29:50,458 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:29:50,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:29:50,585 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2024-11-13 14:29:50,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:29:50,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-11-13 14:29:50,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:29:50,587 INFO L225 Difference]: With dead ends: 64 [2024-11-13 14:29:50,587 INFO L226 Difference]: Without dead ends: 39 [2024-11-13 14:29:50,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:29:50,589 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:29:50,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 102 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:29:50,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-13 14:29:50,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2024-11-13 14:29:50,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:29:50,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2024-11-13 14:29:50,596 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 25 [2024-11-13 14:29:50,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:29:50,596 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2024-11-13 14:29:50,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:29:50,597 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2024-11-13 14:29:50,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 14:29:50,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:29:50,599 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:29:50,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:29:50,599 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:29:50,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:29:50,600 INFO L85 PathProgramCache]: Analyzing trace with hash 106867249, now seen corresponding path program 1 times [2024-11-13 14:29:50,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:29:50,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173082211] [2024-11-13 14:29:50,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:29:50,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:29:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:29:50,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:29:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:29:50,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:29:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:29:50,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-13 14:29:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:29:50,989 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 14:29:50,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:29:50,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173082211] [2024-11-13 14:29:50,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173082211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:29:50,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:29:50,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:29:50,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962282468] [2024-11-13 14:29:50,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:29:50,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:29:50,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:29:50,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:29:50,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:29:50,993 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-13 14:29:51,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:29:51,112 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2024-11-13 14:29:51,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:29:51,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-11-13 14:29:51,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:29:51,115 INFO L225 Difference]: With dead ends: 49 [2024-11-13 14:29:51,115 INFO L226 Difference]: Without dead ends: 37 [2024-11-13 14:29:51,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:29:51,117 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:29:51,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:29:51,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-13 14:29:51,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-13 14:29:51,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:29:51,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2024-11-13 14:29:51,132 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 35 [2024-11-13 14:29:51,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:29:51,133 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2024-11-13 14:29:51,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-13 14:29:51,133 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2024-11-13 14:29:51,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 14:29:51,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:29:51,136 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:29:51,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:29:51,136 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:29:51,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:29:51,137 INFO L85 PathProgramCache]: Analyzing trace with hash 553609090, now seen corresponding path program 1 times [2024-11-13 14:29:51,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:29:51,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372942868] [2024-11-13 14:29:51,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:29:51,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:29:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:29:55,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:29:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:29:55,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:29:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:29:55,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-13 14:29:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:29:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 14:29:55,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:29:55,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372942868] [2024-11-13 14:29:55,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372942868] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:29:55,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60381655] [2024-11-13 14:29:55,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:29:55,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:29:55,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:29:55,890 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:29:55,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:29:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:29:56,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 132 conjuncts are in the unsatisfiable core [2024-11-13 14:29:56,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:29:56,926 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 14:29:57,442 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 14:29:57,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-13 14:29:57,667 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 14:29:57,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 14:29:57,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-13 14:29:57,873 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 14:29:58,072 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 14:29:58,072 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 61 [2024-11-13 14:29:58,090 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 14:29:58,519 INFO L349 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2024-11-13 14:29:58,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 122 [2024-11-13 14:29:58,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:29:58,543 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 25 [2024-11-13 14:29:58,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2024-11-13 14:29:58,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 61 [2024-11-13 14:29:58,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 20 [2024-11-13 14:29:58,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 21 [2024-11-13 14:29:58,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-13 14:29:58,944 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 11 treesize of output 3 [2024-11-13 14:29:59,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:29:59,395 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 69 treesize of output 40 [2024-11-13 14:29:59,430 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-13 14:29:59,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-13 14:29:59,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-13 14:29:59,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 23 [2024-11-13 14:30:00,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2024-11-13 14:30:00,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2024-11-13 14:30:00,334 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 14:30:00,478 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:30:00,478 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:30:09,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60381655] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:30:09,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:30:09,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 47 [2024-11-13 14:30:09,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479503142] [2024-11-13 14:30:09,567 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:30:09,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-13 14:30:09,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:30:09,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-13 14:30:09,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2543, Unknown=45, NotChecked=0, Total=2756 [2024-11-13 14:30:09,571 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 47 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 38 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:30:13,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:30:13,022 INFO L93 Difference]: Finished difference Result 109 states and 148 transitions. [2024-11-13 14:30:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 14:30:13,024 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 38 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2024-11-13 14:30:13,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:30:13,025 INFO L225 Difference]: With dead ends: 109 [2024-11-13 14:30:13,026 INFO L226 Difference]: Without dead ends: 77 [2024-11-13 14:30:13,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1116 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=322, Invalid=4603, Unknown=45, NotChecked=0, Total=4970 [2024-11-13 14:30:13,029 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 85 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:30:13,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 524 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-13 14:30:13,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-13 14:30:13,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 57. [2024-11-13 14:30:13,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:30:13,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2024-11-13 14:30:13,049 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 36 [2024-11-13 14:30:13,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:30:13,049 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2024-11-13 14:30:13,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 38 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:30:13,049 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2024-11-13 14:30:13,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 14:30:13,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:30:13,051 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:30:13,073 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:30:13,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:30:13,252 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:30:13,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:30:13,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1217636407, now seen corresponding path program 1 times [2024-11-13 14:30:13,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:30:13,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331592278] [2024-11-13 14:30:13,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:30:13,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:30:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:13,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:30:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:13,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:30:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:13,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-13 14:30:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:13,511 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 14:30:13,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:30:13,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331592278] [2024-11-13 14:30:13,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331592278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:30:13,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:30:13,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:30:13,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193540572] [2024-11-13 14:30:13,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:30:13,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:30:13,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:30:13,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:30:13,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:30:13,513 INFO L87 Difference]: Start difference. First operand 57 states and 74 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 14:30:13,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:30:13,603 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2024-11-13 14:30:13,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:30:13,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-11-13 14:30:13,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:30:13,606 INFO L225 Difference]: With dead ends: 73 [2024-11-13 14:30:13,606 INFO L226 Difference]: Without dead ends: 58 [2024-11-13 14:30:13,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:30:13,607 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 26 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:30:13,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 109 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:30:13,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-13 14:30:13,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2024-11-13 14:30:13,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:30:13,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2024-11-13 14:30:13,624 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 37 [2024-11-13 14:30:13,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:30:13,624 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2024-11-13 14:30:13,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 14:30:13,624 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2024-11-13 14:30:13,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 14:30:13,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:30:13,627 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:30:13,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:30:13,628 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:30:13,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:30:13,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1517704273, now seen corresponding path program 2 times [2024-11-13 14:30:13,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:30:13,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174730949] [2024-11-13 14:30:13,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:30:13,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:30:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:13,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:30:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:13,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:30:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:13,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-13 14:30:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:13,997 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 14:30:13,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:30:13,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174730949] [2024-11-13 14:30:13,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174730949] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:30:13,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439231739] [2024-11-13 14:30:13,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:30:13,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:30:13,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:30:14,002 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:30:14,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:30:14,341 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 14:30:14,342 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:30:14,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 14:30:14,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:30:14,401 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 14:30:14,401 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:30:14,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439231739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:30:14,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:30:14,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2024-11-13 14:30:14,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11980364] [2024-11-13 14:30:14,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:30:14,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:30:14,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:30:14,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:30:14,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:30:14,403 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 14:30:14,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:30:14,448 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2024-11-13 14:30:14,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:30:14,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-11-13 14:30:14,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:30:14,450 INFO L225 Difference]: With dead ends: 74 [2024-11-13 14:30:14,450 INFO L226 Difference]: Without dead ends: 58 [2024-11-13 14:30:14,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:30:14,451 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 25 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:30:14,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 127 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:30:14,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-13 14:30:14,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2024-11-13 14:30:14,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:30:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2024-11-13 14:30:14,462 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 37 [2024-11-13 14:30:14,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:30:14,463 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2024-11-13 14:30:14,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 14:30:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2024-11-13 14:30:14,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 14:30:14,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:30:14,464 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:30:14,488 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 14:30:14,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:30:14,669 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:30:14,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:30:14,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1039816008, now seen corresponding path program 1 times [2024-11-13 14:30:14,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:30:14,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732563561] [2024-11-13 14:30:14,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:30:14,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:30:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:14,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:30:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:14,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:30:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:14,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-13 14:30:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 14:30:14,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:30:14,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732563561] [2024-11-13 14:30:14,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732563561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:30:14,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041602455] [2024-11-13 14:30:14,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:30:14,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:30:14,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:30:14,896 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:30:14,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 14:30:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:15,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 14:30:15,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:30:15,220 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 14:30:15,220 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:30:15,313 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 14:30:15,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041602455] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:30:15,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:30:15,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2024-11-13 14:30:15,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657325949] [2024-11-13 14:30:15,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:30:15,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:30:15,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:30:15,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:30:15,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:30:15,316 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-13 14:30:15,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:30:15,508 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2024-11-13 14:30:15,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:30:15,509 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2024-11-13 14:30:15,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:30:15,510 INFO L225 Difference]: With dead ends: 69 [2024-11-13 14:30:15,510 INFO L226 Difference]: Without dead ends: 56 [2024-11-13 14:30:15,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:30:15,511 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:30:15,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 227 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:30:15,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-13 14:30:15,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-13 14:30:15,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:30:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2024-11-13 14:30:15,526 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 38 [2024-11-13 14:30:15,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:30:15,526 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2024-11-13 14:30:15,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-13 14:30:15,527 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2024-11-13 14:30:15,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 14:30:15,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:30:15,527 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:30:15,550 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 14:30:15,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:30:15,728 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:30:15,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:30:15,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1097074310, now seen corresponding path program 1 times [2024-11-13 14:30:15,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:30:15,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995493970] [2024-11-13 14:30:15,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:30:15,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:30:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:16,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:30:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:16,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:30:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:16,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-13 14:30:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 14:30:16,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:30:16,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995493970] [2024-11-13 14:30:16,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995493970] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:30:16,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942140541] [2024-11-13 14:30:16,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:30:16,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:30:16,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:30:16,111 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:30:16,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 14:30:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:16,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 14:30:16,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:30:16,473 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 14:30:16,514 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 14:30:16,514 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:30:16,568 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 14:30:16,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942140541] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:30:16,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:30:16,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 16 [2024-11-13 14:30:16,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973799741] [2024-11-13 14:30:16,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:30:16,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 14:30:16,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:30:16,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 14:30:16,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-13 14:30:16,571 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-13 14:30:20,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:30:24,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:30:28,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:30:32,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:30:36,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:30:41,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:30:45,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:30:45,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:30:45,106 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2024-11-13 14:30:45,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 14:30:45,107 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2024-11-13 14:30:45,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:30:45,108 INFO L225 Difference]: With dead ends: 90 [2024-11-13 14:30:45,108 INFO L226 Difference]: Without dead ends: 59 [2024-11-13 14:30:45,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2024-11-13 14:30:45,109 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 30 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:30:45,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 349 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 252 Invalid, 7 Unknown, 0 Unchecked, 28.4s Time] [2024-11-13 14:30:45,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-13 14:30:45,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-13 14:30:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:30:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2024-11-13 14:30:45,120 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 38 [2024-11-13 14:30:45,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:30:45,120 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2024-11-13 14:30:45,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-13 14:30:45,121 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2024-11-13 14:30:45,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 14:30:45,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:30:45,122 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:30:45,144 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 14:30:45,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-13 14:30:45,326 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:30:45,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:30:45,327 INFO L85 PathProgramCache]: Analyzing trace with hash -105706485, now seen corresponding path program 1 times [2024-11-13 14:30:45,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:30:45,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717739588] [2024-11-13 14:30:45,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:30:45,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:30:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:48,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:30:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:48,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:30:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:48,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-13 14:30:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:48,790 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 14:30:48,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:30:48,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717739588] [2024-11-13 14:30:48,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717739588] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:30:48,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786019041] [2024-11-13 14:30:48,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:30:48,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:30:48,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:30:48,794 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:30:48,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 14:30:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:49,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 141 conjuncts are in the unsatisfiable core [2024-11-13 14:30:49,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:30:49,714 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 14:30:50,110 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from false [2024-11-13 14:30:50,117 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from true [2024-11-13 14:30:50,162 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 14:30:50,169 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from false [2024-11-13 14:30:50,173 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from true [2024-11-13 14:30:50,228 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 14:30:50,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-13 14:30:50,245 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 14:30:50,251 WARN L851 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) is different from false [2024-11-13 14:30:50,254 WARN L873 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) is different from true [2024-11-13 14:30:50,295 WARN L851 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from false [2024-11-13 14:30:50,298 WARN L873 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from true [2024-11-13 14:30:50,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:30:50,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:30:50,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2024-11-13 14:30:50,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2024-11-13 14:30:50,433 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)))) is different from false [2024-11-13 14:30:50,436 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)))) is different from true [2024-11-13 14:30:50,518 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select |c_#valid| .cse0) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) is different from false [2024-11-13 14:30:50,522 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select |c_#valid| .cse0) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) is different from true [2024-11-13 14:30:50,553 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 13 treesize of output 5 [2024-11-13 14:30:50,588 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_35 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_35) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-13 14:30:50,592 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_35 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_35) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-13 14:30:50,653 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (v_arrayElimCell_35 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_35) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-13 14:30:50,657 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (v_arrayElimCell_35 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_35) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-13 14:30:50,745 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 14:30:50,786 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 8) |c_node_create_#in~data#1|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (v_arrayElimCell_35 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_35) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-13 14:30:50,790 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 8) |c_node_create_#in~data#1|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (v_arrayElimCell_35 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_35) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-13 14:30:50,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:30:50,912 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 22 treesize of output 17 [2024-11-13 14:30:50,992 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (v_arrayElimCell_35 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_35) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse3 (select |v_old(#valid)_AFTER_CALL_15| .cse3))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_16| (select (select |c_#memory_$Pointer$#2.base| .cse2) 0))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse2) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) is different from false [2024-11-13 14:30:50,997 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (v_arrayElimCell_35 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_35) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse3 (select |v_old(#valid)_AFTER_CALL_15| .cse3))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_16| (select (select |c_#memory_$Pointer$#2.base| .cse2) 0))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse2) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) is different from true [2024-11-13 14:30:51,137 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (v_arrayElimCell_35 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_35) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse3 (select |v_old(#valid)_AFTER_CALL_15| .cse3))) |v_old(#valid)_AFTER_CALL_15|) (= 1 (select |v_old(#valid)_AFTER_CALL_16| (select (select |c_#memory_$Pointer$#2.base| .cse2) 0))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= .cse2 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) is different from false [2024-11-13 14:30:51,142 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (v_arrayElimCell_35 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_35) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse3 (select |v_old(#valid)_AFTER_CALL_15| .cse3))) |v_old(#valid)_AFTER_CALL_15|) (= 1 (select |v_old(#valid)_AFTER_CALL_16| (select (select |c_#memory_$Pointer$#2.base| .cse2) 0))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= .cse2 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) is different from true [2024-11-13 14:30:51,275 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (v_arrayElimCell_35 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_35) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= .cse2 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse3 (select |v_old(#valid)_AFTER_CALL_15| .cse3))) |v_old(#valid)_AFTER_CALL_15|) (= 1 (select |v_old(#valid)_AFTER_CALL_16| (select (select |c_#memory_$Pointer$#2.base| .cse2) 0))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) is different from false [2024-11-13 14:30:51,281 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (v_arrayElimCell_35 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_35) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= .cse2 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse3 (select |v_old(#valid)_AFTER_CALL_15| .cse3))) |v_old(#valid)_AFTER_CALL_15|) (= 1 (select |v_old(#valid)_AFTER_CALL_16| (select (select |c_#memory_$Pointer$#2.base| .cse2) 0))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) is different from true [2024-11-13 14:30:51,420 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 14:30:51,423 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-13 14:30:51,437 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 14:30:51,441 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-13 14:30:51,463 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 0 case distinctions, treesize of input 45 treesize of output 41 [2024-11-13 14:30:51,476 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 81 [2024-11-13 14:30:51,512 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2024-11-13 14:30:51,512 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 223 treesize of output 136 [2024-11-13 14:30:51,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:30:51,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 49 [2024-11-13 14:30:51,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 15 [2024-11-13 14:30:51,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 19 [2024-11-13 14:30:51,590 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 14:30:51,595 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-13 14:30:51,644 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (and (= (select (select |c_#memory_int#2| .cse0) 8) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (v_arrayElimCell_35 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_35) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (not (= .cse3 .cse0)) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0)) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_37 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_37) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse3) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2024-11-13 14:30:51,650 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (and (= (select (select |c_#memory_int#2| .cse0) 8) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (v_arrayElimCell_35 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_35) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (not (= .cse3 .cse0)) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0)) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_37 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_37) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse3) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2024-11-13 14:30:51,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:30:51,717 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 99 treesize of output 67 [2024-11-13 14:30:51,767 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 14:30:51,768 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 15 treesize of output 7 [2024-11-13 14:30:51,784 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| .cse0) 8)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_37 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_37) 1) (= (select |v_old(#valid)_AFTER_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0))))) is different from false [2024-11-13 14:30:51,788 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| .cse0) 8)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_37 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_37) 1) (= (select |v_old(#valid)_AFTER_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0))))) is different from true [2024-11-13 14:30:51,848 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 14:30:51,859 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 14:30:51,896 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_37 Int)) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_15| .cse0))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_37) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1) (= (select |v_old(#valid)_AFTER_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0)))) is different from false [2024-11-13 14:30:51,899 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_37 Int)) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_15| .cse0))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_37) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1) (= (select |v_old(#valid)_AFTER_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0)))) is different from true [2024-11-13 14:30:51,948 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 14:30:51,955 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2024-11-13 14:30:51,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:30:52,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:30:52,130 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 70 treesize of output 71 [2024-11-13 14:30:52,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:30:52,156 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 268 treesize of output 271 [2024-11-13 14:30:52,170 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 248 treesize of output 236 [2024-11-13 14:30:52,185 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 114 [2024-11-13 14:30:52,947 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse3))) (let ((.cse5 (not .cse8)) (.cse7 (= .cse3 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4)) (.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (or .cse8 (and (or (forall ((v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1740 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1737 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1737))) (or (not (= v_ArrVal_1740 (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1740 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1740 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1740) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1746) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1744) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1742) .cse3) .cse4)) (+ 8 v_arrayElimCell_49)))))) .cse7) (forall ((v_ArrVal_1740 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1737 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1737))) (or (not (= v_ArrVal_1740 (store (store (select .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1740 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1740 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (forall ((v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1744 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1742 (Array Int Int))) (let ((.cse22 (select (store (store .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1740) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1746) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1744) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1742) .cse3) .cse4)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 (+ 8 v_arrayElimCell_49))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 (+ 8 v_arrayElimCell_51)))))))))))) (.cse6 (forall ((v_ArrVal_1740 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1737 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1737))) (or (forall ((v_ArrVal_1746 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1742 (Array Int Int))) (let ((.cse18 (select (store (store .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1740) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1746) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1744) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1742) .cse3) .cse4)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 (+ 8 v_arrayElimCell_52))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 (+ 8 v_arrayElimCell_49)))))) (not (= v_ArrVal_1740 (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1740 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1740 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))))))) (.cse10 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8)) (.cse14 (or (forall ((v_ArrVal_1746 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1740 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1737))) (or (not (= v_ArrVal_1740 (store (store (select .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1740 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1740 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1740) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1746) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1744) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1742) .cse3) .cse4)) (+ 8 v_arrayElimCell_52)))))) .cse5))) (and (or (and .cse0 (or (and (or (forall ((v_ArrVal_1746 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1740 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (or (not (= (store (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1740 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1740 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1740)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1737) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1740) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1746) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1744) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1742) .cse3) .cse4)) (+ 8 v_arrayElimCell_52))))) .cse5) .cse6) .cse7)) (= .cse3 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (or .cse8 (and (or (forall ((v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1740 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (let ((.cse9 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1737))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1740) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1746) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1744) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1742) .cse3) .cse4)) .cse10)) (not (= v_ArrVal_1740 (store (store (select .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1740 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1740 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))))) .cse7) (forall ((v_ArrVal_1740 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (let ((.cse11 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1737))) (or (not (= v_ArrVal_1740 (store (store (select .cse11 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1740 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1740 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (forall ((v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1744 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1742 (Array Int Int))) (let ((.cse12 (select (store (store .cse11 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1740) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1746) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1744) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1742) .cse3) .cse4)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 .cse10)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 (+ 8 v_arrayElimCell_51))))))))))) (or (not .cse7) (forall ((v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1744 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1740 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (let ((.cse13 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1737))) (or (not (= v_ArrVal_1740 (store (store (select .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1740 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1740 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1740) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1746) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1744) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1742) .cse3) .cse4)) (+ 8 v_arrayElimCell_51))))))) (or (= .cse4 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) (and .cse0 (or (and .cse6 .cse14) .cse7))) (or (and (forall ((v_ArrVal_1740 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1737))) (or (not (= v_ArrVal_1740 (store (store (select .cse15 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1740 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1740 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (forall ((v_ArrVal_1746 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1742 (Array Int Int))) (let ((.cse16 (select (store (store .cse15 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1740) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1746) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1744) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1742) .cse3) .cse4)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 .cse10)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 (+ 8 v_arrayElimCell_52))))))))) .cse14) .cse7)))))) is different from false [2024-11-13 14:30:53,963 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse24 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse2 (select .cse24 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse14 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse4))) (let ((.cse15 (not .cse14)) (.cse0 (= .cse2 .cse4)) (.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse24 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4))) (let ((.cse7 (or .cse14 (and (or (forall ((v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1740 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1737 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1737))) (or (not (= (store (store (select .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_1740 .cse6)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1740 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1740)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1740) .cse2 v_ArrVal_1746) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1744) .cse2 v_ArrVal_1742) .cse4) .cse5)) (+ 8 v_arrayElimCell_49)))))) .cse0) (forall ((v_ArrVal_1740 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1737 (Array Int Int))) (let ((.cse23 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1737))) (or (forall ((v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1744 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1742 (Array Int Int))) (let ((.cse22 (select (store (store .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1740) .cse2 v_ArrVal_1746) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1744) .cse2 v_ArrVal_1742) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 (+ 8 v_arrayElimCell_51))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 (+ 8 v_arrayElimCell_49)))))) (not (= (store (store (select .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_1740 .cse6)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1740 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1740)))))))) (.cse8 (forall ((v_ArrVal_1740 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1737 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1737))) (or (not (= (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_1740 .cse6)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1740 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1740)) (forall ((v_ArrVal_1746 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1742 (Array Int Int))) (let ((.cse20 (select (store (store .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1740) .cse2 v_ArrVal_1746) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1744) .cse2 v_ArrVal_1742) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 (+ 8 v_arrayElimCell_52))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 (+ 8 v_arrayElimCell_49)))))))))) (.cse11 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8)) (.cse9 (or .cse15 (forall ((v_ArrVal_1746 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1740 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1737))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse18 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1740) .cse2 v_ArrVal_1746) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1744) .cse2 v_ArrVal_1742) .cse4) .cse5)) (+ 8 v_arrayElimCell_52))) (not (= (store (store (select .cse18 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_1740 .cse6)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1740 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1740)))))))) (and (or (not .cse0) (forall ((v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1744 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1740 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (let ((.cse1 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1737))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1740) .cse2 v_ArrVal_1746) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1744) .cse2 v_ArrVal_1742) .cse4) .cse5)) (+ 8 v_arrayElimCell_51))) (not (= (store (store (select .cse1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_1740 .cse6)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1740 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1740)))))) (or (= .cse5 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) (and .cse7 (or .cse0 (and .cse8 .cse9)))) (or (and (or (forall ((v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1740 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1737))) (or (= (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1740) .cse2 v_ArrVal_1746) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1744) .cse2 v_ArrVal_1742) .cse4) .cse5)) .cse11) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (store (select .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_1740 .cse6)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1740 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1740))))) .cse0) (forall ((v_ArrVal_1740 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (let ((.cse12 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1737))) (or (not (= (store (store (select .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_1740 .cse6)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1740 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1740)) (forall ((v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1744 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1742 (Array Int Int))) (let ((.cse13 (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1740) .cse2 v_ArrVal_1746) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1744) .cse2 v_ArrVal_1742) .cse4) .cse5)))) (or (= (select .cse13 .cse11) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 (+ 8 v_arrayElimCell_51)))))))))) .cse14) (or (= .cse4 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (and .cse7 (or .cse0 (and (or .cse15 (forall ((v_ArrVal_1746 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1740 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1737) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1740) .cse2 v_ArrVal_1746) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1744) .cse2 v_ArrVal_1742) .cse4) .cse5)) (+ 8 v_arrayElimCell_52))) (not (= (store (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_1740 .cse6)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1740 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1740))))) .cse8)))) (or .cse0 (and (forall ((v_ArrVal_1740 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1737))) (or (forall ((v_ArrVal_1746 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1742 (Array Int Int))) (let ((.cse16 (select (store (store .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1740) .cse2 v_ArrVal_1746) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1744) .cse2 v_ArrVal_1742) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 (+ 8 v_arrayElimCell_52))) (= (select .cse16 .cse11) |c_ULTIMATE.start_main_~uneq~0#1|)))) (not (= (store (store (select .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_1740 .cse6)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1740 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1740))))) .cse9))))))) is different from false [2024-11-13 14:30:54,515 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse26 (select |c_#memory_$Pointer$#2.base| .cse13)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse12 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse17 (= .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (.cse10 (select .cse26 .cse5))) (let ((.cse2 (= .cse10 .cse12)) (.cse7 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 4)) (.cse11 (store |c_#memory_$Pointer$#2.base| .cse13 (store .cse26 .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse19 (not .cse17))) (let ((.cse0 (or (forall ((v_ArrVal_1746 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1740 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (let ((.cse25 (store |c_#memory_int#2| .cse13 v_ArrVal_1737))) (or (not (= v_ArrVal_1740 (store (store (select .cse25 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 (select v_ArrVal_1740 .cse7)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1740 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse25 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1740) .cse10 v_ArrVal_1746) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1744) .cse10 v_ArrVal_1742) .cse12) .cse4)) (+ 8 v_arrayElimCell_52)))))) .cse19)) (.cse9 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 8)) (.cse1 (forall ((v_ArrVal_1740 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1737 (Array Int Int))) (let ((.cse23 (store |c_#memory_int#2| .cse13 v_ArrVal_1737))) (or (not (= v_ArrVal_1740 (store (store (select .cse23 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 (select v_ArrVal_1740 .cse7)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1740 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (forall ((v_ArrVal_1746 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1742 (Array Int Int))) (let ((.cse24 (select (store (store .cse23 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1740) .cse10 v_ArrVal_1746) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1744) .cse10 v_ArrVal_1742) .cse12) .cse4)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 (+ 8 v_arrayElimCell_49))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 (+ 8 v_arrayElimCell_52)))))))))) (.cse3 (or .cse17 (and (or (forall ((v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1740 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1737 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#2| .cse13 v_ArrVal_1737))) (or (not (= v_ArrVal_1740 (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 (select v_ArrVal_1740 .cse7)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1740 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse20 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1740) .cse10 v_ArrVal_1746) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1744) .cse10 v_ArrVal_1742) .cse12) .cse4)) (+ 8 v_arrayElimCell_49)))))) .cse2) (forall ((v_ArrVal_1740 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1737 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#2| .cse13 v_ArrVal_1737))) (or (forall ((v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1744 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1742 (Array Int Int))) (let ((.cse21 (select (store (store .cse22 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1740) .cse10 v_ArrVal_1746) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1744) .cse10 v_ArrVal_1742) .cse12) .cse4)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 (+ 8 v_arrayElimCell_51))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 (+ 8 v_arrayElimCell_49)))))) (not (= v_ArrVal_1740 (store (store (select .cse22 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 (select v_ArrVal_1740 .cse7)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1740 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|))))))))))) (and (or (and (or (and .cse0 .cse1) .cse2) .cse3) (= .cse4 .cse5)) (or (and (forall ((v_ArrVal_1740 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (let ((.cse6 (store |c_#memory_int#2| .cse13 v_ArrVal_1737))) (or (not (= v_ArrVal_1740 (store (store (select .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 (select v_ArrVal_1740 .cse7)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1740 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (forall ((v_ArrVal_1746 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1742 (Array Int Int))) (let ((.cse8 (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1740) .cse10 v_ArrVal_1746) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1744) .cse10 v_ArrVal_1742) .cse12) .cse4)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse8 .cse9)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse8 (+ 8 v_arrayElimCell_52))))))))) .cse0) .cse2) (or (and (or (forall ((v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1740 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#2| .cse13 v_ArrVal_1737))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1740) .cse10 v_ArrVal_1746) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1744) .cse10 v_ArrVal_1742) .cse12) .cse4)) .cse9)) (not (= v_ArrVal_1740 (store (store (select .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 (select v_ArrVal_1740 .cse7)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1740 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|))))))) .cse2) (forall ((v_ArrVal_1740 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#2| .cse13 v_ArrVal_1737))) (or (not (= v_ArrVal_1740 (store (store (select .cse15 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 (select v_ArrVal_1740 .cse7)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1740 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (forall ((v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1744 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1742 (Array Int Int))) (let ((.cse16 (select (store (store .cse15 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1740) .cse10 v_ArrVal_1746) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1744) .cse10 v_ArrVal_1742) .cse12) .cse4)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 (+ 8 v_arrayElimCell_51))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 .cse9))))))))) .cse17) (or (forall ((v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1744 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1740 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#2| .cse13 v_ArrVal_1737))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse18 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1740) .cse10 v_ArrVal_1746) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1744) .cse10 v_ArrVal_1742) .cse12) .cse4)) (+ 8 v_arrayElimCell_51))) (not (= v_ArrVal_1740 (store (store (select .cse18 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 (select v_ArrVal_1740 .cse7)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1740 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|))))))) (not .cse2)) (or (= .cse13 .cse12) (and (or .cse2 (and (or (forall ((v_ArrVal_1746 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1740 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#2| .cse13 v_ArrVal_1737) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1740) .cse10 v_ArrVal_1746) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1744) .cse10 v_ArrVal_1742) .cse12) .cse4)) (+ 8 v_arrayElimCell_52))) (not (= (store (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 (select v_ArrVal_1740 .cse7)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1740 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1740)))) .cse19) .cse1)) .cse3)))))))) is different from false [2024-11-13 14:31:01,053 WARN L286 SmtUtils]: Spent 6.09s on a formula simplification. DAG size of input: 590 DAG size of output: 239 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-13 14:31:01,053 INFO L349 Elim1Store]: treesize reduction 10985, result has 18.2 percent of original size [2024-11-13 14:31:01,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 15 new quantified variables, introduced 106 case distinctions, treesize of input 67010 treesize of output 65989 [2024-11-13 14:31:01,525 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 19384 treesize of output 19380 [2024-11-13 14:31:01,830 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 19380 treesize of output 19364 [2024-11-13 14:31:02,824 INFO L224 Elim1Store]: Index analysis took 665 ms [2024-11-13 14:31:05,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:31:05,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 21273 treesize of output 30685 [2024-11-13 14:31:07,225 INFO L349 Elim1Store]: treesize reduction 76, result has 46.9 percent of original size [2024-11-13 14:31:07,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 19676 treesize of output 19725 [2024-11-13 14:31:07,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:31:07,840 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 19658 treesize of output 19635 [2024-11-13 14:31:08,485 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 19626 treesize of output 19610 [2024-11-13 14:31:09,178 INFO L349 Elim1Store]: treesize reduction 38, result has 50.0 percent of original size [2024-11-13 14:31:09,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19610 treesize of output 19634 [2024-11-13 14:31:10,326 INFO L349 Elim1Store]: treesize reduction 76, result has 46.9 percent of original size [2024-11-13 14:31:10,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 19596 treesize of output 19645 [2024-11-13 14:31:11,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:31:11,111 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 19578 treesize of output 19555 [2024-11-13 14:31:11,903 INFO L349 Elim1Store]: treesize reduction 38, result has 50.0 percent of original size [2024-11-13 14:31:11,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19546 treesize of output 19570 [2024-11-13 14:31:12,635 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 19532 treesize of output 19516 [2024-11-13 14:31:13,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:31:13,360 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 19516 treesize of output 19501 [2024-11-13 14:31:14,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:31:14,107 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 19492 treesize of output 19477 [2024-11-13 14:31:15,090 INFO L349 Elim1Store]: treesize reduction 46, result has 48.9 percent of original size [2024-11-13 14:31:15,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 19468 treesize of output 19496 [2024-11-13 14:31:16,563 INFO L349 Elim1Store]: treesize reduction 38, result has 50.0 percent of original size [2024-11-13 14:31:16,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19454 treesize of output 19478 [2024-11-13 14:31:17,374 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 19440 treesize of output 19424 [2024-11-13 14:31:18,464 INFO L349 Elim1Store]: treesize reduction 46, result has 48.9 percent of original size [2024-11-13 14:31:18,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 19424 treesize of output 19452 [2024-11-13 14:31:19,925 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 19410 treesize of output 19402 [2024-11-13 14:31:20,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:31:20,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19402 treesize of output 19413 [2024-11-13 14:31:22,535 INFO L349 Elim1Store]: treesize reduction 76, result has 46.9 percent of original size [2024-11-13 14:31:22,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 19392 treesize of output 19441 [2024-11-13 14:31:23,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:31:23,840 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 19374 treesize of output 19351 [2024-11-13 14:31:25,247 INFO L349 Elim1Store]: treesize reduction 76, result has 46.9 percent of original size [2024-11-13 14:31:25,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 19342 treesize of output 19391 [2024-11-13 14:31:26,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:31:26,691 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 19324 treesize of output 19301 [2024-11-13 14:31:28,088 INFO L349 Elim1Store]: treesize reduction 38, result has 50.0 percent of original size [2024-11-13 14:31:28,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19292 treesize of output 19316 [2024-11-13 14:31:29,463 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 19278 treesize of output 19262 [2024-11-13 14:31:31,024 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 19262 treesize of output 19246 [2024-11-13 14:31:32,244 INFO L349 Elim1Store]: treesize reduction 38, result has 50.0 percent of original size [2024-11-13 14:31:32,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19246 treesize of output 19270 [2024-11-13 14:37:05,935 WARN L286 SmtUtils]: Spent 5.75s on a formula simplification. DAG size of input: 862 DAG size of output: 1116 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:39:47,673 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-13 14:39:47,673 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/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 14:39:47,674 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-13 14:39:47,691 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 14:39:47,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-13 14:39:47,875 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_bd37033f-0c75-48bc-8719-bafbed5a5c77/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.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:590) 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.transform(TermContextTransformationEngine.java:88) 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:360) 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) ... 68 more [2024-11-13 14:39:47,881 INFO L158 Benchmark]: Toolchain (without parser) took 600403.18ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 92.4MB in the beginning and 624.2MB in the end (delta: -531.8MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-13 14:39:47,881 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 167.8MB. Free memory is still 103.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:39:47,883 INFO L158 Benchmark]: CACSL2BoogieTranslator took 613.07ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 73.9MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:39:47,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.52ms. Allocated memory is still 117.4MB. Free memory was 73.9MB in the beginning and 71.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:39:47,883 INFO L158 Benchmark]: Boogie Preprocessor took 96.14ms. Allocated memory is still 117.4MB. Free memory was 71.6MB in the beginning and 68.5MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:39:47,884 INFO L158 Benchmark]: RCFGBuilder took 764.28ms. Allocated memory is still 117.4MB. Free memory was 68.5MB in the beginning and 47.7MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:39:47,884 INFO L158 Benchmark]: TraceAbstraction took 598860.70ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 47.4MB in the beginning and 624.2MB in the end (delta: -576.8MB). Peak memory consumption was 980.6MB. Max. memory is 16.1GB. [2024-11-13 14:39:47,886 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.42ms. Allocated memory is still 167.8MB. Free memory is still 103.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 613.07ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 73.9MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.52ms. Allocated memory is still 117.4MB. Free memory was 73.9MB in the beginning and 71.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 96.14ms. Allocated memory is still 117.4MB. Free memory was 71.6MB in the beginning and 68.5MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 764.28ms. Allocated memory is still 117.4MB. Free memory was 68.5MB in the beginning and 47.7MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 598860.70ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 47.4MB in the beginning and 624.2MB in the end (delta: -576.8MB). Peak memory consumption was 980.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_bd37033f-0c75-48bc-8719-bafbed5a5c77/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_bd37033f-0c75-48bc-8719-bafbed5a5c77/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_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/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_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/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_bd37033f-0c75-48bc-8719-bafbed5a5c77/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 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:39:50,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:39:50,896 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 14:39:50,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:39:50,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:39:50,931 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:39:50,932 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:39:50,932 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:39:50,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:39:50,933 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:39:50,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:39:50,933 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:39:50,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:39:50,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:39:50,934 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:39:50,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:39:50,935 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:39:50,935 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:39:50,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:39:50,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:39:50,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:39:50,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:39:50,936 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:39:50,936 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:39:50,936 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:39:50,936 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:39:50,936 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:39:50,937 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:39:50,937 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:39:50,937 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:39:50,937 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:39:50,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:39:50,938 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:39:50,938 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:39:50,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:39:50,938 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:39:50,938 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:39:50,939 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:39:50,939 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:39:50,939 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:39:50,939 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:39:50,939 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:39:50,939 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:39:50,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:39:50,940 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_bd37033f-0c75-48bc-8719-bafbed5a5c77/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 -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2024-11-13 14:39:51,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:39:51,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:39:51,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:39:51,307 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:39:51,308 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:39:51,313 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i Unable to find full path for "g++" [2024-11-13 14:39:53,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:39:53,781 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:39:53,782 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2024-11-13 14:39:53,797 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/data/d0acff411/2badf94d7a1a42389227b27ac6b71ff1/FLAG8b3f31898 [2024-11-13 14:39:53,820 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/data/d0acff411/2badf94d7a1a42389227b27ac6b71ff1 [2024-11-13 14:39:53,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:39:53,824 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:39:53,826 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:39:53,826 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:39:53,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:39:53,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:39:53" (1/1) ... [2024-11-13 14:39:53,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d86e4d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:39:53, skipping insertion in model container [2024-11-13 14:39:53,835 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:39:53" (1/1) ... [2024-11-13 14:39:53,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:39:54,409 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_bd37033f-0c75-48bc-8719-bafbed5a5c77/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2024-11-13 14:39:54,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:39:54,439 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:39:54,544 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_bd37033f-0c75-48bc-8719-bafbed5a5c77/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2024-11-13 14:39:54,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:39:54,595 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:39:54,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:39:54 WrapperNode [2024-11-13 14:39:54,596 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:39:54,597 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:39:54,597 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:39:54,597 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:39:54,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:39:54" (1/1) ... [2024-11-13 14:39:54,630 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:39:54" (1/1) ... [2024-11-13 14:39:54,661 INFO L138 Inliner]: procedures = 130, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 183 [2024-11-13 14:39:54,665 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:39:54,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:39:54,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:39:54,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:39:54,678 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:39:54" (1/1) ... [2024-11-13 14:39:54,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:39:54" (1/1) ... [2024-11-13 14:39:54,687 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:39:54" (1/1) ... [2024-11-13 14:39:54,727 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 26, 12]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 18 writes are split as follows [0, 17, 1]. [2024-11-13 14:39:54,727 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:39:54" (1/1) ... [2024-11-13 14:39:54,727 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:39:54" (1/1) ... [2024-11-13 14:39:54,743 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:39:54" (1/1) ... [2024-11-13 14:39:54,747 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:39:54" (1/1) ... [2024-11-13 14:39:54,749 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:39:54" (1/1) ... [2024-11-13 14:39:54,751 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:39:54" (1/1) ... [2024-11-13 14:39:54,755 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:39:54,756 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:39:54,756 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:39:54,756 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:39:54,757 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:39:54" (1/1) ... [2024-11-13 14:39:54,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:39:54,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:39:54,796 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:39:54,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:39:54,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-13 14:39:54,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-13 14:39:54,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-13 14:39:54,828 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-13 14:39:54,828 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-13 14:39:54,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 14:39:54,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:39:54,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 14:39:54,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 14:39:54,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 14:39:54,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 14:39:54,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 14:39:54,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 14:39:54,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 14:39:54,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 14:39:54,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-13 14:39:54,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-13 14:39:54,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-13 14:39:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-13 14:39:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-13 14:39:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-13 14:39:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:39:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 14:39:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-13 14:39:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:39:54,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:39:55,019 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:39:55,021 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:39:56,002 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-11-13 14:39:56,002 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:39:56,015 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:39:56,017 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-13 14:39:56,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:39:56 BoogieIcfgContainer [2024-11-13 14:39:56,017 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:39:56,021 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:39:56,021 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:39:56,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:39:56,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:39:53" (1/3) ... [2024-11-13 14:39:56,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625aa66a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:39:56, skipping insertion in model container [2024-11-13 14:39:56,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:39:54" (2/3) ... [2024-11-13 14:39:56,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625aa66a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:39:56, skipping insertion in model container [2024-11-13 14:39:56,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:39:56" (3/3) ... [2024-11-13 14:39:56,030 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2024-11-13 14:39:56,046 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:39:56,051 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_insert_unequal.i that has 2 procedures, 42 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2024-11-13 14:39:56,119 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:39:56,133 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;@1e9cfbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:39:56,133 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:39:56,138 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 37 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:39:56,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 14:39:56,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:39:56,146 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] [2024-11-13 14:39:56,147 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:39:56,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:39:56,152 INFO L85 PathProgramCache]: Analyzing trace with hash 828589496, now seen corresponding path program 1 times [2024-11-13 14:39:56,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:39:56,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1938082101] [2024-11-13 14:39:56,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:39:56,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:39:56,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:39:56,170 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:39:56,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:39:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:39:56,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 14:39:56,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:39:56,466 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:39:56,466 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:39:56,467 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:39:56,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938082101] [2024-11-13 14:39:56,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938082101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:39:56,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:39:56,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:39:56,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619511417] [2024-11-13 14:39:56,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:39:56,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:39:56,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:39:56,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:39:56,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:39:56,495 INFO L87 Difference]: Start difference. First operand has 42 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 37 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:39:56,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:39:56,513 INFO L93 Difference]: Finished difference Result 75 states and 110 transitions. [2024-11-13 14:39:56,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:39:56,515 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-11-13 14:39:56,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:39:56,521 INFO L225 Difference]: With dead ends: 75 [2024-11-13 14:39:56,522 INFO L226 Difference]: Without dead ends: 34 [2024-11-13 14:39:56,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 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 14:39:56,528 INFO L432 NwaCegarLoop]: 56 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, 56 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 14:39:56,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:39:56,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-13 14:39:56,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-13 14:39:56,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:39:56,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2024-11-13 14:39:56,563 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 25 [2024-11-13 14:39:56,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:39:56,564 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2024-11-13 14:39:56,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:39:56,565 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2024-11-13 14:39:56,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 14:39:56,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:39:56,566 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] [2024-11-13 14:39:56,587 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:39:56,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:39:56,767 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:39:56,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:39:56,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1124400795, now seen corresponding path program 1 times [2024-11-13 14:39:56,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:39:56,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [310694139] [2024-11-13 14:39:56,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:39:56,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:39:56,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:39:56,771 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:39:56,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:39:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:39:56,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:39:56,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:39:57,052 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 14:39:57,052 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:39:57,053 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:39:57,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310694139] [2024-11-13 14:39:57,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310694139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:39:57,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:39:57,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:39:57,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121740294] [2024-11-13 14:39:57,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:39:57,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:39:57,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:39:57,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:39:57,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:39:57,056 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 14:39:57,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:39:57,325 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2024-11-13 14:39:57,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:39:57,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-13 14:39:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:39:57,326 INFO L225 Difference]: With dead ends: 48 [2024-11-13 14:39:57,327 INFO L226 Difference]: Without dead ends: 36 [2024-11-13 14:39:57,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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 14:39:57,328 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 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.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:39:57,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:39:57,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-13 14:39:57,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-13 14:39:57,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:39:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2024-11-13 14:39:57,336 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 25 [2024-11-13 14:39:57,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:39:57,337 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2024-11-13 14:39:57,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 14:39:57,337 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2024-11-13 14:39:57,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 14:39:57,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:39:57,339 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 14:39:57,354 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 14:39:57,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:39:57,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:39:57,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:39:57,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1039005390, now seen corresponding path program 1 times [2024-11-13 14:39:57,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:39:57,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [314975391] [2024-11-13 14:39:57,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:39:57,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:39:57,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:39:57,547 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:39:57,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 14:39:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:39:57,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:39:57,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:39:57,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 14:39:57,813 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:39:57,813 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:39:57,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314975391] [2024-11-13 14:39:57,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314975391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:39:57,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:39:57,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:39:57,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852377833] [2024-11-13 14:39:57,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:39:57,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:39:57,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:39:57,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:39:57,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:39:57,815 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:39:57,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:39:57,853 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2024-11-13 14:39:57,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:39:57,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-11-13 14:39:57,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:39:57,855 INFO L225 Difference]: With dead ends: 68 [2024-11-13 14:39:57,856 INFO L226 Difference]: Without dead ends: 41 [2024-11-13 14:39:57,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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 14:39:57,857 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 81 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 14:39:57,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 81 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:39:57,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-13 14:39:57,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2024-11-13 14:39:57,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:39:57,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2024-11-13 14:39:57,870 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 26 [2024-11-13 14:39:57,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:39:57,871 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2024-11-13 14:39:57,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:39:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2024-11-13 14:39:57,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 14:39:57,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:39:57,873 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:39:57,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-13 14:39:58,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:39:58,074 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:39:58,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:39:58,075 INFO L85 PathProgramCache]: Analyzing trace with hash 553609090, now seen corresponding path program 1 times [2024-11-13 14:39:58,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:39:58,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [419671950] [2024-11-13 14:39:58,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:39:58,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:39:58,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:39:58,078 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:39:58,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 14:39:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:39:58,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-13 14:39:58,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:39:58,395 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 14:39:58,790 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 14:39:59,022 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-13 14:39:59,022 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 14:39:59,183 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 14:39:59,214 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 14:39:59,383 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 14:39:59,418 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 14:39:59,871 INFO L349 Elim1Store]: treesize reduction 68, result has 9.3 percent of original size [2024-11-13 14:39:59,872 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 43 [2024-11-13 14:39:59,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:39:59,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2024-11-13 14:39:59,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2024-11-13 14:40:00,305 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 32 treesize of output 16 [2024-11-13 14:40:00,320 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 19 treesize of output 11 [2024-11-13 14:40:00,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:40:00,835 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 40 treesize of output 29 [2024-11-13 14:40:00,897 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-13 14:40:00,897 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 32 treesize of output 34 [2024-11-13 14:40:00,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-13 14:40:01,503 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 40 treesize of output 16 [2024-11-13 14:40:01,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2024-11-13 14:40:01,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2024-11-13 14:40:02,048 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 14:40:02,181 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 14:40:02,295 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:40:02,297 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:40:07,625 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_320 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_324 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_10| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_10|))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (store (store (store |c_#memory_int#1| .cse0 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_10| v_ArrVal_331) .cse0) .cse1 v_ArrVal_324)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_10| v_ArrVal_323) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_10| v_ArrVal_332) .cse0) .cse1) v_ArrVal_320)) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|))) is different from false [2024-11-13 14:40:07,633 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:40:07,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419671950] [2024-11-13 14:40:07,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419671950] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:40:07,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [240738495] [2024-11-13 14:40:07,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:40:07,633 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 14:40:07,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/cvc4 [2024-11-13 14:40:07,642 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 14:40:07,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-13 14:40:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:40:08,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-13 14:40:08,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:40:08,449 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 14:40:08,877 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 14:40:09,012 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-13 14:40:09,012 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 14:40:09,246 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 14:40:09,276 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 14:40:09,488 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 14:40:09,531 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 14:40:10,082 INFO L349 Elim1Store]: treesize reduction 54, result has 8.5 percent of original size [2024-11-13 14:40:10,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 89 treesize of output 86 [2024-11-13 14:40:10,103 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2024-11-13 14:40:10,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 66 [2024-11-13 14:40:10,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:40:10,122 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 28 treesize of output 25 [2024-11-13 14:40:10,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2024-11-13 14:40:10,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2024-11-13 14:40:10,677 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 32 treesize of output 16 [2024-11-13 14:40:10,686 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 19 treesize of output 11 [2024-11-13 14:40:10,693 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 11 treesize of output 3 [2024-11-13 14:40:15,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:40:15,295 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 40 treesize of output 29 [2024-11-13 14:40:15,358 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-13 14:40:15,358 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 32 treesize of output 34 [2024-11-13 14:40:15,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-13 14:40:16,083 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 40 treesize of output 16 [2024-11-13 14:40:16,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 26 [2024-11-13 14:40:16,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2024-11-13 14:40:16,752 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 14:40:17,065 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:40:17,065 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:40:17,128 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_452 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_450 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)) v_ArrVal_450)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_450) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_452) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_451) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|))) is different from false [2024-11-13 14:40:17,184 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_452 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_450 (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select v_ArrVal_450 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_450) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_452) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) v_ArrVal_451) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2024-11-13 14:40:17,219 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_452 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_450) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_452) (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1) v_ArrVal_451) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= v_ArrVal_450 (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_450 .cse1))))))) is different from false [2024-11-13 14:40:17,425 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_452 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_14| (_ BitVec 32)) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_14|) (_ bv0 1))) (not (= v_ArrVal_450 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_14| v_ArrVal_460) .cse0) .cse1 (select v_ArrVal_450 .cse1)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_450) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_14| v_ArrVal_452) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_14| v_ArrVal_459) .cse0) .cse1) v_ArrVal_451) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2024-11-13 14:40:17,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [240738495] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:40:17,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:40:17,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 43 [2024-11-13 14:40:17,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336850023] [2024-11-13 14:40:17,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:40:17,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-13 14:40:17,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:40:17,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-13 14:40:17,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2080, Unknown=32, NotChecked=480, Total=2756 [2024-11-13 14:40:17,440 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 43 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 34 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:40:36,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:40:36,246 INFO L93 Difference]: Finished difference Result 78 states and 105 transitions. [2024-11-13 14:40:36,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 14:40:36,248 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 34 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2024-11-13 14:40:36,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:40:36,251 INFO L225 Difference]: With dead ends: 78 [2024-11-13 14:40:36,252 INFO L226 Difference]: Without dead ends: 76 [2024-11-13 14:40:36,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=262, Invalid=3266, Unknown=32, NotChecked=600, Total=4160 [2024-11-13 14:40:36,255 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 99 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:40:36,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 380 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 17.2s Time] [2024-11-13 14:40:36,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-13 14:40:36,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2024-11-13 14:40:36,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:40:36,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2024-11-13 14:40:36,268 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 75 transitions. Word has length 36 [2024-11-13 14:40:36,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:40:36,268 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 75 transitions. [2024-11-13 14:40:36,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 34 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:40:36,269 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2024-11-13 14:40:36,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 14:40:36,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:40:36,270 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:40:36,276 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-13 14:40:36,484 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 14:40:36,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:40:36,671 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:40:36,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:40:36,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1217636407, now seen corresponding path program 1 times [2024-11-13 14:40:36,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:40:36,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [151354793] [2024-11-13 14:40:36,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:40:36,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:40:36,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:40:36,674 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:40:36,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 14:40:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:40:36,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:40:36,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:40:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 14:40:36,912 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:40:36,912 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:40:36,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151354793] [2024-11-13 14:40:36,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151354793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:40:36,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:40:36,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:40:36,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431177656] [2024-11-13 14:40:36,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:40:36,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:40:36,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:40:36,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:40:36,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:40:36,914 INFO L87 Difference]: Start difference. First operand 57 states and 75 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 14:40:36,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:40:36,955 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2024-11-13 14:40:36,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:40:36,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-11-13 14:40:36,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:40:36,957 INFO L225 Difference]: With dead ends: 73 [2024-11-13 14:40:36,957 INFO L226 Difference]: Without dead ends: 58 [2024-11-13 14:40:36,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:40:36,958 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 26 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:40:36,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 89 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:40:36,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-13 14:40:36,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2024-11-13 14:40:36,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 states have internal predecessors, (62), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:40:36,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2024-11-13 14:40:36,970 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 37 [2024-11-13 14:40:36,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:40:36,970 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2024-11-13 14:40:36,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 14:40:36,970 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2024-11-13 14:40:36,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 14:40:36,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:40:36,971 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:40:36,991 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 14:40:37,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:40:37,172 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:40:37,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:40:37,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1517704273, now seen corresponding path program 2 times [2024-11-13 14:40:37,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:40:37,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2012105632] [2024-11-13 14:40:37,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:40:37,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:40:37,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:40:37,176 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:40:37,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 14:40:37,793 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 14:40:37,793 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:40:37,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 14:40:37,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:40:37,857 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 14:40:37,858 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:40:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 14:40:38,051 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:40:38,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012105632] [2024-11-13 14:40:38,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012105632] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:40:38,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:40:38,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-13 14:40:38,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511322152] [2024-11-13 14:40:38,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:40:38,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:40:38,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:40:38,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:40:38,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:40:38,056 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-13 14:40:38,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:40:38,144 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2024-11-13 14:40:38,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:40:38,145 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2024-11-13 14:40:38,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:40:38,146 INFO L225 Difference]: With dead ends: 74 [2024-11-13 14:40:38,146 INFO L226 Difference]: Without dead ends: 58 [2024-11-13 14:40:38,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:40:38,146 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 50 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:40:38,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 127 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:40:38,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-13 14:40:38,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2024-11-13 14:40:38,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:40:38,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2024-11-13 14:40:38,169 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 37 [2024-11-13 14:40:38,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:40:38,172 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2024-11-13 14:40:38,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-13 14:40:38,172 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2024-11-13 14:40:38,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 14:40:38,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:40:38,173 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:40:38,199 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 14:40:38,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:40:38,374 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:40:38,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:40:38,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1039816008, now seen corresponding path program 1 times [2024-11-13 14:40:38,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:40:38,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1343292245] [2024-11-13 14:40:38,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:40:38,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:40:38,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:40:38,377 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:40:38,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 14:40:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:40:38,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-13 14:40:38,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:40:38,778 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 14:40:38,833 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 14:40:38,833 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:40:38,911 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 14:40:38,911 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:40:38,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343292245] [2024-11-13 14:40:38,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343292245] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:40:38,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:40:38,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 12 [2024-11-13 14:40:38,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180878091] [2024-11-13 14:40:38,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:40:38,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 14:40:38,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:40:38,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 14:40:38,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:40:38,913 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 14:40:43,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:40:47,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:40:53,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:40:53,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:40:53,735 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2024-11-13 14:40:53,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 14:40:53,736 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2024-11-13 14:40:53,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:40:53,736 INFO L225 Difference]: With dead ends: 90 [2024-11-13 14:40:53,736 INFO L226 Difference]: Without dead ends: 59 [2024-11-13 14:40:53,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-11-13 14:40:53,737 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 23 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:40:53,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 316 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 3 Unknown, 0 Unchecked, 14.7s Time] [2024-11-13 14:40:53,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-13 14:40:53,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-13 14:40:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.16) internal successors, (58), 50 states have internal predecessors, (58), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:40:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2024-11-13 14:40:53,749 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 38 [2024-11-13 14:40:53,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:40:53,750 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2024-11-13 14:40:53,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 14:40:53,750 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2024-11-13 14:40:53,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 14:40:53,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:40:53,751 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:40:53,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-13 14:40:53,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:40:53,952 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:40:53,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:40:53,952 INFO L85 PathProgramCache]: Analyzing trace with hash -105706485, now seen corresponding path program 1 times [2024-11-13 14:40:53,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:40:53,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [509888942] [2024-11-13 14:40:53,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:40:53,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:40:53,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:40:53,954 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:40:53,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 14:40:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:40:54,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-13 14:40:54,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:40:54,171 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 14:40:54,455 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-13 14:40:54,456 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 14:40:54,559 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 14:40:54,633 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 14:40:54,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:40:54,790 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 26 treesize of output 23 [2024-11-13 14:40:54,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2024-11-13 14:40:55,064 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 19 treesize of output 11 [2024-11-13 14:40:55,070 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 11 treesize of output 3 [2024-11-13 14:40:55,261 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 14:40:55,438 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-13 14:40:55,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-13 14:40:55,522 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-13 14:40:55,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 24 treesize of output 26 [2024-11-13 14:40:56,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:41:06,318 WARN L286 SmtUtils]: Spent 9.84s on a formula simplification. DAG size of input: 58 DAG size of output: 38 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-13 14:41:06,318 INFO L349 Elim1Store]: treesize reduction 126, result has 40.8 percent of original size [2024-11-13 14:41:06,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 313 treesize of output 345 [2024-11-13 14:41:06,931 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-13 14:41:06,932 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 1 case distinctions, treesize of input 113 treesize of output 33 [2024-11-13 14:41:06,974 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 0 case distinctions, treesize of input 53 treesize of output 33 [2024-11-13 14:41:08,049 INFO L349 Elim1Store]: treesize reduction 165, result has 22.5 percent of original size [2024-11-13 14:41:08,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 426 treesize of output 349 [2024-11-13 14:41:08,227 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 12 treesize of output 11 [2024-11-13 14:41:08,429 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 12 treesize of output 11 [2024-11-13 14:41:08,741 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 14:41:08,742 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 12 treesize of output 1 [2024-11-13 14:41:09,126 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 14:41:09,127 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 12 treesize of output 1 [2024-11-13 14:41:09,410 INFO L224 Elim1Store]: Index analysis took 107 ms [2024-11-13 14:41:09,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 189 [2024-11-13 14:41:10,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2024-11-13 14:41:11,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:41:11,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:41:11,886 INFO L349 Elim1Store]: treesize reduction 64, result has 15.8 percent of original size [2024-11-13 14:41:11,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 204 treesize of output 195 [2024-11-13 14:41:12,053 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 9 treesize of output 7 [2024-11-13 14:41:12,302 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 14:41:12,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 13 [2024-11-13 14:41:12,679 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 14:41:12,679 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 51 treesize of output 29 [2024-11-13 14:41:13,000 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:41:13,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509888942] [2024-11-13 14:41:13,001 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-13 14:41:13,023 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 14:41:13,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:41:13,202 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Complicated and unsupported kind of self-update: (select |#memory_$Pointer$#1.base| (select v_arrayElimCell_63 (_ bv0 32))) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.classify(DerPreprocessor.java:233) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.classify(DerPreprocessor.java:205) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:104) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:542) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:521) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:514) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:325) 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.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:290) 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.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) 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) [2024-11-13 14:41:13,207 INFO L158 Benchmark]: Toolchain (without parser) took 79383.13ms. Allocated memory was 83.9MB in the beginning and 151.0MB in the end (delta: 67.1MB). Free memory was 59.7MB in the beginning and 63.0MB in the end (delta: -3.4MB). Peak memory consumption was 85.7MB. Max. memory is 16.1GB. [2024-11-13 14:41:13,207 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 83.9MB. Free memory is still 64.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:41:13,207 INFO L158 Benchmark]: CACSL2BoogieTranslator took 770.26ms. Allocated memory is still 83.9MB. Free memory was 59.4MB in the beginning and 40.0MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:41:13,208 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.73ms. Allocated memory is still 83.9MB. Free memory was 40.0MB in the beginning and 37.8MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:41:13,208 INFO L158 Benchmark]: Boogie Preprocessor took 89.03ms. Allocated memory is still 83.9MB. Free memory was 37.8MB in the beginning and 34.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:41:13,209 INFO L158 Benchmark]: RCFGBuilder took 1261.53ms. Allocated memory is still 83.9MB. Free memory was 34.3MB in the beginning and 47.1MB in the end (delta: -12.8MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2024-11-13 14:41:13,210 INFO L158 Benchmark]: TraceAbstraction took 77185.85ms. Allocated memory was 83.9MB in the beginning and 151.0MB in the end (delta: 67.1MB). Free memory was 46.6MB in the beginning and 63.0MB in the end (delta: -16.5MB). Peak memory consumption was 72.2MB. Max. memory is 16.1GB. [2024-11-13 14:41:13,211 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 83.9MB. Free memory is still 64.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 770.26ms. Allocated memory is still 83.9MB. Free memory was 59.4MB in the beginning and 40.0MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.73ms. Allocated memory is still 83.9MB. Free memory was 40.0MB in the beginning and 37.8MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.03ms. Allocated memory is still 83.9MB. Free memory was 37.8MB in the beginning and 34.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1261.53ms. Allocated memory is still 83.9MB. Free memory was 34.3MB in the beginning and 47.1MB in the end (delta: -12.8MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * TraceAbstraction took 77185.85ms. Allocated memory was 83.9MB in the beginning and 151.0MB in the end (delta: 67.1MB). Free memory was 46.6MB in the beginning and 63.0MB in the end (delta: -16.5MB). Peak memory consumption was 72.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Complicated and unsupported kind of self-update: (select |#memory_$Pointer$#1.base| (select v_arrayElimCell_63 (_ bv0 32))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Complicated and unsupported kind of self-update: (select |#memory_$Pointer$#1.base| (select v_arrayElimCell_63 (_ bv0 32))): de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.classify(DerPreprocessor.java:233) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-13 14:41:13,239 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd37033f-0c75-48bc-8719-bafbed5a5c77/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Complicated and unsupported kind of self-update: (select |#memory_$Pointer$#1.base| (select v_arrayElimCell_63 (_ bv0 32)))