./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:33:41,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:33:41,176 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 03:33:41,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:33:41,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:33:41,228 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:33:41,229 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:33:41,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:33:41,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:33:41,230 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:33:41,230 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:33:41,230 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:33:41,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:33:41,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:33:41,231 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:33:41,231 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:33:41,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:33:41,232 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:33:41,233 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:33:41,233 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:33:41,233 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:33:41,233 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:33:41,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:33:41,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:33:41,233 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:33:41,233 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:33:41,234 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:33:41,234 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:33:41,234 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:33:41,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:33:41,234 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:33:41,234 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:33:41,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:33:41,234 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:33:41,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:33:41,234 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:33:41,234 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:33:41,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:33:41,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:33:41,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:33:41,235 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:33:41,235 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:33:41,235 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:33:41,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:33:41,235 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:33:41,235 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:33:41,235 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:33:41,235 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:33:41,235 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_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 [2024-11-28 03:33:41,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:33:41,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:33:41,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:33:41,543 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:33:41,543 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:33:41,544 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2024-11-28 03:33:44,523 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/data/cac589ce0/da612db56a364fc895bbfc8ca19c4996/FLAG3a09ffbfa [2024-11-28 03:33:44,869 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:33:44,870 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2024-11-28 03:33:44,888 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/data/cac589ce0/da612db56a364fc895bbfc8ca19c4996/FLAG3a09ffbfa [2024-11-28 03:33:44,916 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/data/cac589ce0/da612db56a364fc895bbfc8ca19c4996 [2024-11-28 03:33:44,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:33:44,922 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:33:44,923 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:33:44,924 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:33:44,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:33:44,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:33:44" (1/1) ... [2024-11-28 03:33:44,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11ca3f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:44, skipping insertion in model container [2024-11-28 03:33:44,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:33:44" (1/1) ... [2024-11-28 03:33:44,978 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:33:45,405 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_a8d09516-52a0-43d6-aac3-fce15443b40e/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i[24989,25002] [2024-11-28 03:33:45,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:33:45,426 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:33:45,493 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_a8d09516-52a0-43d6-aac3-fce15443b40e/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i[24989,25002] [2024-11-28 03:33:45,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:33:45,521 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:33:45,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:45 WrapperNode [2024-11-28 03:33:45,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:33:45,524 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:33:45,524 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:33:45,524 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:33:45,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:45" (1/1) ... [2024-11-28 03:33:45,542 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:45" (1/1) ... [2024-11-28 03:33:45,570 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 163 [2024-11-28 03:33:45,574 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:33:45,575 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:33:45,575 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:33:45,575 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:33:45,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:45" (1/1) ... [2024-11-28 03:33:45,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:45" (1/1) ... [2024-11-28 03:33:45,590 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:45" (1/1) ... [2024-11-28 03:33:45,612 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 8, 21]. 68 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 14 writes are split as follows [0, 1, 13]. [2024-11-28 03:33:45,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:45" (1/1) ... [2024-11-28 03:33:45,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:45" (1/1) ... [2024-11-28 03:33:45,622 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:45" (1/1) ... [2024-11-28 03:33:45,624 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:45" (1/1) ... [2024-11-28 03:33:45,627 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:45" (1/1) ... [2024-11-28 03:33:45,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:45" (1/1) ... [2024-11-28 03:33:45,630 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:45" (1/1) ... [2024-11-28 03:33:45,637 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:33:45,637 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:33:45,638 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:33:45,638 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:33:45,639 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:45" (1/1) ... [2024-11-28 03:33:45,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:33:45,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:33:45,678 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:33:45,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:33:45,714 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-28 03:33:45,718 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-28 03:33:45,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 03:33:45,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 03:33:45,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 03:33:45,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 03:33:45,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 03:33:45,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 03:33:45,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 03:33:45,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:33:45,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 03:33:45,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 03:33:45,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 03:33:45,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 03:33:45,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 03:33:45,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 03:33:45,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 03:33:45,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 03:33:45,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-28 03:33:45,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-28 03:33:45,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-28 03:33:45,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:33:45,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 03:33:45,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 03:33:45,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:33:45,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:33:45,873 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:33:45,875 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:33:45,905 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-28 03:33:46,180 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2024-11-28 03:33:46,181 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:33:46,191 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:33:46,191 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-28 03:33:46,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:33:46 BoogieIcfgContainer [2024-11-28 03:33:46,192 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:33:46,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:33:46,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:33:46,199 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:33:46,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:33:44" (1/3) ... [2024-11-28 03:33:46,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75eefe35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:33:46, skipping insertion in model container [2024-11-28 03:33:46,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:45" (2/3) ... [2024-11-28 03:33:46,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75eefe35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:33:46, skipping insertion in model container [2024-11-28 03:33:46,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:33:46" (3/3) ... [2024-11-28 03:33:46,202 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_insert_unequal.i [2024-11-28 03:33:46,217 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:33:46,218 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_insert_unequal.i that has 2 procedures, 42 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2024-11-28 03:33:46,272 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:33:46,286 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;@3d6c3aaf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:33:46,286 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 03:33:46,290 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 39 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:33:46,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-28 03:33:46,298 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:33:46,298 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:46,299 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:33:46,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:46,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1897789266, now seen corresponding path program 1 times [2024-11-28 03:33:46,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:46,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352351224] [2024-11-28 03:33:46,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:46,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:46,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:46,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:46,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352351224] [2024-11-28 03:33:46,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352351224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:46,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:46,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:33:46,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461517777] [2024-11-28 03:33:46,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:46,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 03:33:46,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:46,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 03:33:46,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 03:33:46,596 INFO L87 Difference]: Start difference. First operand has 41 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 39 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:33:46,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:33:46,613 INFO L93 Difference]: Finished difference Result 73 states and 107 transitions. [2024-11-28 03:33:46,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 03:33:46,615 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-28 03:33:46,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:33:46,619 INFO L225 Difference]: With dead ends: 73 [2024-11-28 03:33:46,620 INFO L226 Difference]: Without dead ends: 31 [2024-11-28 03:33:46,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 03:33:46,626 INFO L435 NwaCegarLoop]: 54 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, 54 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-28 03:33:46,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:33:46,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-28 03:33:46,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-28 03:33:46,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:33:46,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2024-11-28 03:33:46,658 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 16 [2024-11-28 03:33:46,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:33:46,658 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-11-28 03:33:46,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:33:46,659 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2024-11-28 03:33:46,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-28 03:33:46,661 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:33:46,661 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:46,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:33:46,661 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:33:46,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:46,662 INFO L85 PathProgramCache]: Analyzing trace with hash -882446612, now seen corresponding path program 1 times [2024-11-28 03:33:46,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:46,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062700742] [2024-11-28 03:33:46,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:46,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:46,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:46,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:46,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062700742] [2024-11-28 03:33:46,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062700742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:46,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:46,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:33:46,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687518821] [2024-11-28 03:33:46,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:46,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:33:46,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:46,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:33:46,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:46,961 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:33:46,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:33:46,994 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2024-11-28 03:33:46,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:33:46,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-28 03:33:46,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:33:46,996 INFO L225 Difference]: With dead ends: 60 [2024-11-28 03:33:46,996 INFO L226 Difference]: Without dead ends: 37 [2024-11-28 03:33:46,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:46,997 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 75 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-28 03:33:46,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 75 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:33:46,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-28 03:33:47,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2024-11-28 03:33:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:33:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2024-11-28 03:33:47,004 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 16 [2024-11-28 03:33:47,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:33:47,006 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-11-28 03:33:47,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:33:47,006 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-11-28 03:33:47,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-28 03:33:47,007 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:33:47,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:47,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:33:47,008 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:33:47,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:47,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1115900746, now seen corresponding path program 1 times [2024-11-28 03:33:47,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:47,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969879402] [2024-11-28 03:33:47,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:47,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:47,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:47,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:47,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969879402] [2024-11-28 03:33:47,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969879402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:47,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:47,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:33:47,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831073298] [2024-11-28 03:33:47,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:47,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:33:47,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:47,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:33:47,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:47,146 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:33:47,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:33:47,178 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2024-11-28 03:33:47,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:33:47,179 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-28 03:33:47,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:33:47,180 INFO L225 Difference]: With dead ends: 65 [2024-11-28 03:33:47,180 INFO L226 Difference]: Without dead ends: 36 [2024-11-28 03:33:47,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:47,181 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:33:47,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:33:47,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-28 03:33:47,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-28 03:33:47,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:33:47,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2024-11-28 03:33:47,187 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 22 [2024-11-28 03:33:47,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:33:47,188 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2024-11-28 03:33:47,188 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:33:47,188 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2024-11-28 03:33:47,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-28 03:33:47,189 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:33:47,189 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:47,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:33:47,189 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:33:47,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:47,190 INFO L85 PathProgramCache]: Analyzing trace with hash -2136969100, now seen corresponding path program 1 times [2024-11-28 03:33:47,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:47,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401901222] [2024-11-28 03:33:47,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:47,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:47,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:47,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:47,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401901222] [2024-11-28 03:33:47,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401901222] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:33:47,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425207454] [2024-11-28 03:33:47,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:47,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:33:47,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:33:47,418 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:33:47,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:33:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:47,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 03:33:47,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:33:47,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:47,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:33:47,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:47,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425207454] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:33:47,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:33:47,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-28 03:33:47,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476331666] [2024-11-28 03:33:47,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:33:47,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:33:47,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:47,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:33:47,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:33:47,791 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:33:47,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:33:47,821 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2024-11-28 03:33:47,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:33:47,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-28 03:33:47,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:33:47,823 INFO L225 Difference]: With dead ends: 61 [2024-11-28 03:33:47,824 INFO L226 Difference]: Without dead ends: 38 [2024-11-28 03:33:47,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:33:47,825 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:33:47,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 106 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:33:47,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-28 03:33:47,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-28 03:33:47,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:33:47,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2024-11-28 03:33:47,835 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 22 [2024-11-28 03:33:47,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:33:47,835 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-11-28 03:33:47,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:33:47,838 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2024-11-28 03:33:47,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 03:33:47,838 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:33:47,838 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:47,849 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 03:33:48,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:33:48,039 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:33:48,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:48,040 INFO L85 PathProgramCache]: Analyzing trace with hash 35713086, now seen corresponding path program 1 times [2024-11-28 03:33:48,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:48,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033093641] [2024-11-28 03:33:48,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:48,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:48,210 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 03:33:48,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:48,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033093641] [2024-11-28 03:33:48,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033093641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:48,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:48,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:33:48,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494613] [2024-11-28 03:33:48,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:48,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:33:48,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:48,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:33:48,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:48,212 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:33:48,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:33:48,242 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2024-11-28 03:33:48,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:33:48,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-28 03:33:48,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:33:48,248 INFO L225 Difference]: With dead ends: 54 [2024-11-28 03:33:48,248 INFO L226 Difference]: Without dead ends: 41 [2024-11-28 03:33:48,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:48,249 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 75 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-28 03:33:48,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 75 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:33:48,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-28 03:33:48,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-11-28 03:33:48,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:33:48,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2024-11-28 03:33:48,260 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 28 [2024-11-28 03:33:48,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:33:48,261 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2024-11-28 03:33:48,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:33:48,261 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2024-11-28 03:33:48,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 03:33:48,261 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:33:48,262 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:48,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:33:48,262 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:33:48,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:48,262 INFO L85 PathProgramCache]: Analyzing trace with hash 611858433, now seen corresponding path program 1 times [2024-11-28 03:33:48,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:48,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506860236] [2024-11-28 03:33:48,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:48,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:48,563 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 03:33:48,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:48,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506860236] [2024-11-28 03:33:48,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506860236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:48,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:48,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:33:48,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223830056] [2024-11-28 03:33:48,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:48,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:33:48,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:48,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:33:48,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:33:48,565 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:33:48,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:33:48,608 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2024-11-28 03:33:48,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:33:48,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-28 03:33:48,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:33:48,610 INFO L225 Difference]: With dead ends: 56 [2024-11-28 03:33:48,611 INFO L226 Difference]: Without dead ends: 41 [2024-11-28 03:33:48,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-28 03:33:48,613 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 31 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:33:48,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 71 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:33:48,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-28 03:33:48,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-11-28 03:33:48,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:33:48,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2024-11-28 03:33:48,620 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 29 [2024-11-28 03:33:48,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:33:48,621 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2024-11-28 03:33:48,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:33:48,621 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2024-11-28 03:33:48,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-28 03:33:48,622 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:33:48,622 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:48,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:33:48,622 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:33:48,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:48,623 INFO L85 PathProgramCache]: Analyzing trace with hash 2127543938, now seen corresponding path program 1 times [2024-11-28 03:33:48,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:48,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997357545] [2024-11-28 03:33:48,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:48,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:52,136 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:52,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:52,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997357545] [2024-11-28 03:33:52,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997357545] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:33:52,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998205116] [2024-11-28 03:33:52,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:52,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:33:52,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:33:52,141 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:33:52,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:33:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:52,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-11-28 03:33:52,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:33:52,843 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-28 03:33:53,036 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:33:53,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 03:33:53,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-28 03:33:53,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-28 03:33:53,323 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:33:53,324 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 57 treesize of output 50 [2024-11-28 03:33:53,331 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 24 treesize of output 11 [2024-11-28 03:33:53,681 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-28 03:33:53,681 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 28 treesize of output 30 [2024-11-28 03:33:53,879 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 48 treesize of output 31 [2024-11-28 03:33:53,908 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-28 03:33:54,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 51 treesize of output 19 [2024-11-28 03:33:54,381 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 36 treesize of output 34 [2024-11-28 03:33:54,391 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 20 treesize of output 15 [2024-11-28 03:33:54,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-28 03:33:54,549 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-28 03:33:54,665 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:54,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:33:54,741 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_592 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_592) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-11-28 03:33:58,372 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_590 Int) (v_ArrVal_592 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_586 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (store (store (store |c_#memory_int#2| .cse0 (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_584) .cse0) .cse1 v_ArrVal_590)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_591) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_586) .cse0) .cse1) v_ArrVal_592)) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-11-28 03:33:58,413 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 72 treesize of output 52 [2024-11-28 03:33:58,423 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 56 treesize of output 40 [2024-11-28 03:34:01,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:01,105 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 3 case distinctions, treesize of input 324 treesize of output 316 [2024-11-28 03:34:01,122 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 108 treesize of output 100 [2024-11-28 03:34:01,133 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 65 treesize of output 63 [2024-11-28 03:34:01,142 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 63 treesize of output 61 [2024-11-28 03:34:01,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:01,156 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 2 case distinctions, treesize of input 113 treesize of output 103 [2024-11-28 03:34:01,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:01,171 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 195 treesize of output 171 [2024-11-28 03:34:01,191 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 143 treesize of output 127 [2024-11-28 03:34:01,198 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 127 treesize of output 119 [2024-11-28 03:34:01,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2024-11-28 03:34:01,865 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:34:01,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998205116] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:34:01,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:34:01,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 50 [2024-11-28 03:34:01,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361963667] [2024-11-28 03:34:01,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:34:01,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-28 03:34:01,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:34:01,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-28 03:34:01,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2056, Unknown=44, NotChecked=186, Total=2450 [2024-11-28 03:34:01,869 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 50 states, 50 states have (on average 1.68) internal successors, (84), 50 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:05,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:34:05,015 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2024-11-28 03:34:05,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-28 03:34:05,015 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.68) internal successors, (84), 50 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-28 03:34:05,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:34:05,016 INFO L225 Difference]: With dead ends: 71 [2024-11-28 03:34:05,016 INFO L226 Difference]: Without dead ends: 69 [2024-11-28 03:34:05,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=341, Invalid=3655, Unknown=44, NotChecked=250, Total=4290 [2024-11-28 03:34:05,019 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 58 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 1429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:34:05,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 417 Invalid, 1429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1266 Invalid, 0 Unknown, 155 Unchecked, 1.7s Time] [2024-11-28 03:34:05,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-28 03:34:05,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 47. [2024-11-28 03:34:05,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:05,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2024-11-28 03:34:05,026 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 30 [2024-11-28 03:34:05,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:34:05,026 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2024-11-28 03:34:05,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.68) internal successors, (84), 50 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:05,026 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2024-11-28 03:34:05,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-28 03:34:05,027 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:34:05,027 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:34:05,037 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 03:34:05,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:34:05,228 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:34:05,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:05,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2127612448, now seen corresponding path program 1 times [2024-11-28 03:34:05,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:34:05,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241499165] [2024-11-28 03:34:05,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:05,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:34:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:05,660 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:34:05,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:34:05,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241499165] [2024-11-28 03:34:05,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241499165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:34:05,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:34:05,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:34:05,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240497818] [2024-11-28 03:34:05,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:34:05,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:34:05,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:34:05,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:34:05,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:34:05,662 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:06,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:34:06,029 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2024-11-28 03:34:06,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:34:06,029 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-28 03:34:06,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:34:06,030 INFO L225 Difference]: With dead ends: 71 [2024-11-28 03:34:06,030 INFO L226 Difference]: Without dead ends: 63 [2024-11-28 03:34:06,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:34:06,031 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 26 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:34:06,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 193 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:34:06,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-28 03:34:06,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 49. [2024-11-28 03:34:06,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:06,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2024-11-28 03:34:06,046 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 30 [2024-11-28 03:34:06,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:34:06,046 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2024-11-28 03:34:06,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:06,047 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2024-11-28 03:34:06,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 03:34:06,050 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:34:06,050 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:34:06,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:34:06,051 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:34:06,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:06,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1034105405, now seen corresponding path program 1 times [2024-11-28 03:34:06,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:34:06,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321920459] [2024-11-28 03:34:06,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:06,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:34:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:06,218 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 03:34:06,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:34:06,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321920459] [2024-11-28 03:34:06,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321920459] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:34:06,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147441005] [2024-11-28 03:34:06,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:06,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:34:06,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:34:06,221 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:34:06,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:34:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:06,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-28 03:34:06,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:34:06,470 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 03:34:06,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:34:06,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 03:34:06,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147441005] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:34:06,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:34:06,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-28 03:34:06,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682032632] [2024-11-28 03:34:06,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:34:06,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:34:06,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:34:06,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:34:06,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:34:06,565 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:06,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:34:06,708 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2024-11-28 03:34:06,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:34:06,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-28 03:34:06,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:34:06,711 INFO L225 Difference]: With dead ends: 65 [2024-11-28 03:34:06,711 INFO L226 Difference]: Without dead ends: 52 [2024-11-28 03:34:06,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:34:06,712 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 4 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:34:06,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 167 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:34:06,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-28 03:34:06,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2024-11-28 03:34:06,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 49 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:06,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2024-11-28 03:34:06,729 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 31 [2024-11-28 03:34:06,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:34:06,729 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2024-11-28 03:34:06,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:06,729 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2024-11-28 03:34:06,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 03:34:06,730 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:34:06,730 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:34:06,740 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 03:34:06,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:34:06,934 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:34:06,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:06,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1485854529, now seen corresponding path program 1 times [2024-11-28 03:34:06,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:34:06,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215174547] [2024-11-28 03:34:06,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:06,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:34:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:07,185 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:34:07,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:34:07,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215174547] [2024-11-28 03:34:07,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215174547] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:34:07,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596592899] [2024-11-28 03:34:07,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:07,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:34:07,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:34:07,187 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:34:07,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 03:34:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:07,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-28 03:34:07,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:34:07,445 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-28 03:34:07,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:34:07,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:34:07,514 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:34:07,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596592899] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:34:07,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:34:07,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2024-11-28 03:34:07,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213999953] [2024-11-28 03:34:07,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:34:07,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 03:34:07,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:34:07,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 03:34:07,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:34:07,516 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:07,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:34:07,725 INFO L93 Difference]: Finished difference Result 91 states and 117 transitions. [2024-11-28 03:34:07,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:34:07,725 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-28 03:34:07,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:34:07,726 INFO L225 Difference]: With dead ends: 91 [2024-11-28 03:34:07,726 INFO L226 Difference]: Without dead ends: 50 [2024-11-28 03:34:07,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:34:07,727 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 22 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:34:07,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 250 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:34:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-28 03:34:07,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2024-11-28 03:34:07,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:07,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2024-11-28 03:34:07,734 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 31 [2024-11-28 03:34:07,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:34:07,734 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2024-11-28 03:34:07,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:07,735 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2024-11-28 03:34:07,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 03:34:07,735 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:34:07,736 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:34:07,748 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 03:34:07,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-28 03:34:07,940 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:34:07,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:07,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1962669114, now seen corresponding path program 2 times [2024-11-28 03:34:07,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:34:07,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253669304] [2024-11-28 03:34:07,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:34:07,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:34:07,983 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:34:07,983 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:34:08,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 03:34:08,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:34:08,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253669304] [2024-11-28 03:34:08,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253669304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:34:08,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:34:08,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:34:08,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597022098] [2024-11-28 03:34:08,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:34:08,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:34:08,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:34:08,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:34:08,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:34:08,107 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:08,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:34:08,144 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2024-11-28 03:34:08,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:34:08,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-28 03:34:08,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:34:08,146 INFO L225 Difference]: With dead ends: 62 [2024-11-28 03:34:08,147 INFO L226 Difference]: Without dead ends: 42 [2024-11-28 03:34:08,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:34:08,148 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 25 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:34:08,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 93 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:34:08,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-28 03:34:08,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-11-28 03:34:08,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:08,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2024-11-28 03:34:08,159 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 32 [2024-11-28 03:34:08,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:34:08,159 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2024-11-28 03:34:08,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:08,160 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-11-28 03:34:08,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-28 03:34:08,160 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:34:08,160 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:34:08,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:34:08,161 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:34:08,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:08,161 INFO L85 PathProgramCache]: Analyzing trace with hash 829309350, now seen corresponding path program 1 times [2024-11-28 03:34:08,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:34:08,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101560888] [2024-11-28 03:34:08,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:08,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:34:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:08,566 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:34:08,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:34:08,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101560888] [2024-11-28 03:34:08,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101560888] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:34:08,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462518809] [2024-11-28 03:34:08,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:08,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:34:08,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:34:08,570 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:34:08,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 03:34:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:08,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-28 03:34:08,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:34:08,853 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 03:34:08,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:34:08,975 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 03:34:08,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462518809] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:34:08,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:34:08,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2024-11-28 03:34:08,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794641090] [2024-11-28 03:34:08,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:34:08,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 03:34:08,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:34:08,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 03:34:08,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-28 03:34:08,979 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:09,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:34:09,156 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2024-11-28 03:34:09,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:34:09,157 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-28 03:34:09,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:34:09,158 INFO L225 Difference]: With dead ends: 51 [2024-11-28 03:34:09,158 INFO L226 Difference]: Without dead ends: 40 [2024-11-28 03:34:09,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2024-11-28 03:34:09,159 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 28 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:34:09,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 204 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:34:09,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-28 03:34:09,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-11-28 03:34:09,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:09,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-11-28 03:34:09,166 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 33 [2024-11-28 03:34:09,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:34:09,166 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-28 03:34:09,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:09,167 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-11-28 03:34:09,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-28 03:34:09,167 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:34:09,168 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:34:09,180 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 03:34:09,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-28 03:34:09,368 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:34:09,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:09,369 INFO L85 PathProgramCache]: Analyzing trace with hash 829377860, now seen corresponding path program 1 times [2024-11-28 03:34:09,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:34:09,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132653937] [2024-11-28 03:34:09,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:09,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:34:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:34:11,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:34:11,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132653937] [2024-11-28 03:34:11,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132653937] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:34:11,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59677205] [2024-11-28 03:34:11,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:11,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:34:11,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:34:11,587 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:34:11,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d09516-52a0-43d6-aac3-fce15443b40e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 03:34:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:11,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-11-28 03:34:11,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:34:12,025 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-28 03:34:12,156 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:34:12,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 03:34:12,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-28 03:34:12,315 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:34:12,315 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 41 treesize of output 38 [2024-11-28 03:34:12,587 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-28 03:34:12,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-28 03:34:12,749 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-28 03:34:12,761 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 48 treesize of output 31 [2024-11-28 03:34:13,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:34:13,184 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 30 treesize of output 27 [2024-11-28 03:34:13,197 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 24 treesize of output 20 [2024-11-28 03:34:13,206 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 49 [2024-11-28 03:34:13,233 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-28 03:34:13,233 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 1 case distinctions, treesize of input 155 treesize of output 94 [2024-11-28 03:34:13,248 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 68 treesize of output 37 [2024-11-28 03:34:13,258 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-28 03:34:13,270 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 36 treesize of output 15 [2024-11-28 03:34:13,387 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 63 treesize of output 40 [2024-11-28 03:34:13,399 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 24 treesize of output 19 [2024-11-28 03:34:13,405 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-28 03:34:13,507 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 61 treesize of output 37 [2024-11-28 03:34:13,590 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 34 treesize of output 18 [2024-11-28 03:34:13,594 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-28 03:34:13,708 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-28 03:34:13,710 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:34:13,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:34:13,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:14,000 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 91 treesize of output 92 [2024-11-28 03:34:14,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:14,015 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 346 treesize of output 345 [2024-11-28 03:34:14,040 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 322 treesize of output 306 [2024-11-28 03:34:14,054 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 156 treesize of output 148 [2024-11-28 03:34:14,885 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse26 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse12 (= .cse5 |c_ULTIMATE.start_dll_insert_~last~0#1.base|))) (let ((.cse0 (not .cse12)) (.cse2 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse3 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4)) (.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 4) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse6 (+ .cse26 4)) (.cse17 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse5))) (let ((.cse9 (not .cse17)) (.cse18 (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1376 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse36 (select (store (let ((.cse37 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse37 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse37 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1380))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1383) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1382) .cse5) .cse6)))) (or (= (select .cse36 v_arrayElimCell_49) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_52 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse36 v_arrayElimCell_52))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse36 v_arrayElimCell_51)))))) (.cse19 (or (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1376 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse34 (select (store (let ((.cse35 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse35 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse35 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1380))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1383) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1382) .cse5) .cse6)))) (or (= (select .cse34 v_arrayElimCell_49) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 v_arrayElimCell_52))))) .cse12)) (.cse20 (or .cse0 (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1376 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse32 (select (store (let ((.cse33 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse33 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse33 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1380))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1383) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1382) .cse5) .cse6)))) (or (= (select .cse32 v_arrayElimCell_49) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 v_arrayElimCell_51))))))) (.cse21 (or .cse17 (and (or .cse12 (forall ((v_ArrVal_1380 Int) (v_ArrVal_1376 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (= (select (select (store (let ((.cse29 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse29 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse29 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1380))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1383) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1382) .cse5) .cse6)) v_arrayElimCell_49) |c_ULTIMATE.start_main_~uneq~0#1|))) (forall ((v_ArrVal_1380 Int) (v_ArrVal_1376 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse30 (select (store (let ((.cse31 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse31 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse31 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1380))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1383) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1382) .cse5) .cse6)))) (or (= (select .cse30 v_arrayElimCell_49) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_51 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 v_arrayElimCell_51)))))))))) (and (or .cse0 (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse1 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse1 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse1 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1380))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1383) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1382) .cse5) .cse6)) v_arrayElimCell_51)))) (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse7 (select (store (let ((.cse8 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse8 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse8 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1380))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1383) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1382) .cse5) .cse6)))) (or (forall ((v_arrayElimCell_52 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse7 v_arrayElimCell_52))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse7 v_arrayElimCell_51)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))))) (or .cse9 (and (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse10 (select (store (let ((.cse11 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1380))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1383) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1382) .cse5) .cse6)))) (or (forall ((v_arrayElimCell_52 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse10 v_arrayElimCell_52))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse10 v_arrayElimCell_51))))) (or .cse12 (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse13 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1380))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1383) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1382) .cse5) .cse6)) v_arrayElimCell_52)))))) (or (and (forall ((v_ArrVal_1380 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse14 (select (store (let ((.cse15 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse15 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse15 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1380))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1383) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1382) .cse5) .cse6)))) (or (forall ((v_arrayElimCell_51 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 v_arrayElimCell_51))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))))) (or .cse12 (forall ((v_ArrVal_1380 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse16 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse16 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse16 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1380))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1383) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1382) .cse5) .cse6)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))))) .cse17) (or (and .cse18 .cse19 .cse20 .cse21 (or .cse9 (let ((.cse23 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (and (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse22 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1373) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse23 .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1380)) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1383) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1382) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 v_arrayElimCell_51)) (forall ((v_arrayElimCell_52 Int)) (= (select .cse22 v_arrayElimCell_52) |c_ULTIMATE.start_main_~uneq~0#1|))))) (or .cse12 (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1373) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse23 .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1380)) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1383) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1382) .cse5) .cse6)) v_arrayElimCell_52) |c_ULTIMATE.start_main_~uneq~0#1|))))))) (= .cse5 |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|)) (or .cse12 (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse24 (select (store (let ((.cse25 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1380))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1383) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1382) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 v_arrayElimCell_52)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))))) (or (and .cse18 .cse19 .cse20 .cse21) (= .cse26 |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|)) (or .cse0 (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse27 (select (store (let ((.cse28 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1380))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1383) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1382) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 v_arrayElimCell_51)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))))))))))) is different from false [2024-11-28 03:34:16,010 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse39 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse40 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse5 (select .cse39 .cse40)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (= .cse5 .cse7))) (let ((.cse0 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse7)) (.cse21 (not .cse9)) (.cse3 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse4 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4)) (.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse39 .cse40 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse8 (+ .cse11 4))) (let ((.cse12 (or .cse21 (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1376 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse37 (select (store (let ((.cse38 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1373))) (store .cse38 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse38 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380))) .cse5 v_ArrVal_1383) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) .cse5 v_ArrVal_1382) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse37 v_arrayElimCell_49)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse37 v_arrayElimCell_51))))))) (.cse13 (or (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1376 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse35 (select (store (let ((.cse36 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1373))) (store .cse36 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse36 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380))) .cse5 v_ArrVal_1383) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) .cse5 v_ArrVal_1382) .cse7) .cse8)))) (or (= (select .cse35 v_arrayElimCell_52) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse35 v_arrayElimCell_49))))) .cse9)) (.cse14 (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1376 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse33 (select (store (let ((.cse34 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1373))) (store .cse34 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse34 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380))) .cse5 v_ArrVal_1383) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) .cse5 v_ArrVal_1382) .cse7) .cse8)))) (or (forall ((v_arrayElimCell_52 Int)) (= (select .cse33 v_arrayElimCell_52) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse33 v_arrayElimCell_49)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse33 v_arrayElimCell_51)))))) (.cse15 (or (and (forall ((v_ArrVal_1380 Int) (v_ArrVal_1376 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse30 (select (store (let ((.cse31 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1373))) (store .cse31 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse31 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380))) .cse5 v_ArrVal_1383) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) .cse5 v_ArrVal_1382) .cse7) .cse8)))) (or (forall ((v_arrayElimCell_51 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 v_arrayElimCell_51))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 v_arrayElimCell_49))))) (or .cse9 (forall ((v_ArrVal_1380 Int) (v_ArrVal_1376 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse32 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1373))) (store .cse32 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse32 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380))) .cse5 v_ArrVal_1383) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) .cse5 v_ArrVal_1382) .cse7) .cse8)) v_arrayElimCell_49))))) .cse0)) (.cse18 (not .cse0))) (and (or .cse0 (and (forall ((v_ArrVal_1380 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse1 (select (store (let ((.cse2 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1373))) (store .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380))) .cse5 v_ArrVal_1383) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) .cse5 v_ArrVal_1382) .cse7) .cse8)))) (or (forall ((v_arrayElimCell_51 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse1 v_arrayElimCell_51))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse1 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))))) (or .cse9 (forall ((v_ArrVal_1380 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse10 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1373))) (store .cse10 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse10 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380))) .cse5 v_ArrVal_1383) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) .cse5 v_ArrVal_1382) .cse7) .cse8)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))))) (or (= .cse11 |c_ULTIMATE.start_dll_insert_~last~0#1.offset|) (and .cse12 .cse13 .cse14 .cse15)) (or .cse9 (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse16 (select (store (let ((.cse17 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1373))) (store .cse17 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse17 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380))) .cse5 v_ArrVal_1383) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) .cse5 v_ArrVal_1382) .cse7) .cse8)))) (or (= (select .cse16 v_arrayElimCell_52) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))))) (or (= .cse7 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) (and .cse12 .cse13 (or .cse18 (let ((.cse20 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (and (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse19 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1373) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse20 .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380)) .cse5 v_ArrVal_1383) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) .cse5 v_ArrVal_1382) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse19 v_arrayElimCell_51)) (forall ((v_arrayElimCell_52 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse19 v_arrayElimCell_52)))))) (or (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1373) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse20 .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380)) .cse5 v_ArrVal_1383) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) .cse5 v_ArrVal_1382) .cse7) .cse8)) v_arrayElimCell_52))) .cse9)))) .cse14 .cse15)) (or .cse21 (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse22 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1373))) (store .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380))) .cse5 v_ArrVal_1383) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) .cse5 v_ArrVal_1382) .cse7) .cse8)) v_arrayElimCell_51)))) (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse23 (select (store (let ((.cse24 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1373))) (store .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380))) .cse5 v_ArrVal_1383) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) .cse5 v_ArrVal_1382) .cse7) .cse8)))) (or (forall ((v_arrayElimCell_52 Int)) (= (select .cse23 v_arrayElimCell_52) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 v_arrayElimCell_51))))) (or .cse18 (and (or (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (= (select (select (store (let ((.cse25 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1373))) (store .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380))) .cse5 v_ArrVal_1383) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) .cse5 v_ArrVal_1382) .cse7) .cse8)) v_arrayElimCell_52) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse9) (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse26 (select (store (let ((.cse27 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1373))) (store .cse27 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse27 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380))) .cse5 v_ArrVal_1383) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) .cse5 v_ArrVal_1382) .cse7) .cse8)))) (or (forall ((v_arrayElimCell_52 Int)) (= (select .cse26 v_arrayElimCell_52) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 v_arrayElimCell_51))))))) (or .cse21 (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse28 (select (store (let ((.cse29 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1373))) (store .cse29 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse29 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380))) .cse5 v_ArrVal_1383) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1376) .cse5 v_ArrVal_1382) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 v_arrayElimCell_51)))))))))))) is different from false [2024-11-28 03:34:17,194 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse41 (select |c_#memory_$Pointer$#2.base| .cse5)) (.cse42 (+ .cse11 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select .cse41 .cse42))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (= .cse8 .cse6))) (let ((.cse30 (= |c_ULTIMATE.start_node_create_#res#1.base| .cse8)) (.cse24 (not .cse0)) (.cse3 (+ 8 |c_ULTIMATE.start_node_create_#res#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4)) (.cse7 (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse41 .cse42 |c_ULTIMATE.start_node_create_#res#1.base|))) (.cse9 (+ .cse10 4))) (let ((.cse12 (or .cse24 (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1376 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse39 (select (store (let ((.cse40 (store |c_#memory_int#2| .cse5 v_ArrVal_1373))) (store .cse40 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse40 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380))) .cse6 v_ArrVal_1383) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1376) .cse6 v_ArrVal_1382) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse39 v_arrayElimCell_49)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse39 v_arrayElimCell_51))))))) (.cse13 (or (and (forall ((v_ArrVal_1380 Int) (v_ArrVal_1376 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse36 (select (store (let ((.cse37 (store |c_#memory_int#2| .cse5 v_ArrVal_1373))) (store .cse37 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse37 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380))) .cse6 v_ArrVal_1383) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1376) .cse6 v_ArrVal_1382) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse36 v_arrayElimCell_49)) (forall ((v_arrayElimCell_51 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse36 v_arrayElimCell_51)))))) (or .cse0 (forall ((v_ArrVal_1380 Int) (v_ArrVal_1376 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse38 (store |c_#memory_int#2| .cse5 v_ArrVal_1373))) (store .cse38 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse38 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380))) .cse6 v_ArrVal_1383) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1376) .cse6 v_ArrVal_1382) .cse8) .cse9)) v_arrayElimCell_49))))) .cse30)) (.cse19 (not .cse30)) (.cse14 (or .cse0 (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1376 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse34 (select (store (let ((.cse35 (store |c_#memory_int#2| .cse5 v_ArrVal_1373))) (store .cse35 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse35 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380))) .cse6 v_ArrVal_1383) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1376) .cse6 v_ArrVal_1382) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 v_arrayElimCell_49)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 v_arrayElimCell_52))))))) (.cse15 (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1376 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse32 (select (store (let ((.cse33 (store |c_#memory_int#2| .cse5 v_ArrVal_1373))) (store .cse33 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse33 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380))) .cse6 v_ArrVal_1383) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1376) .cse6 v_ArrVal_1382) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 v_arrayElimCell_49)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 v_arrayElimCell_51)) (forall ((v_arrayElimCell_52 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 v_arrayElimCell_52)))))))) (and (or .cse0 (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse1 (select (store (let ((.cse2 (store |c_#memory_int#2| .cse5 v_ArrVal_1373))) (store .cse2 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse2 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380))) .cse6 v_ArrVal_1383) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1376) .cse6 v_ArrVal_1382) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse1 |c_ULTIMATE.start_node_create_#res#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse1 v_arrayElimCell_52)))))) (or (= .cse10 .cse11) (and .cse12 .cse13 .cse14 .cse15)) (or (and (or .cse0 (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse16 (store |c_#memory_int#2| .cse5 v_ArrVal_1373))) (store .cse16 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse16 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380))) .cse6 v_ArrVal_1383) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1376) .cse6 v_ArrVal_1382) .cse8) .cse9)) v_arrayElimCell_52)))) (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse17 (select (store (let ((.cse18 (store |c_#memory_int#2| .cse5 v_ArrVal_1373))) (store .cse18 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse18 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380))) .cse6 v_ArrVal_1383) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1376) .cse6 v_ArrVal_1382) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse17 v_arrayElimCell_51)) (forall ((v_arrayElimCell_52 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse17 v_arrayElimCell_52))))))) .cse19) (or (and .cse12 .cse13 (or .cse19 (let ((.cse20 (select |c_#memory_int#2| |c_ULTIMATE.start_node_create_#res#1.base|))) (and (or .cse0 (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#2| .cse5 v_ArrVal_1373) |c_ULTIMATE.start_node_create_#res#1.base| (store (store .cse20 .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380)) .cse6 v_ArrVal_1383) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1376) .cse6 v_ArrVal_1382) .cse8) .cse9)) v_arrayElimCell_52)))) (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse21 (select (store (store (store |c_#memory_int#2| .cse5 v_ArrVal_1373) |c_ULTIMATE.start_node_create_#res#1.base| (store (store .cse20 .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380)) .cse6 v_ArrVal_1383) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1376) .cse6 v_ArrVal_1382) .cse8) .cse9)))) (or (forall ((v_arrayElimCell_52 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 v_arrayElimCell_52))) (= (select .cse21 v_arrayElimCell_51) |c_ULTIMATE.start_main_~uneq~0#1|))))))) .cse14 .cse15) (= .cse8 .cse5)) (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse22 (select (store (let ((.cse23 (store |c_#memory_int#2| .cse5 v_ArrVal_1373))) (store .cse23 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse23 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380))) .cse6 v_ArrVal_1383) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1376) .cse6 v_ArrVal_1382) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 |c_ULTIMATE.start_node_create_#res#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 v_arrayElimCell_51)) (forall ((v_arrayElimCell_52 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 v_arrayElimCell_52)))))) (or .cse24 (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse25 (select (store (let ((.cse26 (store |c_#memory_int#2| .cse5 v_ArrVal_1373))) (store .cse26 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse26 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380))) .cse6 v_ArrVal_1383) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1376) .cse6 v_ArrVal_1382) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 |c_ULTIMATE.start_node_create_#res#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 v_arrayElimCell_51)))))) (or (and (forall ((v_ArrVal_1380 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse27 (select (store (let ((.cse28 (store |c_#memory_int#2| .cse5 v_ArrVal_1373))) (store .cse28 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse28 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380))) .cse6 v_ArrVal_1383) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1376) .cse6 v_ArrVal_1382) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 |c_ULTIMATE.start_node_create_#res#1.offset|)) (forall ((v_arrayElimCell_51 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 v_arrayElimCell_51)))))) (or .cse0 (forall ((v_ArrVal_1380 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse29 (store |c_#memory_int#2| .cse5 v_ArrVal_1373))) (store .cse29 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse29 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380))) .cse6 v_ArrVal_1383) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1376) .cse6 v_ArrVal_1382) .cse8) .cse9)) |c_ULTIMATE.start_node_create_#res#1.offset|))))) .cse30) (or (forall ((v_ArrVal_1380 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse31 (store |c_#memory_int#2| .cse5 v_ArrVal_1373))) (store .cse31 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse31 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_1380))) .cse6 v_ArrVal_1383) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1376) .cse6 v_ArrVal_1382) .cse8) .cse9)) v_arrayElimCell_51))) .cse24)))))))) is different from false [2024-11-28 03:34:17,518 INFO L349 Elim1Store]: treesize reduction 556, result has 35.9 percent of original size [2024-11-28 03:34:17,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 3698 treesize of output 3763 [2024-11-28 03:34:17,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:17,554 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 3883 treesize of output 3747 [2024-11-28 03:34:17,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:17,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3740 treesize of output 3746 [2024-11-28 03:34:17,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:17,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3654 treesize of output 3654 [2024-11-28 03:34:19,808 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 6 treesize of output 4 [2024-11-28 03:34:19,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:19,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2327 treesize of output 2331 [2024-11-28 03:34:25,496 INFO L349 Elim1Store]: treesize reduction 278, result has 52.0 percent of original size [2024-11-28 03:34:25,497 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 4 case distinctions, treesize of input 2479 treesize of output 2615 [2024-11-28 03:34:25,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:25,526 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 2711 treesize of output 2643 [2024-11-28 03:34:25,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:25,593 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 2575 treesize of output 2571 [2024-11-28 03:34:25,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:25,651 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 2495 treesize of output 2487 [2024-11-28 03:34:27,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:27,279 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 495 treesize of output 499 [2024-11-28 03:34:27,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:27,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1199 treesize of output 1213 [2024-11-28 03:34:29,598 INFO L349 Elim1Store]: treesize reduction 342, result has 40.1 percent of original size [2024-11-28 03:34:29,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2459 treesize of output 2523 [2024-11-28 03:34:29,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:29,623 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 1 case distinctions, treesize of input 2599 treesize of output 2531 [2024-11-28 03:34:29,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:29,649 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 2453 treesize of output 2449 [2024-11-28 03:34:29,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:29,682 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 2407 treesize of output 2399 [2024-11-28 03:34:30,565 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 6 treesize of output 4 [2024-11-28 03:34:30,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:30,593 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 567 treesize of output 569 [2024-11-28 03:34:30,987 INFO L349 Elim1Store]: treesize reduction 342, result has 40.1 percent of original size [2024-11-28 03:34:30,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2459 treesize of output 2523 [2024-11-28 03:34:31,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:31,016 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 1 case distinctions, treesize of input 2599 treesize of output 2531 [2024-11-28 03:34:31,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:31,054 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 2453 treesize of output 2449 [2024-11-28 03:34:31,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:31,099 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 2407 treesize of output 2399 [2024-11-28 03:34:31,896 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 6 treesize of output 4 [2024-11-28 03:34:31,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:31,969 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 1126 treesize of output 1126 [2024-11-28 03:34:32,361 INFO L349 Elim1Store]: treesize reduction 136, result has 51.8 percent of original size [2024-11-28 03:34:32,361 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 1220 treesize of output 1283 [2024-11-28 03:34:32,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:32,379 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 1 case distinctions, treesize of input 1315 treesize of output 1307 [2024-11-28 03:34:32,392 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 1138 treesize of output 1130 [2024-11-28 03:34:32,400 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 1130 treesize of output 1124 [2024-11-28 03:34:32,628 INFO L349 Elim1Store]: treesize reduction 139, result has 52.1 percent of original size [2024-11-28 03:34:32,629 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 1240 treesize of output 1308 [2024-11-28 03:34:32,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:32,647 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 1 case distinctions, treesize of input 1360 treesize of output 1360 [2024-11-28 03:34:32,663 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 1288 treesize of output 1282 [2024-11-28 03:34:32,683 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 1248 treesize of output 1240 [2024-11-28 03:34:32,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 03:34:33,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:33,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 633 treesize of output 669 [2024-11-28 03:34:33,812 INFO L349 Elim1Store]: treesize reduction 278, result has 52.0 percent of original size [2024-11-28 03:34:33,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2479 treesize of output 2615 [2024-11-28 03:34:33,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:33,838 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 1 case distinctions, treesize of input 2711 treesize of output 2643 [2024-11-28 03:34:33,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:33,870 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 2575 treesize of output 2571 [2024-11-28 03:34:33,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:33,914 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 2495 treesize of output 2487 [2024-11-28 03:34:34,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:34,798 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 495 treesize of output 499