./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/busybox-1.22.0/usleep-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/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_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/usleep-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 92819ed386f0d70ff4609309e3718a41b6a1b41ff8c4c600c8db8bc7b56921e0 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:29:24,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:29:24,437 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-28 03:29:24,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:29:24,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:29:24,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:29:24,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:29:24,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:29:24,471 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:29:24,471 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:29:24,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:29:24,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:29:24,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:29:24,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:29:24,472 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:29:24,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:29:24,472 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:29:24,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:29:24,472 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 03:29:24,472 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 03:29:24,472 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 03:29:24,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:29:24,476 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:29:24,477 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:29:24,477 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:29:24,477 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:29:24,477 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:29:24,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:29:24,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:29:24,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:29:24,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:29:24,478 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:29:24,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:29:24,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:29:24,478 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:29:24,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:29:24,478 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:29:24,478 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:29:24,478 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:29:24,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:29:24,479 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:29:24,479 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:29:24,479 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:29:24,479 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:29:24,479 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_91a0e675-7108-46d8-90a9-49302ee32148/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 92819ed386f0d70ff4609309e3718a41b6a1b41ff8c4c600c8db8bc7b56921e0 [2024-11-28 03:29:24,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:29:24,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:29:24,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:29:24,836 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:29:24,837 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:29:24,838 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/busybox-1.22.0/usleep-2.i [2024-11-28 03:29:28,042 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/data/a53a3a376/2f477d330a134d10a7fa2779d31ace71/FLAGa39990673 [2024-11-28 03:29:28,527 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:29:28,528 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/sv-benchmarks/c/busybox-1.22.0/usleep-2.i [2024-11-28 03:29:28,571 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/data/a53a3a376/2f477d330a134d10a7fa2779d31ace71/FLAGa39990673 [2024-11-28 03:29:28,594 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/data/a53a3a376/2f477d330a134d10a7fa2779d31ace71 [2024-11-28 03:29:28,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:29:28,600 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:29:28,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:29:28,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:29:28,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:29:28,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:29:28" (1/1) ... [2024-11-28 03:29:28,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9dec114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:28, skipping insertion in model container [2024-11-28 03:29:28,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:29:28" (1/1) ... [2024-11-28 03:29:28,689 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:29:29,875 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:29:29,880 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:29:29,882 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:29:29,883 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:29:29,884 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:29:29,885 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:29:29,886 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:29:29,887 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:29:29,888 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:29:29,893 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:29:29,895 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:29:29,903 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:29:29,904 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:29:29,911 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:29:29,913 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:29:29,921 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:29:29,930 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:29:29,943 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:29:29,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:29:29,990 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:29:30,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:29:30,375 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2024-11-28 03:29:30,383 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:29:30,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:30 WrapperNode [2024-11-28 03:29:30,384 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:29:30,385 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:29:30,385 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:29:30,385 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:29:30,392 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:29:30" (1/1) ... [2024-11-28 03:29:30,428 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:29:30" (1/1) ... [2024-11-28 03:29:30,513 INFO L138 Inliner]: procedures = 598, calls = 512, calls flagged for inlining = 19, calls inlined = 17, statements flattened = 899 [2024-11-28 03:29:30,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:29:30,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:29:30,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:29:30,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:29:30,524 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:30" (1/1) ... [2024-11-28 03:29:30,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:30" (1/1) ... [2024-11-28 03:29:30,550 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:30" (1/1) ... [2024-11-28 03:29:30,587 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-28 03:29:30,587 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:30" (1/1) ... [2024-11-28 03:29:30,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:30" (1/1) ... [2024-11-28 03:29:30,650 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:30" (1/1) ... [2024-11-28 03:29:30,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:30" (1/1) ... [2024-11-28 03:29:30,659 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:30" (1/1) ... [2024-11-28 03:29:30,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:30" (1/1) ... [2024-11-28 03:29:30,670 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:30" (1/1) ... [2024-11-28 03:29:30,680 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:29:30,681 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:29:30,681 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:29:30,681 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:29:30,682 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:30" (1/1) ... [2024-11-28 03:29:30,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:29:30,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:30,731 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/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:29:30,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/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:29:30,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 03:29:30,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2024-11-28 03:29:30,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-28 03:29:30,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-28 03:29:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 03:29:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:29:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-28 03:29:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:29:30,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:29:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2024-11-28 03:29:30,765 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2024-11-28 03:29:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2024-11-28 03:29:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2024-11-28 03:29:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-28 03:29:30,765 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-28 03:29:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 03:29:30,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-28 03:29:30,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-28 03:29:30,766 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2024-11-28 03:29:30,766 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2024-11-28 03:29:30,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-28 03:29:31,261 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:29:31,264 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:29:32,857 INFO L? ?]: Removed 442 outVars from TransFormulas that were not future-live. [2024-11-28 03:29:32,857 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:29:32,877 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:29:32,877 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-28 03:29:32,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:29:32 BoogieIcfgContainer [2024-11-28 03:29:32,878 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:29:32,880 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:29:32,880 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:29:32,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:29:32,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:29:28" (1/3) ... [2024-11-28 03:29:32,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d6fe96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:29:32, skipping insertion in model container [2024-11-28 03:29:32,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:30" (2/3) ... [2024-11-28 03:29:32,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d6fe96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:29:32, skipping insertion in model container [2024-11-28 03:29:32,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:29:32" (3/3) ... [2024-11-28 03:29:32,889 INFO L128 eAbstractionObserver]: Analyzing ICFG usleep-2.i [2024-11-28 03:29:32,908 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:29:32,910 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG usleep-2.i that has 4 procedures, 382 locations, 1 initial locations, 12 loop locations, and 155 error locations. [2024-11-28 03:29:32,978 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:29:32,995 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=None, 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;@23e0c49f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:29:32,996 INFO L334 AbstractCegarLoop]: Starting to check reachability of 155 error locations. [2024-11-28 03:29:33,002 INFO L276 IsEmpty]: Start isEmpty. Operand has 382 states, 215 states have (on average 1.9534883720930232) internal successors, (420), 370 states have internal predecessors, (420), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-28 03:29:33,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 03:29:33,010 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:33,011 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 03:29:33,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 152 more)] === [2024-11-28 03:29:33,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:33,018 INFO L85 PathProgramCache]: Analyzing trace with hash 337687, now seen corresponding path program 1 times [2024-11-28 03:29:33,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:33,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041693925] [2024-11-28 03:29:33,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:33,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:33,892 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:29:33,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:33,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041693925] [2024-11-28 03:29:33,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041693925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:33,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:33,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:29:33,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758797471] [2024-11-28 03:29:33,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:33,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:29:33,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:33,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:29:33,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:29:33,940 INFO L87 Difference]: Start difference. First operand has 382 states, 215 states have (on average 1.9534883720930232) internal successors, (420), 370 states have internal predecessors, (420), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:29:34,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:34,299 INFO L93 Difference]: Finished difference Result 234 states and 254 transitions. [2024-11-28 03:29:34,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:29:34,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-28 03:29:34,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:34,315 INFO L225 Difference]: With dead ends: 234 [2024-11-28 03:29:34,316 INFO L226 Difference]: Without dead ends: 232 [2024-11-28 03:29:34,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:29:34,324 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 173 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:34,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 198 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:29:34,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-28 03:29:34,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 214. [2024-11-28 03:29:34,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 121 states have (on average 1.8760330578512396) internal successors, (227), 209 states have internal predecessors, (227), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:29:34,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 233 transitions. [2024-11-28 03:29:34,396 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 233 transitions. Word has length 3 [2024-11-28 03:29:34,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:34,396 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 233 transitions. [2024-11-28 03:29:34,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:29:34,398 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 233 transitions. [2024-11-28 03:29:34,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 03:29:34,398 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:34,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 03:29:34,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:29:34,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 152 more)] === [2024-11-28 03:29:34,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:34,399 INFO L85 PathProgramCache]: Analyzing trace with hash 337688, now seen corresponding path program 1 times [2024-11-28 03:29:34,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:34,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596857798] [2024-11-28 03:29:34,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:34,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:34,884 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:29:34,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:34,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596857798] [2024-11-28 03:29:34,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596857798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:34,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:34,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:29:34,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050527614] [2024-11-28 03:29:34,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:34,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:29:34,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:34,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:29:34,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:29:34,891 INFO L87 Difference]: Start difference. First operand 214 states and 233 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:29:35,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:35,190 INFO L93 Difference]: Finished difference Result 213 states and 232 transitions. [2024-11-28 03:29:35,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:29:35,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-28 03:29:35,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:35,192 INFO L225 Difference]: With dead ends: 213 [2024-11-28 03:29:35,192 INFO L226 Difference]: Without dead ends: 213 [2024-11-28 03:29:35,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:29:35,193 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 12 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:35,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 360 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:29:35,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-28 03:29:35,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-11-28 03:29:35,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 121 states have (on average 1.8677685950413223) internal successors, (226), 208 states have internal predecessors, (226), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:29:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 232 transitions. [2024-11-28 03:29:35,219 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 232 transitions. Word has length 3 [2024-11-28 03:29:35,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:35,219 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 232 transitions. [2024-11-28 03:29:35,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:29:35,219 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 232 transitions. [2024-11-28 03:29:35,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-28 03:29:35,219 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:35,220 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:35,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:29:35,220 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 152 more)] === [2024-11-28 03:29:35,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:35,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1662766369, now seen corresponding path program 1 times [2024-11-28 03:29:35,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:35,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408251614] [2024-11-28 03:29:35,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:35,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:35,840 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:29:35,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:35,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408251614] [2024-11-28 03:29:35,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408251614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:35,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:35,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:29:35,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674454066] [2024-11-28 03:29:35,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:35,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:29:35,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:35,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:29:35,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:29:35,846 INFO L87 Difference]: Start difference. First operand 213 states and 232 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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:29:36,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:36,218 INFO L93 Difference]: Finished difference Result 217 states and 236 transitions. [2024-11-28 03:29:36,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:29:36,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2024-11-28 03:29:36,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:36,220 INFO L225 Difference]: With dead ends: 217 [2024-11-28 03:29:36,220 INFO L226 Difference]: Without dead ends: 217 [2024-11-28 03:29:36,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:29:36,222 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 12 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:36,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 496 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:29:36,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-28 03:29:36,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2024-11-28 03:29:36,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 124 states have (on average 1.846774193548387) internal successors, (229), 211 states have internal predecessors, (229), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:29:36,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 235 transitions. [2024-11-28 03:29:36,234 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 235 transitions. Word has length 7 [2024-11-28 03:29:36,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:36,234 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 235 transitions. [2024-11-28 03:29:36,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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:29:36,235 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 235 transitions. [2024-11-28 03:29:36,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 03:29:36,235 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:36,235 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:36,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:29:36,236 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 152 more)] === [2024-11-28 03:29:36,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:36,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1480613976, now seen corresponding path program 1 times [2024-11-28 03:29:36,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:36,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245820716] [2024-11-28 03:29:36,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:36,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:36,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:36,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:36,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245820716] [2024-11-28 03:29:36,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245820716] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:29:36,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763709394] [2024-11-28 03:29:36,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:36,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:36,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:36,858 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:29:36,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:29:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:37,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-28 03:29:37,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:29:37,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:37,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:29:37,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-28 03:29:37,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:37,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763709394] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:29:37,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:29:37,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-28 03:29:37,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968875000] [2024-11-28 03:29:37,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:29:37,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 03:29:37,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:37,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 03:29:37,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:29:37,683 INFO L87 Difference]: Start difference. First operand 216 states and 235 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 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:29:38,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:38,688 INFO L93 Difference]: Finished difference Result 221 states and 240 transitions. [2024-11-28 03:29:38,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:29:38,689 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 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 11 [2024-11-28 03:29:38,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:38,690 INFO L225 Difference]: With dead ends: 221 [2024-11-28 03:29:38,691 INFO L226 Difference]: Without dead ends: 221 [2024-11-28 03:29:38,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2024-11-28 03:29:38,692 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 199 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:38,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1224 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 03:29:38,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-28 03:29:38,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2024-11-28 03:29:38,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 130 states have (on average 1.8) internal successors, (234), 216 states have internal predecessors, (234), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:29:38,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 240 transitions. [2024-11-28 03:29:38,703 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 240 transitions. Word has length 11 [2024-11-28 03:29:38,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:38,703 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 240 transitions. [2024-11-28 03:29:38,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 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:29:38,703 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 240 transitions. [2024-11-28 03:29:38,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-28 03:29:38,704 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:38,704 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:38,719 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 03:29:38,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-28 03:29:38,905 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 152 more)] === [2024-11-28 03:29:38,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:38,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1100928587, now seen corresponding path program 1 times [2024-11-28 03:29:38,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:38,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979569404] [2024-11-28 03:29:38,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:38,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:39,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:39,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979569404] [2024-11-28 03:29:39,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979569404] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:29:39,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201428434] [2024-11-28 03:29:39,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:39,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:39,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:39,324 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:29:39,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:29:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:39,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 03:29:39,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:29:39,734 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:39,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:29:39,808 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:39,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201428434] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:29:39,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:29:39,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-28 03:29:39,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296044904] [2024-11-28 03:29:39,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:29:39,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 03:29:39,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:39,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 03:29:39,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:29:39,810 INFO L87 Difference]: Start difference. First operand 221 states and 240 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:29:39,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:39,888 INFO L93 Difference]: Finished difference Result 241 states and 260 transitions. [2024-11-28 03:29:39,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:29:39,889 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 19 [2024-11-28 03:29:39,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:39,890 INFO L225 Difference]: With dead ends: 241 [2024-11-28 03:29:39,890 INFO L226 Difference]: Without dead ends: 241 [2024-11-28 03:29:39,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:29:39,891 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 6 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:39,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 905 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:29:39,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-28 03:29:39,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2024-11-28 03:29:39,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 150 states have (on average 1.6933333333333334) internal successors, (254), 236 states have internal predecessors, (254), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:29:39,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 260 transitions. [2024-11-28 03:29:39,902 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 260 transitions. Word has length 19 [2024-11-28 03:29:39,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:39,902 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 260 transitions. [2024-11-28 03:29:39,902 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:29:39,903 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 260 transitions. [2024-11-28 03:29:39,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-28 03:29:39,903 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:39,903 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:39,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 03:29:40,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:40,108 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 152 more)] === [2024-11-28 03:29:40,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:40,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1366513368, now seen corresponding path program 2 times [2024-11-28 03:29:40,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:40,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872094661] [2024-11-28 03:29:40,110 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:29:40,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:40,202 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 03:29:40,204 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:29:40,587 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-28 03:29:40,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:40,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872094661] [2024-11-28 03:29:40,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872094661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:40,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:40,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:29:40,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973434975] [2024-11-28 03:29:40,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:40,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:29:40,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:40,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:29:40,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:29:40,590 INFO L87 Difference]: Start difference. First operand 241 states and 260 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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:29:40,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:40,809 INFO L93 Difference]: Finished difference Result 262 states and 281 transitions. [2024-11-28 03:29:40,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:29:40,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 39 [2024-11-28 03:29:40,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:40,811 INFO L225 Difference]: With dead ends: 262 [2024-11-28 03:29:40,811 INFO L226 Difference]: Without dead ends: 262 [2024-11-28 03:29:40,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:29:40,811 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 357 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:40,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 265 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:29:40,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-28 03:29:40,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 244. [2024-11-28 03:29:40,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 153 states have (on average 1.673202614379085) internal successors, (256), 238 states have internal predecessors, (256), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:29:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 262 transitions. [2024-11-28 03:29:40,824 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 262 transitions. Word has length 39 [2024-11-28 03:29:40,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:40,824 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 262 transitions. [2024-11-28 03:29:40,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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:29:40,825 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 262 transitions. [2024-11-28 03:29:40,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-28 03:29:40,825 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:40,825 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:40,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:29:40,825 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 152 more)] === [2024-11-28 03:29:40,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:40,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1366513367, now seen corresponding path program 1 times [2024-11-28 03:29:40,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:40,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276864597] [2024-11-28 03:29:40,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:40,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:41,379 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:41,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:41,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276864597] [2024-11-28 03:29:41,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276864597] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:29:41,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285599716] [2024-11-28 03:29:41,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:41,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:41,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:41,382 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:29:41,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:29:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:41,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-28 03:29:41,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:29:41,869 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:41,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:29:42,045 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:42,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285599716] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:29:42,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:29:42,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2024-11-28 03:29:42,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905230295] [2024-11-28 03:29:42,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:29:42,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 03:29:42,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:42,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 03:29:42,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:29:42,047 INFO L87 Difference]: Start difference. First operand 244 states and 262 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 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:29:42,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:42,134 INFO L93 Difference]: Finished difference Result 252 states and 270 transitions. [2024-11-28 03:29:42,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:29:42,135 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 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 39 [2024-11-28 03:29:42,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:42,137 INFO L225 Difference]: With dead ends: 252 [2024-11-28 03:29:42,137 INFO L226 Difference]: Without dead ends: 252 [2024-11-28 03:29:42,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:29:42,140 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 3 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:42,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 903 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:29:42,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-28 03:29:42,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2024-11-28 03:29:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 161 states have (on average 1.639751552795031) internal successors, (264), 246 states have internal predecessors, (264), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:29:42,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 270 transitions. [2024-11-28 03:29:42,156 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 270 transitions. Word has length 39 [2024-11-28 03:29:42,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:42,157 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 270 transitions. [2024-11-28 03:29:42,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 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:29:42,157 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 270 transitions. [2024-11-28 03:29:42,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 03:29:42,160 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:42,160 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:42,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 03:29:42,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-28 03:29:42,361 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 152 more)] === [2024-11-28 03:29:42,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:42,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1758025627, now seen corresponding path program 2 times [2024-11-28 03:29:42,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:42,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605054910] [2024-11-28 03:29:42,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:29:42,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:42,453 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 03:29:42,454 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:29:42,848 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:29:42,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:42,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605054910] [2024-11-28 03:29:42,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605054910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:42,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:42,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:29:42,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826369412] [2024-11-28 03:29:42,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:42,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:29:42,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:42,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:29:42,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:29:42,851 INFO L87 Difference]: Start difference. First operand 252 states and 270 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:29:43,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:43,200 INFO L93 Difference]: Finished difference Result 269 states and 288 transitions. [2024-11-28 03:29:43,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:29:43,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 47 [2024-11-28 03:29:43,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:43,202 INFO L225 Difference]: With dead ends: 269 [2024-11-28 03:29:43,202 INFO L226 Difference]: Without dead ends: 269 [2024-11-28 03:29:43,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:29:43,203 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 402 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:43,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 151 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:29:43,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-28 03:29:43,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 251. [2024-11-28 03:29:43,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 161 states have (on average 1.6335403726708075) internal successors, (263), 245 states have internal predecessors, (263), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:29:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 269 transitions. [2024-11-28 03:29:43,211 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 269 transitions. Word has length 47 [2024-11-28 03:29:43,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:43,211 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 269 transitions. [2024-11-28 03:29:43,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:29:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 269 transitions. [2024-11-28 03:29:43,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 03:29:43,212 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:43,213 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:43,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:29:43,213 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 152 more)] === [2024-11-28 03:29:43,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:43,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1709098779, now seen corresponding path program 1 times [2024-11-28 03:29:43,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:43,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368720551] [2024-11-28 03:29:43,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:43,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:43,715 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:29:43,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:43,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368720551] [2024-11-28 03:29:43,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368720551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:43,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:43,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:29:43,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016020769] [2024-11-28 03:29:43,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:43,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:29:43,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:43,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:29:43,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:29:43,717 INFO L87 Difference]: Start difference. First operand 251 states and 269 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:29:43,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:43,946 INFO L93 Difference]: Finished difference Result 264 states and 283 transitions. [2024-11-28 03:29:43,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:29:43,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2024-11-28 03:29:43,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:43,948 INFO L225 Difference]: With dead ends: 264 [2024-11-28 03:29:43,948 INFO L226 Difference]: Without dead ends: 264 [2024-11-28 03:29:43,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:29:43,949 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 151 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:43,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 202 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:29:43,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-28 03:29:43,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 246. [2024-11-28 03:29:43,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 161 states have (on average 1.6024844720496894) internal successors, (258), 240 states have internal predecessors, (258), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:29:43,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 264 transitions. [2024-11-28 03:29:43,966 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 264 transitions. Word has length 55 [2024-11-28 03:29:43,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:43,966 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 264 transitions. [2024-11-28 03:29:43,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:29:43,966 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 264 transitions. [2024-11-28 03:29:43,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 03:29:43,967 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:43,967 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:43,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:29:43,967 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 152 more)] === [2024-11-28 03:29:43,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:43,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1709098778, now seen corresponding path program 1 times [2024-11-28 03:29:43,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:43,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096912524] [2024-11-28 03:29:43,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:43,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:29:44,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:44,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096912524] [2024-11-28 03:29:44,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096912524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:44,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:44,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:29:44,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361459125] [2024-11-28 03:29:44,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:44,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:29:44,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:44,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:29:44,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:29:44,935 INFO L87 Difference]: Start difference. First operand 246 states and 264 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:29:45,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:45,220 INFO L93 Difference]: Finished difference Result 267 states and 288 transitions. [2024-11-28 03:29:45,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:29:45,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2024-11-28 03:29:45,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:45,222 INFO L225 Difference]: With dead ends: 267 [2024-11-28 03:29:45,223 INFO L226 Difference]: Without dead ends: 267 [2024-11-28 03:29:45,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:29:45,224 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 216 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:45,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 748 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:29:45,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-28 03:29:45,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 245. [2024-11-28 03:29:45,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 161 states have (on average 1.5962732919254659) internal successors, (257), 239 states have internal predecessors, (257), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:29:45,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 263 transitions. [2024-11-28 03:29:45,236 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 263 transitions. Word has length 55 [2024-11-28 03:29:45,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:45,237 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 263 transitions. [2024-11-28 03:29:45,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:29:45,237 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 263 transitions. [2024-11-28 03:29:45,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-28 03:29:45,237 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:45,237 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:45,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:29:45,238 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 152 more)] === [2024-11-28 03:29:45,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:45,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1007427185, now seen corresponding path program 1 times [2024-11-28 03:29:45,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:45,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571674791] [2024-11-28 03:29:45,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:45,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:45,765 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:29:45,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:45,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571674791] [2024-11-28 03:29:45,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571674791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:45,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:45,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:29:45,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554551035] [2024-11-28 03:29:45,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:45,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:29:45,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:45,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:29:45,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:29:45,769 INFO L87 Difference]: Start difference. First operand 245 states and 263 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:29:45,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:45,891 INFO L93 Difference]: Finished difference Result 266 states and 290 transitions. [2024-11-28 03:29:45,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:29:45,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2024-11-28 03:29:45,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:45,893 INFO L225 Difference]: With dead ends: 266 [2024-11-28 03:29:45,893 INFO L226 Difference]: Without dead ends: 266 [2024-11-28 03:29:45,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:29:45,895 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 193 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:45,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 846 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:29:45,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-28 03:29:45,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 246. [2024-11-28 03:29:45,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 162 states have (on average 1.5925925925925926) internal successors, (258), 240 states have internal predecessors, (258), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:29:45,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 264 transitions. [2024-11-28 03:29:45,907 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 264 transitions. Word has length 59 [2024-11-28 03:29:45,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:45,907 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 264 transitions. [2024-11-28 03:29:45,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:29:45,907 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 264 transitions. [2024-11-28 03:29:45,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-28 03:29:45,908 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:45,908 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:45,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:29:45,909 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 152 more)] === [2024-11-28 03:29:45,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:45,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1007430483, now seen corresponding path program 1 times [2024-11-28 03:29:45,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:45,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444995411] [2024-11-28 03:29:45,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:45,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:46,526 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:29:46,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:46,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444995411] [2024-11-28 03:29:46,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444995411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:46,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:46,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:29:46,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228245701] [2024-11-28 03:29:46,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:46,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:29:46,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:46,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:29:46,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:29:46,527 INFO L87 Difference]: Start difference. First operand 246 states and 264 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:29:47,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:47,012 INFO L93 Difference]: Finished difference Result 276 states and 297 transitions. [2024-11-28 03:29:47,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:29:47,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2024-11-28 03:29:47,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:47,014 INFO L225 Difference]: With dead ends: 276 [2024-11-28 03:29:47,014 INFO L226 Difference]: Without dead ends: 276 [2024-11-28 03:29:47,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:29:47,015 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 258 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:47,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 316 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:29:47,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-28 03:29:47,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 259. [2024-11-28 03:29:47,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 176 states have (on average 1.5795454545454546) internal successors, (278), 253 states have internal predecessors, (278), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:29:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 284 transitions. [2024-11-28 03:29:47,023 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 284 transitions. Word has length 59 [2024-11-28 03:29:47,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:47,024 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 284 transitions. [2024-11-28 03:29:47,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:29:47,024 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 284 transitions. [2024-11-28 03:29:47,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-28 03:29:47,025 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:47,025 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 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:29:47,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:29:47,025 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 152 more)] === [2024-11-28 03:29:47,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:47,026 INFO L85 PathProgramCache]: Analyzing trace with hash 870241343, now seen corresponding path program 1 times [2024-11-28 03:29:47,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:47,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415733055] [2024-11-28 03:29:47,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:47,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:29:47,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:47,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415733055] [2024-11-28 03:29:47,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415733055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:47,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:47,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:29:47,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856922461] [2024-11-28 03:29:47,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:47,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:29:47,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:47,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:29:47,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:29:47,413 INFO L87 Difference]: Start difference. First operand 259 states and 284 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:29:47,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:47,591 INFO L93 Difference]: Finished difference Result 266 states and 293 transitions. [2024-11-28 03:29:47,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:29:47,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2024-11-28 03:29:47,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:47,593 INFO L225 Difference]: With dead ends: 266 [2024-11-28 03:29:47,593 INFO L226 Difference]: Without dead ends: 266 [2024-11-28 03:29:47,593 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:29:47,594 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 143 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:47,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 198 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:29:47,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-28 03:29:47,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2024-11-28 03:29:47,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 183 states have (on average 1.5683060109289617) internal successors, (287), 259 states have internal predecessors, (287), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:29:47,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 293 transitions. [2024-11-28 03:29:47,602 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 293 transitions. Word has length 62 [2024-11-28 03:29:47,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:47,602 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 293 transitions. [2024-11-28 03:29:47,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:29:47,603 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 293 transitions. [2024-11-28 03:29:47,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-28 03:29:47,603 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:47,603 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 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:29:47,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 03:29:47,603 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 152 more)] === [2024-11-28 03:29:47,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:47,604 INFO L85 PathProgramCache]: Analyzing trace with hash 870241344, now seen corresponding path program 1 times [2024-11-28 03:29:47,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:47,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72561804] [2024-11-28 03:29:47,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:47,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:48,709 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:29:48,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:48,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72561804] [2024-11-28 03:29:48,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72561804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:48,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:48,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 03:29:48,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397194316] [2024-11-28 03:29:48,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:48,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:29:48,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:48,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:29:48,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:29:48,711 INFO L87 Difference]: Start difference. First operand 265 states and 293 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:29:49,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:49,703 INFO L93 Difference]: Finished difference Result 270 states and 293 transitions. [2024-11-28 03:29:49,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:29:49,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2024-11-28 03:29:49,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:49,705 INFO L225 Difference]: With dead ends: 270 [2024-11-28 03:29:49,705 INFO L226 Difference]: Without dead ends: 270 [2024-11-28 03:29:49,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:29:49,709 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 23 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:49,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 598 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 03:29:49,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-28 03:29:49,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 265. [2024-11-28 03:29:49,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 183 states have (on average 1.5628415300546448) internal successors, (286), 259 states have internal predecessors, (286), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:29:49,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 292 transitions. [2024-11-28 03:29:49,723 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 292 transitions. Word has length 62 [2024-11-28 03:29:49,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:49,724 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 292 transitions. [2024-11-28 03:29:49,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:29:49,724 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 292 transitions. [2024-11-28 03:29:49,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-28 03:29:49,725 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:49,725 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:49,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 03:29:49,725 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 152 more)] === [2024-11-28 03:29:49,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:49,726 INFO L85 PathProgramCache]: Analyzing trace with hash 937583347, now seen corresponding path program 1 times [2024-11-28 03:29:49,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:49,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53511302] [2024-11-28 03:29:49,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:49,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:50,456 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:29:50,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:50,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53511302] [2024-11-28 03:29:50,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53511302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:50,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:50,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:29:50,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133795595] [2024-11-28 03:29:50,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:50,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:29:50,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:50,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:29:50,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:29:50,459 INFO L87 Difference]: Start difference. First operand 265 states and 292 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:29:50,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:50,916 INFO L93 Difference]: Finished difference Result 264 states and 290 transitions. [2024-11-28 03:29:50,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:29:50,917 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2024-11-28 03:29:50,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:50,919 INFO L225 Difference]: With dead ends: 264 [2024-11-28 03:29:50,919 INFO L226 Difference]: Without dead ends: 264 [2024-11-28 03:29:50,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:29:50,920 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 156 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:50,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 688 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:29:50,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-28 03:29:50,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-11-28 03:29:50,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 183 states have (on average 1.5519125683060109) internal successors, (284), 258 states have internal predecessors, (284), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:29:50,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 290 transitions. [2024-11-28 03:29:50,927 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 290 transitions. Word has length 65 [2024-11-28 03:29:50,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:50,928 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 290 transitions. [2024-11-28 03:29:50,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:29:50,928 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 290 transitions. [2024-11-28 03:29:50,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-28 03:29:50,928 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:50,929 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:50,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 03:29:50,929 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 152 more)] === [2024-11-28 03:29:50,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:50,929 INFO L85 PathProgramCache]: Analyzing trace with hash 937583348, now seen corresponding path program 1 times [2024-11-28 03:29:50,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:50,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927277171] [2024-11-28 03:29:50,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:50,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:51,922 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:29:51,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:51,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927277171] [2024-11-28 03:29:51,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927277171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:51,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:51,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:29:51,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828882346] [2024-11-28 03:29:51,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:51,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:29:51,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:51,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:29:51,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:29:51,925 INFO L87 Difference]: Start difference. First operand 264 states and 290 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:29:52,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:52,400 INFO L93 Difference]: Finished difference Result 263 states and 288 transitions. [2024-11-28 03:29:52,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:29:52,401 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2024-11-28 03:29:52,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:52,402 INFO L225 Difference]: With dead ends: 263 [2024-11-28 03:29:52,402 INFO L226 Difference]: Without dead ends: 263 [2024-11-28 03:29:52,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:29:52,403 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 155 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:52,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 717 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:29:52,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-28 03:29:52,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2024-11-28 03:29:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 183 states have (on average 1.540983606557377) internal successors, (282), 257 states have internal predecessors, (282), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:29:52,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 288 transitions. [2024-11-28 03:29:52,411 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 288 transitions. Word has length 65 [2024-11-28 03:29:52,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:52,411 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 288 transitions. [2024-11-28 03:29:52,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:29:52,411 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 288 transitions. [2024-11-28 03:29:52,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 03:29:52,412 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:52,412 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:52,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 03:29:52,412 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 152 more)] === [2024-11-28 03:29:52,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:52,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1382771240, now seen corresponding path program 1 times [2024-11-28 03:29:52,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:52,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731858585] [2024-11-28 03:29:52,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:52,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:53,405 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:29:53,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:53,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731858585] [2024-11-28 03:29:53,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731858585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:53,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:53,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:29:53,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509945190] [2024-11-28 03:29:53,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:53,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:29:53,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:53,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:29:53,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:29:53,409 INFO L87 Difference]: Start difference. First operand 263 states and 288 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:29:54,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:54,202 INFO L93 Difference]: Finished difference Result 280 states and 308 transitions. [2024-11-28 03:29:54,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:29:54,203 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2024-11-28 03:29:54,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:54,204 INFO L225 Difference]: With dead ends: 280 [2024-11-28 03:29:54,204 INFO L226 Difference]: Without dead ends: 280 [2024-11-28 03:29:54,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:29:54,205 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 185 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:54,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 894 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 03:29:54,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-28 03:29:54,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 271. [2024-11-28 03:29:54,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 191 states have (on average 1.544502617801047) internal successors, (295), 265 states have internal predecessors, (295), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:29:54,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 301 transitions. [2024-11-28 03:29:54,214 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 301 transitions. Word has length 70 [2024-11-28 03:29:54,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:54,214 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 301 transitions. [2024-11-28 03:29:54,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:29:54,214 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 301 transitions. [2024-11-28 03:29:54,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 03:29:54,215 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:54,216 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:54,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 03:29:54,216 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 152 more)] === [2024-11-28 03:29:54,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:54,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1382771241, now seen corresponding path program 1 times [2024-11-28 03:29:54,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:54,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638423500] [2024-11-28 03:29:54,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:54,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:55,643 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:29:55,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:55,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638423500] [2024-11-28 03:29:55,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638423500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:55,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:55,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:29:55,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891723043] [2024-11-28 03:29:55,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:55,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 03:29:55,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:55,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 03:29:55,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:29:55,646 INFO L87 Difference]: Start difference. First operand 271 states and 301 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:29:56,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:56,313 INFO L93 Difference]: Finished difference Result 278 states and 303 transitions. [2024-11-28 03:29:56,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:29:56,313 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2024-11-28 03:29:56,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:56,315 INFO L225 Difference]: With dead ends: 278 [2024-11-28 03:29:56,315 INFO L226 Difference]: Without dead ends: 278 [2024-11-28 03:29:56,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-28 03:29:56,316 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 328 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:56,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 469 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 03:29:56,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-28 03:29:56,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 271. [2024-11-28 03:29:56,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 191 states have (on average 1.5235602094240839) internal successors, (291), 265 states have internal predecessors, (291), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:29:56,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 297 transitions. [2024-11-28 03:29:56,324 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 297 transitions. Word has length 70 [2024-11-28 03:29:56,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:56,324 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 297 transitions. [2024-11-28 03:29:56,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:29:56,325 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 297 transitions. [2024-11-28 03:29:56,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 03:29:56,325 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:56,325 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:56,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 03:29:56,326 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 152 more)] === [2024-11-28 03:29:56,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:56,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1295045724, now seen corresponding path program 1 times [2024-11-28 03:29:56,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:56,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028593719] [2024-11-28 03:29:56,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:56,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:57,247 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:29:57,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:57,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028593719] [2024-11-28 03:29:57,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028593719] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:29:57,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322986617] [2024-11-28 03:29:57,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:57,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:57,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:57,251 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:29:57,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 03:29:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:57,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 1289 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-28 03:29:57,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:29:57,766 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 10 treesize of output 8 [2024-11-28 03:29:57,800 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:29:57,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:29:57,821 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 23 treesize of output 1 [2024-11-28 03:29:57,848 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 21 treesize of output 16 [2024-11-28 03:29:57,886 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:29:57,886 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 50 treesize of output 49 [2024-11-28 03:29:57,986 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:29:57,986 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 50 treesize of output 49 [2024-11-28 03:29:58,015 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 37 treesize of output 13 [2024-11-28 03:29:58,021 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-28 03:29:58,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:29:58,049 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2089 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_2089) |c_ULTIMATE.start_main_~argv~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) 1)) is different from false [2024-11-28 03:29:58,077 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2089 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_2089) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) 1)) is different from false [2024-11-28 03:29:58,112 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2024-11-28 03:29:58,112 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 37 treesize of output 36 [2024-11-28 03:29:58,214 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2087 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2087) |c_ULTIMATE.start_main_~argv~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|)) |c_ULTIMATE.start_main_~argv~0#1.base|))) is different from false [2024-11-28 03:29:58,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:29:58,231 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 27 treesize of output 28 [2024-11-28 03:29:58,238 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 45 treesize of output 29 [2024-11-28 03:29:58,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-28 03:29:58,345 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:29:58,345 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 13 treesize of output 12 [2024-11-28 03:29:58,364 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 4 not checked. [2024-11-28 03:29:58,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322986617] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:29:58,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:29:58,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 17 [2024-11-28 03:29:58,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660812019] [2024-11-28 03:29:58,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:29:58,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 03:29:58,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:58,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 03:29:58,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=168, Unknown=6, NotChecked=84, Total=306 [2024-11-28 03:29:58,368 INFO L87 Difference]: Start difference. First operand 271 states and 297 transitions. Second operand has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:29:59,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:59,427 INFO L93 Difference]: Finished difference Result 277 states and 301 transitions. [2024-11-28 03:29:59,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:29:59,427 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2024-11-28 03:29:59,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:59,429 INFO L225 Difference]: With dead ends: 277 [2024-11-28 03:29:59,429 INFO L226 Difference]: Without dead ends: 277 [2024-11-28 03:29:59,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 143 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=291, Unknown=6, NotChecked=114, Total=506 [2024-11-28 03:29:59,430 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 307 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 610 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:59,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1302 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 861 Invalid, 0 Unknown, 610 Unchecked, 0.9s Time] [2024-11-28 03:29:59,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-28 03:29:59,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 270. [2024-11-28 03:29:59,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 191 states have (on average 1.513089005235602) internal successors, (289), 264 states have internal predecessors, (289), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:29:59,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 295 transitions. [2024-11-28 03:29:59,438 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 295 transitions. Word has length 75 [2024-11-28 03:29:59,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:59,438 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 295 transitions. [2024-11-28 03:29:59,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:29:59,438 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 295 transitions. [2024-11-28 03:29:59,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 03:29:59,439 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:59,439 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:59,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-28 03:29:59,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:59,643 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 152 more)] === [2024-11-28 03:29:59,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:59,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1295045723, now seen corresponding path program 1 times [2024-11-28 03:29:59,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:59,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496332388] [2024-11-28 03:29:59,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:59,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:01,402 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:30:01,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:30:01,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496332388] [2024-11-28 03:30:01,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496332388] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:30:01,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115423815] [2024-11-28 03:30:01,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:01,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:01,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:30:01,407 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:30:01,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 03:30:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:01,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 1289 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-28 03:30:01,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:30:01,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-28 03:30:01,960 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:30:01,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:30:02,023 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 23 treesize of output 1 [2024-11-28 03:30:02,028 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 23 treesize of output 1 [2024-11-28 03:30:02,094 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 21 treesize of output 16 [2024-11-28 03:30:02,100 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:30:02,206 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:30:02,206 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 84 treesize of output 79 [2024-11-28 03:30:02,213 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 59 treesize of output 36 [2024-11-28 03:30:02,415 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:30:02,416 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 84 treesize of output 79 [2024-11-28 03:30:02,426 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 59 treesize of output 36 [2024-11-28 03:30:02,511 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 47 treesize of output 23 [2024-11-28 03:30:02,518 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 38 treesize of output 14 [2024-11-28 03:30:02,563 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:30:02,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:30:02,805 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2373 (Array Int Int)) (v_ArrVal_2372 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2372) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2373) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_2372 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2372) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1)))))) is different from false [2024-11-28 03:30:02,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:30:02,934 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 96 treesize of output 100 [2024-11-28 03:30:03,010 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2372 (Array Int Int)) (v_ArrVal_2371 (Array Int Int)) (v_ArrVal_2370 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem175#1.base| v_ArrVal_2370) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem175#1.base| v_ArrVal_2371) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_2372) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) (+ |c_ULTIMATE.start_main_#t~mem175#1.offset| 10))) (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem175#1.base| v_prenex_3) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem175#1.base| v_prenex_2) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_prenex_1) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 1))) (forall ((v_ArrVal_2373 (Array Int Int)) (v_ArrVal_2371 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem175#1.base| v_ArrVal_2371))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_2373)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem175#1.base|)))) is different from false [2024-11-28 03:30:03,045 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2373 (Array Int Int)) (v_ArrVal_2371 (Array Int Int))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2371))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2373)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_3) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_prenex_2) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_prenex_1) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1))) (forall ((v_ArrVal_2372 (Array Int Int)) (v_ArrVal_2371 (Array Int Int)) (v_ArrVal_2370 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2370) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2371) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2372) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 10)))))) is different from false [2024-11-28 03:30:03,091 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2368 (Array Int Int)) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2368))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2369) .cse0 v_prenex_3) (select (select (store .cse1 .cse0 v_prenex_2) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_prenex_1))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1))) (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2368 (Array Int Int)) (v_ArrVal_2372 (Array Int Int)) (v_ArrVal_2371 (Array Int Int)) (v_ArrVal_2370 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2369))) (< (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2368))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store .cse3 .cse4 v_ArrVal_2370) (select (select (store .cse5 .cse4 v_ArrVal_2371) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2372))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) (+ (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 10)))) (forall ((v_ArrVal_2368 (Array Int Int)) (v_ArrVal_2373 (Array Int Int)) (v_ArrVal_2371 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2368))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (= (select (select (let ((.cse6 (store .cse7 .cse8 v_ArrVal_2371))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2373)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse8)))))) is different from false [2024-11-28 03:30:03,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:30:03,163 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 106 treesize of output 107 [2024-11-28 03:30:03,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:30:03,172 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 94 treesize of output 71 [2024-11-28 03:30:03,180 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 852 treesize of output 716 [2024-11-28 03:30:03,205 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 4463 treesize of output 4247 [2024-11-28 03:30:03,252 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 655 treesize of output 631 [2024-11-28 03:30:03,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 631 treesize of output 559 [2024-11-28 03:30:03,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 559 treesize of output 535 [2024-11-28 03:30:03,284 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 535 treesize of output 463 [2024-11-28 03:30:03,293 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 463 treesize of output 391 [2024-11-28 03:30:03,552 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-28 03:30:03,553 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 1 [2024-11-28 03:30:03,562 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-28 03:30:03,562 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 1 [2024-11-28 03:30:03,709 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:30:03,710 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 13 treesize of output 12 [2024-11-28 03:30:03,720 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 190 trivial. 2 not checked. [2024-11-28 03:30:03,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115423815] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:30:03,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:30:03,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 32 [2024-11-28 03:30:03,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858074236] [2024-11-28 03:30:03,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:30:03,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-28 03:30:03,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:30:03,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-28 03:30:03,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=16, NotChecked=228, Total=1056 [2024-11-28 03:30:03,723 INFO L87 Difference]: Start difference. First operand 270 states and 295 transitions. Second operand has 33 states, 32 states have (on average 2.375) internal successors, (76), 33 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:30:06,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:30:06,211 INFO L93 Difference]: Finished difference Result 297 states and 325 transitions. [2024-11-28 03:30:06,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 03:30:06,213 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.375) internal successors, (76), 33 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2024-11-28 03:30:06,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:30:06,214 INFO L225 Difference]: With dead ends: 297 [2024-11-28 03:30:06,215 INFO L226 Difference]: Without dead ends: 297 [2024-11-28 03:30:06,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=263, Invalid=1216, Unknown=19, NotChecked=308, Total=1806 [2024-11-28 03:30:06,216 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 358 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 16 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 2276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 866 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:30:06,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1509 Invalid, 2276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1370 Invalid, 24 Unknown, 866 Unchecked, 1.7s Time] [2024-11-28 03:30:06,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-28 03:30:06,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 290. [2024-11-28 03:30:06,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 211 states have (on average 1.4834123222748816) internal successors, (313), 284 states have internal predecessors, (313), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:30:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 319 transitions. [2024-11-28 03:30:06,230 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 319 transitions. Word has length 75 [2024-11-28 03:30:06,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:30:06,230 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 319 transitions. [2024-11-28 03:30:06,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.375) internal successors, (76), 33 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:30:06,230 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 319 transitions. [2024-11-28 03:30:06,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-28 03:30:06,231 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:30:06,231 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:30:06,243 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 03:30:06,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:06,436 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 152 more)] === [2024-11-28 03:30:06,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:06,436 INFO L85 PathProgramCache]: Analyzing trace with hash 596292436, now seen corresponding path program 1 times [2024-11-28 03:30:06,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:30:06,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074598324] [2024-11-28 03:30:06,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:06,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:30:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:06,694 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:30:06,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:30:06,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074598324] [2024-11-28 03:30:06,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074598324] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:30:06,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77614221] [2024-11-28 03:30:06,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:06,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:06,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:30:06,696 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:30:06,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 03:30:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:07,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 1323 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 03:30:07,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:30:07,240 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:30:07,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:30:07,291 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:30:07,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77614221] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:30:07,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:30:07,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-28 03:30:07,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889454641] [2024-11-28 03:30:07,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:30:07,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:30:07,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:30:07,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:30:07,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:30:07,293 INFO L87 Difference]: Start difference. First operand 290 states and 319 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:30:07,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:30:07,340 INFO L93 Difference]: Finished difference Result 319 states and 347 transitions. [2024-11-28 03:30:07,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:30:07,340 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2024-11-28 03:30:07,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:30:07,342 INFO L225 Difference]: With dead ends: 319 [2024-11-28 03:30:07,342 INFO L226 Difference]: Without dead ends: 319 [2024-11-28 03:30:07,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:30:07,343 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 22 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:30:07,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 436 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:30:07,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-28 03:30:07,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 314. [2024-11-28 03:30:07,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 235 states have (on average 1.451063829787234) internal successors, (341), 308 states have internal predecessors, (341), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:30:07,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 347 transitions. [2024-11-28 03:30:07,351 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 347 transitions. Word has length 81 [2024-11-28 03:30:07,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:30:07,352 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 347 transitions. [2024-11-28 03:30:07,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:30:07,352 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 347 transitions. [2024-11-28 03:30:07,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-28 03:30:07,353 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:30:07,353 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:30:07,366 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 03:30:07,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-28 03:30:07,554 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 152 more)] === [2024-11-28 03:30:07,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:07,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1298271781, now seen corresponding path program 2 times [2024-11-28 03:30:07,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:30:07,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71081713] [2024-11-28 03:30:07,554 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:30:07,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:30:07,719 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:30:07,719 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:30:10,028 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:30:10,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:30:10,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71081713] [2024-11-28 03:30:10,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71081713] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:30:10,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913015490] [2024-11-28 03:30:10,029 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:30:10,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:10,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:30:10,032 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:30:10,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 03:30:10,806 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:30:10,806 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:30:10,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 1347 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-28 03:30:10,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:30:10,828 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 10 treesize of output 8 [2024-11-28 03:30:10,860 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:30:10,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:30:10,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 03:30:10,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-28 03:30:10,922 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 23 treesize of output 1 [2024-11-28 03:30:10,999 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 34 treesize of output 27 [2024-11-28 03:30:11,004 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:30:11,107 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:30:11,107 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 74 treesize of output 69 [2024-11-28 03:30:11,117 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 36 treesize of output 15 [2024-11-28 03:30:11,266 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:30:11,267 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 74 treesize of output 69 [2024-11-28 03:30:11,276 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 36 treesize of output 15 [2024-11-28 03:30:11,431 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:30:11,431 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 74 treesize of output 69 [2024-11-28 03:30:11,456 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 36 treesize of output 15 [2024-11-28 03:30:11,611 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:30:11,612 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 74 treesize of output 69 [2024-11-28 03:30:11,623 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 36 treesize of output 15 [2024-11-28 03:30:11,694 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 37 treesize of output 13 [2024-11-28 03:30:11,701 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 11 treesize of output 3 [2024-11-28 03:30:11,735 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:30:11,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:30:12,097 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2971 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2971) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2972) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_2971 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2971) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2)))))) is different from false [2024-11-28 03:30:12,119 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_2969) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_2970) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_2971) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_~j~0#1| 2))) (forall ((v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_2970))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_2969) .cse1 v_ArrVal_2971) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_~j~0#1| 3) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2972) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))))) is different from false [2024-11-28 03:30:12,156 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2969) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2970) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2971) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2970))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2969) .cse2 v_ArrVal_2971) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2972) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))))) is different from false [2024-11-28 03:30:12,191 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2970))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2969) .cse1 v_ArrVal_2971) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2972) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2969) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2970) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2971) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))))) is different from false [2024-11-28 03:30:12,221 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2968 (Array Int Int)) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_2968))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_2967) .cse0 v_ArrVal_2969) (select (select (store .cse1 .cse0 v_ArrVal_2970) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2971))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (forall ((v_ArrVal_2968 (Array Int Int)) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_2968))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2970))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_2967) .cse3 v_ArrVal_2969) .cse4 v_ArrVal_2971) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2972) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))))) is different from false [2024-11-28 03:30:12,294 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2968 (Array Int Int)) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2968))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2970))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2967) .cse1 v_ArrVal_2969) .cse2 v_ArrVal_2971) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 4) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2972) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_2968 (Array Int Int)) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2968))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2967) .cse6 v_ArrVal_2969) (select (select (store .cse7 .cse6 v_ArrVal_2970) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2971))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2024-11-28 03:30:12,341 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2968 (Array Int Int)) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2968))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2970))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2967) .cse1 v_ArrVal_2969) .cse2 v_ArrVal_2971) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 4) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2972) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_2968 (Array Int Int)) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (<= 0 (+ 3 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2968))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2967) .cse6 v_ArrVal_2969) (select (select (store .cse7 .cse6 v_ArrVal_2970) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2971))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2024-11-28 03:30:12,386 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2968 (Array Int Int)) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2966 (Array Int Int)) (v_ArrVal_2965 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (<= 0 (+ 3 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem175#1.base| v_ArrVal_2965))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2968))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem175#1.base| v_ArrVal_2966) .cse0 v_ArrVal_2967) .cse1 v_ArrVal_2969) (select (select (store .cse2 .cse1 v_ArrVal_2970) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2971))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))) (forall ((v_ArrVal_2968 (Array Int Int)) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2966 (Array Int Int)) (v_ArrVal_2965 (Array Int Int)) (v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem175#1.base| v_ArrVal_2965))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2968))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2970))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ 4 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem175#1.base| v_ArrVal_2966) .cse5 v_ArrVal_2967) .cse6 v_ArrVal_2969) .cse7 v_ArrVal_2971) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2972) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))))) is different from false [2024-11-28 03:30:22,543 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2968 (Array Int Int)) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2966 (Array Int Int)) (v_ArrVal_2965 (Array Int Int)) (v_ArrVal_2964 (Array Int Int)) (v_ArrVal_2963 (Array Int Int)) (v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2963))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_2965))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2968))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_2970))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (<= (+ 4 (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2964) .cse0 v_ArrVal_2966) .cse1 v_ArrVal_2967) .cse2 v_ArrVal_2969) .cse3 v_ArrVal_2971) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_2972) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))))) (forall ((v_ArrVal_2968 (Array Int Int)) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2966 (Array Int Int)) (v_ArrVal_2965 (Array Int Int)) (v_ArrVal_2964 (Array Int Int)) (v_ArrVal_2963 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (<= 0 (+ 3 (select (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2963))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_2965))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_2968))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2964) .cse9 v_ArrVal_2966) .cse10 v_ArrVal_2967) .cse11 v_ArrVal_2969) (select (select (store .cse12 .cse11 v_ArrVal_2970) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_2971))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))) is different from false [2024-11-28 03:30:22,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:30:22,632 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 833 treesize of output 834 [2024-11-28 03:30:22,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:30:22,650 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 821 treesize of output 462 [2024-11-28 03:30:23,184 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 54679098 treesize of output 49481426 [2024-11-28 03:30:27,351 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 1861837 treesize of output 1848237 [2024-11-28 03:30:27,578 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 1700 treesize of output 1604 [2024-11-28 03:30:27,591 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 1604 treesize of output 1538 [2024-11-28 03:30:27,608 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 1538 treesize of output 1358 [2024-11-28 03:30:27,628 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 1358 treesize of output 1268 [2024-11-28 03:30:27,645 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 1268 treesize of output 1064 [2024-11-28 03:30:27,659 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 1064 treesize of output 824 [2024-11-28 03:30:27,672 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 824 treesize of output 776 [2024-11-28 03:30:27,690 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 776 treesize of output 752 [2024-11-28 03:30:27,710 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 390 treesize of output 354 [2024-11-28 03:30:27,728 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 354 treesize of output 348 [2024-11-28 03:30:28,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:30:28,030 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 418 treesize of output 419 [2024-11-28 03:30:28,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:30:28,045 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 406 treesize of output 239 [2024-11-28 03:30:28,053 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:30:28,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24654 treesize of output 17990 [2024-11-28 03:30:28,118 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:30:28,119 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:30:28,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2024-11-28 03:30:28,417 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:30:28,417 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 13 treesize of output 12 [2024-11-28 03:30:28,438 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 23 not checked. [2024-11-28 03:30:28,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913015490] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:30:28,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:30:28,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 19] total 45 [2024-11-28 03:30:28,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521506127] [2024-11-28 03:30:28,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:30:28,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-28 03:30:28,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:30:28,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-28 03:30:28,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1137, Unknown=26, NotChecked=702, Total=2070 [2024-11-28 03:30:28,442 INFO L87 Difference]: Start difference. First operand 314 states and 347 transitions. Second operand has 46 states, 45 states have (on average 2.3555555555555556) internal successors, (106), 46 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:30:35,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:30:35,162 INFO L93 Difference]: Finished difference Result 327 states and 356 transitions. [2024-11-28 03:30:35,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 03:30:35,163 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.3555555555555556) internal successors, (106), 46 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2024-11-28 03:30:35,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:30:35,164 INFO L225 Difference]: With dead ends: 327 [2024-11-28 03:30:35,164 INFO L226 Difference]: Without dead ends: 327 [2024-11-28 03:30:35,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 144 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=476, Invalid=2290, Unknown=26, NotChecked=990, Total=3782 [2024-11-28 03:30:35,167 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 409 mSDsluCounter, 1527 mSDsCounter, 0 mSdLazyCounter, 1805 mSolverCounterSat, 25 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 3961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1805 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 2118 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:30:35,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 1672 Invalid, 3961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1805 Invalid, 13 Unknown, 2118 Unchecked, 4.3s Time] [2024-11-28 03:30:35,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-28 03:30:35,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 320. [2024-11-28 03:30:35,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 241 states have (on average 1.4273858921161826) internal successors, (344), 314 states have internal predecessors, (344), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:30:35,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 350 transitions. [2024-11-28 03:30:35,175 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 350 transitions. Word has length 85 [2024-11-28 03:30:35,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:30:35,175 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 350 transitions. [2024-11-28 03:30:35,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.3555555555555556) internal successors, (106), 46 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:30:35,176 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 350 transitions. [2024-11-28 03:30:35,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-28 03:30:35,177 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:30:35,177 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:30:35,190 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 03:30:35,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-28 03:30:35,378 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 152 more)] === [2024-11-28 03:30:35,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:35,378 INFO L85 PathProgramCache]: Analyzing trace with hash 864514729, now seen corresponding path program 3 times [2024-11-28 03:30:35,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:30:35,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344390875] [2024-11-28 03:30:35,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:30:35,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:30:36,111 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-28 03:30:36,111 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:30:39,610 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:30:39,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:30:39,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344390875] [2024-11-28 03:30:39,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344390875] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:30:39,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744777932] [2024-11-28 03:30:39,611 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:30:39,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:39,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:30:39,613 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:30:39,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a0e675-7108-46d8-90a9-49302ee32148/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 03:30:51,974 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-28 03:30:51,974 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:30:51,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 1350 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-28 03:30:51,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:30:52,000 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 10 treesize of output 8 [2024-11-28 03:30:52,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 03:30:52,262 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:30:52,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:30:52,383 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 23 treesize of output 1 [2024-11-28 03:30:52,394 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 23 treesize of output 1 [2024-11-28 03:30:52,689 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 34 treesize of output 27 [2024-11-28 03:30:52,710 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:30:52,979 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:30:52,979 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 74 treesize of output 69 [2024-11-28 03:30:52,997 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 36 treesize of output 15 [2024-11-28 03:30:53,362 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:30:53,363 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 74 treesize of output 69 [2024-11-28 03:30:53,380 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 36 treesize of output 15 [2024-11-28 03:30:53,824 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:30:53,824 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 74 treesize of output 69 [2024-11-28 03:30:53,848 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 36 treesize of output 15 [2024-11-28 03:30:54,296 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:30:54,296 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 74 treesize of output 69 [2024-11-28 03:30:54,314 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 36 treesize of output 15 [2024-11-28 03:30:54,764 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:30:54,765 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 74 treesize of output 69 [2024-11-28 03:30:54,791 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 49 treesize of output 26 [2024-11-28 03:30:55,429 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:30:55,430 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 109 treesize of output 102 [2024-11-28 03:30:55,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 54 [2024-11-28 03:30:55,848 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:30:55,849 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 93 treesize of output 86 [2024-11-28 03:30:55,864 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 79 treesize of output 23 [2024-11-28 03:30:56,075 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 37 treesize of output 13 [2024-11-28 03:30:56,082 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 36 treesize of output 12 [2024-11-28 03:30:56,203 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:30:56,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:30:56,531 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem176#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_#t~mem176#1.offset| |c_ULTIMATE.start_main_~j~0#1|))) (and (forall ((v_ArrVal_3328 (Array Int Int))) (or (not (= v_ArrVal_3328 (store .cse0 .cse1 (select v_ArrVal_3328 .cse1)))) (< 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 2)))) (forall ((v_ArrVal_3328 (Array Int Int))) (or (forall ((v_ArrVal_3327 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_3327) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (not (= v_ArrVal_3328 (store .cse0 .cse1 (select v_ArrVal_3328 .cse1)))))))) is different from false [2024-11-28 03:30:56,600 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (.cse3 (select |c_#memory_$Pointer$.offset| .cse1))) (and (forall ((|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int)) (or (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| .cse0) (forall ((v_ArrVal_3328 (Array Int Int))) (or (< 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (not (= (let ((.cse4 (+ |c_ULTIMATE.start_main_~j~0#1| |v_ULTIMATE.start_main_#t~mem176#1.offset_21|))) (store .cse3 .cse4 (select v_ArrVal_3328 .cse4))) v_ArrVal_3328)))))) (forall ((|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int)) (or (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| .cse0) (forall ((v_ArrVal_3328 (Array Int Int))) (or (not (= (let ((.cse5 (+ |c_ULTIMATE.start_main_~j~0#1| |v_ULTIMATE.start_main_#t~mem176#1.offset_21|))) (store .cse3 .cse5 (select v_ArrVal_3328 .cse5))) v_ArrVal_3328)) (forall ((v_ArrVal_3327 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3327) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))))))) is different from false [2024-11-28 03:30:56,694 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (.cse3 (select |c_#memory_$Pointer$.offset| .cse1))) (and (forall ((|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int)) (or (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| .cse0) (forall ((v_ArrVal_3328 (Array Int Int))) (or (< 0 (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (not (= v_ArrVal_3328 (let ((.cse4 (+ |c_ULTIMATE.start_main_~j~0#1| |v_ULTIMATE.start_main_#t~mem176#1.offset_21| 1))) (store .cse3 .cse4 (select v_ArrVal_3328 .cse4))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int)) (or (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| .cse0) (forall ((v_ArrVal_3328 (Array Int Int))) (or (forall ((v_ArrVal_3327 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3327) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (not (= v_ArrVal_3328 (let ((.cse5 (+ |c_ULTIMATE.start_main_~j~0#1| |v_ULTIMATE.start_main_#t~mem176#1.offset_21| 1))) (store .cse3 .cse5 (select v_ArrVal_3328 .cse5))))))))))))) is different from false [2024-11-28 03:31:16,581 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (and (forall ((|v_ULTIMATE.start_main_~j~0#1_40| Int)) (or (< .cse0 |v_ULTIMATE.start_main_~j~0#1_40|) (< (+ |v_ULTIMATE.start_main_~j~0#1_40| .cse1) 0) (forall ((v_ArrVal_3324 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_3324))) (let ((.cse10 (+ (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) |v_ULTIMATE.start_main_~j~0#1_40| 1))) (or (forall ((v_ArrVal_3323 (Array Int Int)) (v_ArrVal_3326 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int) (v_ArrVal_3325 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_3323))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse2 (store .cse8 .cse7 v_ArrVal_3326))) (or (forall ((v_ArrVal_3328 (Array Int Int))) (let ((.cse3 (select (select (store .cse6 .cse7 v_ArrVal_3325) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (or (not (= v_ArrVal_3328 (let ((.cse4 (+ |v_ULTIMATE.start_main_~j~0#1_40| 2 |v_ULTIMATE.start_main_#t~mem176#1.offset_21|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_3328 .cse4))))) (< 0 (+ |v_ULTIMATE.start_main_~j~0#1_40| 4 (select (select (store .cse2 .cse3 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))))) (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))))))) (not (= v_ArrVal_3326 (store v_ArrVal_3324 .cse10 (select v_ArrVal_3326 .cse10)))))) (< .cse10 0))))))) (forall ((|v_ULTIMATE.start_main_~j~0#1_40| Int)) (or (< .cse0 |v_ULTIMATE.start_main_~j~0#1_40|) (forall ((v_ArrVal_3324 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_3324))) (let ((.cse18 (+ (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) |v_ULTIMATE.start_main_~j~0#1_40| 1))) (or (forall ((v_ArrVal_3323 (Array Int Int)) (v_ArrVal_3326 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_3323))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (or (forall ((|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int) (v_ArrVal_3325 (Array Int Int))) (let ((.cse11 (store .cse17 .cse16 v_ArrVal_3326))) (or (forall ((v_ArrVal_3328 (Array Int Int))) (let ((.cse14 (store .cse15 .cse16 v_ArrVal_3325))) (let ((.cse12 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (or (not (= v_ArrVal_3328 (let ((.cse13 (+ |v_ULTIMATE.start_main_~j~0#1_40| 2 |v_ULTIMATE.start_main_#t~mem176#1.offset_21|))) (store (select .cse11 .cse12) .cse13 (select v_ArrVal_3328 .cse13))))) (forall ((v_ArrVal_3327 (Array Int Int))) (<= (+ |v_ULTIMATE.start_main_~j~0#1_40| 4 (select (select (store .cse11 .cse12 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)) (select |c_#length| (select (select (store .cse14 .cse12 v_ArrVal_3327) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))))))) (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))))) (not (= (store (select .cse17 .cse16) .cse18 (select v_ArrVal_3326 .cse18)) v_ArrVal_3326)))))) (< .cse18 0))))) (< (+ |v_ULTIMATE.start_main_~j~0#1_40| .cse1) 0)))))) is different from false [2024-11-28 03:31:16,850 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_3321 (Array Int Int)) (v_ArrVal_3322 (Array Int Int)) (|v_ULTIMATE.start_main_~j~0#1_40| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_3322))) (or (< .cse0 |v_ULTIMATE.start_main_~j~0#1_40|) (< (+ (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |v_ULTIMATE.start_main_~j~0#1_40|) 0) (forall ((v_ArrVal_3324 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_3321))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse8 (store .cse1 .cse10 v_ArrVal_3324))) (let ((.cse11 (+ (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |v_ULTIMATE.start_main_~j~0#1_40| 1))) (or (forall ((v_ArrVal_3323 (Array Int Int)) (v_ArrVal_3326 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int) (v_ArrVal_3325 (Array Int Int))) (let ((.cse6 (store .cse9 .cse10 v_ArrVal_3323))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store .cse8 .cse7 v_ArrVal_3326))) (or (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (forall ((v_ArrVal_3328 (Array Int Int))) (let ((.cse4 (select (select (store .cse6 .cse7 v_ArrVal_3325) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (< 0 (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select (store .cse3 .cse4 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 4)) (not (= (let ((.cse5 (+ |v_ULTIMATE.start_main_~j~0#1_40| 2 |v_ULTIMATE.start_main_#t~mem176#1.offset_21|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_3328 .cse5))) v_ArrVal_3328)))))))))) (not (= v_ArrVal_3326 (store v_ArrVal_3324 .cse11 (select v_ArrVal_3326 .cse11)))))) (< .cse11 0)))))))))) (forall ((v_ArrVal_3321 (Array Int Int)) (v_ArrVal_3322 (Array Int Int)) (|v_ULTIMATE.start_main_~j~0#1_40| Int)) (let ((.cse22 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_3322))) (or (< .cse0 |v_ULTIMATE.start_main_~j~0#1_40|) (forall ((v_ArrVal_3324 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_3321))) (let ((.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse18 (store .cse22 .cse21 v_ArrVal_3324))) (let ((.cse19 (+ (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |v_ULTIMATE.start_main_~j~0#1_40| 1))) (or (forall ((v_ArrVal_3323 (Array Int Int)) (v_ArrVal_3326 (Array Int Int))) (let ((.cse16 (store .cse20 .cse21 v_ArrVal_3323))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (forall ((|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int) (v_ArrVal_3325 (Array Int Int))) (let ((.cse12 (store .cse18 .cse17 v_ArrVal_3326))) (or (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (forall ((v_ArrVal_3328 (Array Int Int))) (let ((.cse14 (store .cse16 .cse17 v_ArrVal_3325))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (forall ((v_ArrVal_3327 (Array Int Int))) (<= (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select (store .cse12 .cse13 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse14 .cse13 v_ArrVal_3327) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (not (= (let ((.cse15 (+ |v_ULTIMATE.start_main_~j~0#1_40| 2 |v_ULTIMATE.start_main_#t~mem176#1.offset_21|))) (store (select .cse12 .cse13) .cse15 (select v_ArrVal_3328 .cse15))) v_ArrVal_3328))))))))) (not (= v_ArrVal_3326 (store (select .cse18 .cse17) .cse19 (select v_ArrVal_3326 .cse19)))))))) (< .cse19 0))))))) (< (+ (select (select .cse22 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |v_ULTIMATE.start_main_~j~0#1_40|) 0)))))) is different from false [2024-11-28 03:31:17,251 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_3321 (Array Int Int)) (v_ArrVal_3322 (Array Int Int)) (|v_ULTIMATE.start_main_~j~0#1_40| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse12 v_ArrVal_3322))) (or (< .cse0 |v_ULTIMATE.start_main_~j~0#1_40|) (< (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) 0) (forall ((v_ArrVal_3324 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse12 v_ArrVal_3321))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse9 (store .cse1 .cse11 v_ArrVal_3324))) (let ((.cse3 (+ (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |v_ULTIMATE.start_main_~j~0#1_40| 1))) (or (< .cse3 0) (forall ((v_ArrVal_3323 (Array Int Int)) (v_ArrVal_3326 (Array Int Int))) (or (not (= v_ArrVal_3326 (store v_ArrVal_3324 .cse3 (select v_ArrVal_3326 .cse3)))) (forall ((|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int) (v_ArrVal_3325 (Array Int Int))) (let ((.cse7 (store .cse10 .cse11 v_ArrVal_3323))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse4 (store .cse9 .cse8 v_ArrVal_3326))) (or (forall ((v_ArrVal_3328 (Array Int Int))) (let ((.cse5 (select (select (store .cse7 .cse8 v_ArrVal_3325) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (< 0 (+ (select (select (store .cse4 .cse5 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |v_ULTIMATE.start_main_~j~0#1_40| 4)) (not (= (let ((.cse6 (+ |v_ULTIMATE.start_main_~j~0#1_40| 2 |v_ULTIMATE.start_main_#t~mem176#1.offset_21|))) (store (select .cse4 .cse5) .cse6 (select v_ArrVal_3328 .cse6))) v_ArrVal_3328))))) (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))))))))))))) (forall ((v_ArrVal_3321 (Array Int Int)) (v_ArrVal_3322 (Array Int Int)) (|v_ULTIMATE.start_main_~j~0#1_40| Int)) (let ((.cse13 (store |c_#memory_$Pointer$.offset| .cse12 v_ArrVal_3322))) (or (< .cse0 |v_ULTIMATE.start_main_~j~0#1_40|) (< (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) 0) (forall ((v_ArrVal_3324 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$.base| .cse12 v_ArrVal_3321))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse21 (store .cse13 .cse23 v_ArrVal_3324))) (let ((.cse14 (+ (select (select .cse21 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |v_ULTIMATE.start_main_~j~0#1_40| 1))) (or (< .cse14 0) (forall ((v_ArrVal_3323 (Array Int Int)) (v_ArrVal_3326 (Array Int Int))) (let ((.cse19 (store .cse22 .cse23 v_ArrVal_3323))) (let ((.cse20 (select (select .cse19 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (forall ((|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int) (v_ArrVal_3325 (Array Int Int))) (let ((.cse15 (store .cse21 .cse20 v_ArrVal_3326))) (or (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (forall ((v_ArrVal_3328 (Array Int Int))) (let ((.cse17 (store .cse19 .cse20 v_ArrVal_3325))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (forall ((v_ArrVal_3327 (Array Int Int))) (<= (+ (select (select (store .cse15 .cse16 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |v_ULTIMATE.start_main_~j~0#1_40| 4) (select |c_#length| (select (select (store .cse17 .cse16 v_ArrVal_3327) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (not (= (let ((.cse18 (+ |v_ULTIMATE.start_main_~j~0#1_40| 2 |v_ULTIMATE.start_main_#t~mem176#1.offset_21|))) (store (select .cse15 .cse16) .cse18 (select v_ArrVal_3328 .cse18))) v_ArrVal_3328))))))))) (not (= (store (select .cse21 .cse20) .cse14 (select v_ArrVal_3326 .cse14)) v_ArrVal_3326)))))))))))))))))) is different from false [2024-11-28 03:31:17,658 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~j~0#1| 2)) (.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (and (forall ((v_ArrVal_3321 (Array Int Int)) (v_ArrVal_3322 (Array Int Int)) (v_ArrVal_3323 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int) (v_ArrVal_3324 (Array Int Int)) (v_ArrVal_3325 (Array Int Int)) (v_ArrVal_3326 (Array Int Int)) (v_ArrVal_3327 (Array Int Int)) (v_ArrVal_3328 (Array Int Int)) (|v_ULTIMATE.start_main_~j~0#1_40| Int)) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse12 v_ArrVal_3321))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse11 (store .cse13 .cse10 v_ArrVal_3323))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse12 v_ArrVal_3322)) (.cse1 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store .cse11 .cse1 v_ArrVal_3325)) (.cse0 (store .cse3 .cse10 v_ArrVal_3324))) (let ((.cse2 (+ (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |v_ULTIMATE.start_main_~j~0#1_40| 1)) (.cse5 (store .cse0 .cse1 v_ArrVal_3326)) (.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (not (= (store (select .cse0 .cse1) .cse2 (select v_ArrVal_3326 .cse2)) v_ArrVal_3326)) (< (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) 0) (< (+ (select (select (store .cse5 .cse6 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |v_ULTIMATE.start_main_~j~0#1_40| 3) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_3327) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (< .cse2 0) (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (< .cse8 |v_ULTIMATE.start_main_~j~0#1_40|) (not (= (let ((.cse9 (+ |v_ULTIMATE.start_main_~j~0#1_40| 2 |v_ULTIMATE.start_main_#t~mem176#1.offset_21|))) (store (select .cse5 .cse6) .cse9 (select v_ArrVal_3328 .cse9))) v_ArrVal_3328)))))))))) (forall ((v_ArrVal_3321 (Array Int Int)) (v_ArrVal_3322 (Array Int Int)) (v_ArrVal_3323 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int) (v_ArrVal_3324 (Array Int Int)) (v_ArrVal_3325 (Array Int Int)) (v_ArrVal_3326 (Array Int Int)) (v_ArrVal_3328 (Array Int Int)) (|v_ULTIMATE.start_main_~j~0#1_40| Int)) (let ((.cse23 (store |c_#memory_$Pointer$.base| .cse12 v_ArrVal_3321))) (let ((.cse22 (select (select .cse23 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| .cse12 v_ArrVal_3322)) (.cse19 (store .cse23 .cse22 v_ArrVal_3323))) (let ((.cse20 (select (select .cse19 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (.cse21 (store .cse17 .cse22 v_ArrVal_3324))) (let ((.cse16 (+ (select (select .cse21 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |v_ULTIMATE.start_main_~j~0#1_40| 1)) (.cse14 (store .cse21 .cse20 v_ArrVal_3326)) (.cse15 (select (select (store .cse19 .cse20 v_ArrVal_3325) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (< 0 (+ (select (select (store .cse14 .cse15 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |v_ULTIMATE.start_main_~j~0#1_40| 4)) (not (= v_ArrVal_3326 (store v_ArrVal_3324 .cse16 (select v_ArrVal_3326 .cse16)))) (< (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) 0) (< .cse16 0) (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (< .cse8 |v_ULTIMATE.start_main_~j~0#1_40|) (not (= (let ((.cse18 (+ |v_ULTIMATE.start_main_~j~0#1_40| 2 |v_ULTIMATE.start_main_#t~mem176#1.offset_21|))) (store (select .cse14 .cse15) .cse18 (select v_ArrVal_3328 .cse18))) v_ArrVal_3328)))))))))))) is different from false [2024-11-28 03:31:17,911 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~j~0#1| 2)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_3320 (Array Int Int)) (v_ArrVal_3321 (Array Int Int)) (v_ArrVal_3322 (Array Int Int)) (v_ArrVal_3323 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int) (v_ArrVal_3324 (Array Int Int)) (v_ArrVal_3325 (Array Int Int)) (v_ArrVal_3326 (Array Int Int)) (v_ArrVal_3328 (Array Int Int)) (v_ArrVal_3319 (Array Int Int)) (|v_ULTIMATE.start_main_~j~0#1_40| Int)) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_3319))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse11 (store .cse13 .cse12 v_ArrVal_3321))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_3320) .cse12 v_ArrVal_3322)) (.cse9 (store .cse11 .cse10 v_ArrVal_3323))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (.cse7 (store .cse1 .cse10 v_ArrVal_3324))) (let ((.cse0 (+ (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |v_ULTIMATE.start_main_~j~0#1_40| 1)) (.cse4 (select (select (store .cse9 .cse8 v_ArrVal_3325) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (.cse3 (store .cse7 .cse8 v_ArrVal_3326))) (or (< .cse0 0) (< (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) 0) (not (= v_ArrVal_3326 (store v_ArrVal_3324 .cse0 (select v_ArrVal_3326 .cse0)))) (< 0 (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select (store .cse3 .cse4 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 4)) (not (= (let ((.cse5 (+ |v_ULTIMATE.start_main_~j~0#1_40| 2 |v_ULTIMATE.start_main_#t~mem176#1.offset_21|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_3328 .cse5))) v_ArrVal_3328)) (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (< .cse6 |v_ULTIMATE.start_main_~j~0#1_40|)))))))))) (forall ((v_ArrVal_3320 (Array Int Int)) (v_ArrVal_3321 (Array Int Int)) (v_ArrVal_3322 (Array Int Int)) (v_ArrVal_3323 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int) (v_ArrVal_3324 (Array Int Int)) (v_ArrVal_3325 (Array Int Int)) (v_ArrVal_3326 (Array Int Int)) (v_ArrVal_3327 (Array Int Int)) (v_ArrVal_3328 (Array Int Int)) (v_ArrVal_3319 (Array Int Int)) (|v_ULTIMATE.start_main_~j~0#1_40| Int)) (let ((.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_3319))) (let ((.cse24 (select (select .cse26 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse25 (store .cse26 .cse24 v_ArrVal_3321))) (let ((.cse22 (select (select .cse25 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse23 (store .cse25 .cse22 v_ArrVal_3323))) (let ((.cse15 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_3320) .cse24 v_ArrVal_3322)) (.cse17 (select (select .cse23 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse21 (store .cse23 .cse17 v_ArrVal_3325)) (.cse16 (store .cse15 .cse22 v_ArrVal_3324))) (let ((.cse14 (+ (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |v_ULTIMATE.start_main_~j~0#1_40| 1)) (.cse18 (store .cse16 .cse17 v_ArrVal_3326)) (.cse19 (select (select .cse21 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (< .cse14 0) (< (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) 0) (not (= (store (select .cse16 .cse17) .cse14 (select v_ArrVal_3326 .cse14)) v_ArrVal_3326)) (not (= (let ((.cse20 (+ |v_ULTIMATE.start_main_~j~0#1_40| 2 |v_ULTIMATE.start_main_#t~mem176#1.offset_21|))) (store (select .cse18 .cse19) .cse20 (select v_ArrVal_3328 .cse20))) v_ArrVal_3328)) (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (< .cse6 |v_ULTIMATE.start_main_~j~0#1_40|) (< (+ |v_ULTIMATE.start_main_~j~0#1_40| 3 (select (select (store .cse18 .cse19 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse21 .cse19 v_ArrVal_3327) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))))))))))))) is different from false [2024-11-28 03:31:18,362 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~j~0#1| 2)) (.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_3320 (Array Int Int)) (v_ArrVal_3321 (Array Int Int)) (v_ArrVal_3322 (Array Int Int)) (v_ArrVal_3323 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int) (v_ArrVal_3324 (Array Int Int)) (v_ArrVal_3325 (Array Int Int)) (v_ArrVal_3326 (Array Int Int)) (v_ArrVal_3328 (Array Int Int)) (v_ArrVal_3319 (Array Int Int)) (|v_ULTIMATE.start_main_~j~0#1_40| Int)) (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse12 v_ArrVal_3319))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse11 (store .cse14 .cse13 v_ArrVal_3321))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse12 v_ArrVal_3320) .cse13 v_ArrVal_3322)) (.cse7 (store .cse11 .cse10 v_ArrVal_3323))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (.cse9 (store .cse6 .cse10 v_ArrVal_3324))) (let ((.cse0 (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1)) (.cse1 (store .cse9 .cse8 v_ArrVal_3326)) (.cse3 (select (select (store .cse7 .cse8 v_ArrVal_3325) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (not (= (store v_ArrVal_3324 .cse0 (select v_ArrVal_3326 .cse0)) v_ArrVal_3326)) (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (< .cse0 0) (< 0 (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select (store .cse1 .cse3 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 4)) (not (= v_ArrVal_3328 (let ((.cse4 (+ |v_ULTIMATE.start_main_~j~0#1_40| 2 |v_ULTIMATE.start_main_#t~mem176#1.offset_21|))) (store (select .cse1 .cse3) .cse4 (select v_ArrVal_3328 .cse4))))) (< .cse5 |v_ULTIMATE.start_main_~j~0#1_40|) (< (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) 0)))))))))) (forall ((v_ArrVal_3320 (Array Int Int)) (v_ArrVal_3321 (Array Int Int)) (v_ArrVal_3322 (Array Int Int)) (v_ArrVal_3323 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int) (v_ArrVal_3324 (Array Int Int)) (v_ArrVal_3325 (Array Int Int)) (v_ArrVal_3326 (Array Int Int)) (v_ArrVal_3327 (Array Int Int)) (v_ArrVal_3328 (Array Int Int)) (v_ArrVal_3319 (Array Int Int)) (|v_ULTIMATE.start_main_~j~0#1_40| Int)) (let ((.cse27 (store |c_#memory_$Pointer$.base| .cse12 v_ArrVal_3319))) (let ((.cse25 (select (select .cse27 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse26 (store .cse27 .cse25 v_ArrVal_3321))) (let ((.cse23 (select (select .cse26 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse24 (store .cse26 .cse23 v_ArrVal_3323))) (let ((.cse22 (store (store |c_#memory_$Pointer$.offset| .cse12 v_ArrVal_3320) .cse25 v_ArrVal_3322)) (.cse20 (select (select .cse24 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse17 (store .cse24 .cse20 v_ArrVal_3325)) (.cse19 (store .cse22 .cse23 v_ArrVal_3324))) (let ((.cse18 (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select .cse19 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1)) (.cse15 (store .cse19 .cse20 v_ArrVal_3326)) (.cse16 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (< (+ |v_ULTIMATE.start_main_~j~0#1_40| 3 (select (select (store .cse15 .cse16 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse17 .cse16 v_ArrVal_3327) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (< .cse18 0) (not (= (store (select .cse19 .cse20) .cse18 (select v_ArrVal_3326 .cse18)) v_ArrVal_3326)) (not (= v_ArrVal_3328 (let ((.cse21 (+ |v_ULTIMATE.start_main_~j~0#1_40| 2 |v_ULTIMATE.start_main_#t~mem176#1.offset_21|))) (store (select .cse15 .cse16) .cse21 (select v_ArrVal_3328 .cse21))))) (< .cse5 |v_ULTIMATE.start_main_~j~0#1_40|) (< (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select .cse22 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) 0)))))))))))))) is different from false [2024-11-28 03:31:18,780 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~j~0#1| 3)) (.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_3320 (Array Int Int)) (v_ArrVal_3321 (Array Int Int)) (v_ArrVal_3322 (Array Int Int)) (v_ArrVal_3323 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int) (v_ArrVal_3324 (Array Int Int)) (v_ArrVal_3325 (Array Int Int)) (v_ArrVal_3326 (Array Int Int)) (v_ArrVal_3327 (Array Int Int)) (v_ArrVal_3328 (Array Int Int)) (v_ArrVal_3319 (Array Int Int)) (|v_ULTIMATE.start_main_~j~0#1_40| Int)) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse12 v_ArrVal_3319))) (let ((.cse13 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse14 (store .cse15 .cse13 v_ArrVal_3321))) (let ((.cse10 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse11 (store .cse14 .cse10 v_ArrVal_3323))) (let ((.cse9 (store (store |c_#memory_$Pointer$.offset| .cse12 v_ArrVal_3320) .cse13 v_ArrVal_3322)) (.cse7 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse11 .cse7 v_ArrVal_3325)) (.cse6 (store .cse9 .cse10 v_ArrVal_3324))) (let ((.cse5 (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 1)) (.cse1 (store .cse6 .cse7 v_ArrVal_3326)) (.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (or (< .cse0 |v_ULTIMATE.start_main_~j~0#1_40|) (< (+ |v_ULTIMATE.start_main_~j~0#1_40| 3 (select (select (store .cse1 .cse2 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_3327) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (< .cse5 0) (not (= (store (select .cse6 .cse7) .cse5 (select v_ArrVal_3326 .cse5)) v_ArrVal_3326)) (not (= v_ArrVal_3328 (let ((.cse8 (+ |v_ULTIMATE.start_main_~j~0#1_40| 2 |v_ULTIMATE.start_main_#t~mem176#1.offset_21|))) (store (select .cse1 .cse2) .cse8 (select v_ArrVal_3328 .cse8))))) (< (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) 0))))))))))) (forall ((v_ArrVal_3320 (Array Int Int)) (v_ArrVal_3321 (Array Int Int)) (v_ArrVal_3322 (Array Int Int)) (v_ArrVal_3323 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int) (v_ArrVal_3324 (Array Int Int)) (v_ArrVal_3325 (Array Int Int)) (v_ArrVal_3326 (Array Int Int)) (v_ArrVal_3328 (Array Int Int)) (v_ArrVal_3319 (Array Int Int)) (|v_ULTIMATE.start_main_~j~0#1_40| Int)) (let ((.cse27 (store |c_#memory_$Pointer$.base| .cse12 v_ArrVal_3319))) (let ((.cse26 (select (select .cse27 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse25 (store .cse27 .cse26 v_ArrVal_3321))) (let ((.cse24 (select (select .cse25 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse20 (store (store |c_#memory_$Pointer$.offset| .cse12 v_ArrVal_3320) .cse26 v_ArrVal_3322)) (.cse21 (store .cse25 .cse24 v_ArrVal_3323))) (let ((.cse22 (select (select .cse21 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (.cse23 (store .cse20 .cse24 v_ArrVal_3324))) (let ((.cse16 (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select .cse23 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 1)) (.cse17 (store .cse23 .cse22 v_ArrVal_3326)) (.cse18 (select (select (store .cse21 .cse22 v_ArrVal_3325) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (or (< .cse0 |v_ULTIMATE.start_main_~j~0#1_40|) (not (= (store v_ArrVal_3324 .cse16 (select v_ArrVal_3326 .cse16)) v_ArrVal_3326)) (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (< .cse16 0) (< 0 (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select (store .cse17 .cse18 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 4)) (not (= v_ArrVal_3328 (let ((.cse19 (+ |v_ULTIMATE.start_main_~j~0#1_40| 2 |v_ULTIMATE.start_main_#t~mem176#1.offset_21|))) (store (select .cse17 .cse18) .cse19 (select v_ArrVal_3328 .cse19))))) (< (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select .cse20 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) 0))))))))))))) is different from false [2024-11-28 03:31:19,175 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~j~0#1| 3)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~j~0#1_40| Int) (v_ArrVal_3320 (Array Int Int)) (v_ArrVal_3321 (Array Int Int)) (v_ArrVal_3322 (Array Int Int)) (v_ArrVal_3323 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int) (v_ArrVal_3324 (Array Int Int)) (v_ArrVal_3325 (Array Int Int)) (v_ArrVal_3326 (Array Int Int)) (v_ArrVal_3317 (Array Int Int)) (v_ArrVal_3328 (Array Int Int)) (v_ArrVal_3318 (Array Int Int)) (v_ArrVal_3319 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_3317))) (let ((.cse11 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse14 (store .cse15 .cse11 v_ArrVal_3319))) (let ((.cse12 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse13 (store .cse14 .cse12 v_ArrVal_3321))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse8 (store .cse13 .cse10 v_ArrVal_3323)) (.cse3 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_3318) .cse11 v_ArrVal_3320) .cse12 v_ArrVal_3322))) (let ((.cse7 (store .cse3 .cse10 v_ArrVal_3324)) (.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse0 (store .cse7 .cse9 v_ArrVal_3326)) (.cse1 (select (select (store .cse8 .cse9 v_ArrVal_3325) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (.cse6 (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1))) (or (< 0 (+ (select (select (store .cse0 .cse1 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |v_ULTIMATE.start_main_~j~0#1_40| 4)) (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (< (+ (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |v_ULTIMATE.start_main_~j~0#1_40|) 0) (not (= v_ArrVal_3328 (let ((.cse4 (+ |v_ULTIMATE.start_main_~j~0#1_40| 2 |v_ULTIMATE.start_main_#t~mem176#1.offset_21|))) (store (select .cse0 .cse1) .cse4 (select v_ArrVal_3328 .cse4))))) (< .cse5 |v_ULTIMATE.start_main_~j~0#1_40|) (< .cse6 0) (not (= v_ArrVal_3326 (store v_ArrVal_3324 .cse6 (select v_ArrVal_3326 .cse6))))))))))))))) (forall ((|v_ULTIMATE.start_main_~j~0#1_40| Int) (v_ArrVal_3320 (Array Int Int)) (v_ArrVal_3321 (Array Int Int)) (v_ArrVal_3322 (Array Int Int)) (v_ArrVal_3323 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int) (v_ArrVal_3324 (Array Int Int)) (v_ArrVal_3325 (Array Int Int)) (v_ArrVal_3326 (Array Int Int)) (v_ArrVal_3327 (Array Int Int)) (v_ArrVal_3317 (Array Int Int)) (v_ArrVal_3328 (Array Int Int)) (v_ArrVal_3318 (Array Int Int)) (v_ArrVal_3319 (Array Int Int))) (let ((.cse30 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_3317))) (let ((.cse26 (select (select .cse30 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse29 (store .cse30 .cse26 v_ArrVal_3319))) (let ((.cse27 (select (select .cse29 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse28 (store .cse29 .cse27 v_ArrVal_3321))) (let ((.cse24 (select (select .cse28 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse25 (store .cse28 .cse24 v_ArrVal_3323))) (let ((.cse20 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_3318) .cse26 v_ArrVal_3320) .cse27 v_ArrVal_3322)) (.cse18 (select (select .cse25 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse23 (store .cse25 .cse18 v_ArrVal_3325)) (.cse17 (store .cse20 .cse24 v_ArrVal_3324))) (let ((.cse19 (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1)) (.cse16 (store .cse17 .cse18 v_ArrVal_3326)) (.cse21 (select (select .cse23 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (not (= (store (select .cse17 .cse18) .cse19 (select v_ArrVal_3326 .cse19)) v_ArrVal_3326)) (< (+ (select (select .cse20 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |v_ULTIMATE.start_main_~j~0#1_40|) 0) (not (= v_ArrVal_3328 (let ((.cse22 (+ |v_ULTIMATE.start_main_~j~0#1_40| 2 |v_ULTIMATE.start_main_#t~mem176#1.offset_21|))) (store (select .cse16 .cse21) .cse22 (select v_ArrVal_3328 .cse22))))) (< .cse5 |v_ULTIMATE.start_main_~j~0#1_40|) (< .cse19 0) (< (+ (select (select (store .cse16 .cse21 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |v_ULTIMATE.start_main_~j~0#1_40| 3) (select |c_#length| (select (select (store .cse23 .cse21 v_ArrVal_3327) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))))))))))))))) is different from false [2024-11-28 03:31:23,641 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse6 (+ |c_ULTIMATE.start_main_~j~0#1| 3)) (.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (and (forall ((|v_ULTIMATE.start_main_~j~0#1_40| Int) (v_ArrVal_3320 (Array Int Int)) (v_ArrVal_3321 (Array Int Int)) (v_ArrVal_3322 (Array Int Int)) (v_ArrVal_3323 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int) (v_ArrVal_3324 (Array Int Int)) (v_ArrVal_3325 (Array Int Int)) (v_ArrVal_3326 (Array Int Int)) (v_ArrVal_3327 (Array Int Int)) (v_ArrVal_3317 (Array Int Int)) (v_ArrVal_3328 (Array Int Int)) (v_ArrVal_3318 (Array Int Int)) (v_ArrVal_3319 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.base| .cse12 v_ArrVal_3317))) (let ((.cse13 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse16 (store .cse17 .cse13 v_ArrVal_3319))) (let ((.cse14 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse15 (store .cse16 .cse14 v_ArrVal_3321))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse11 (store .cse15 .cse10 v_ArrVal_3323))) (let ((.cse9 (store (store (store |c_#memory_$Pointer$.offset| .cse12 v_ArrVal_3318) .cse13 v_ArrVal_3320) .cse14 v_ArrVal_3322)) (.cse4 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse8 (store .cse11 .cse4 v_ArrVal_3325)) (.cse3 (store .cse9 .cse10 v_ArrVal_3324))) (let ((.cse5 (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) 1)) (.cse1 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse0 (store .cse3 .cse4 v_ArrVal_3326))) (or (not (= v_ArrVal_3328 (let ((.cse2 (+ |v_ULTIMATE.start_main_~j~0#1_40| 2 |v_ULTIMATE.start_main_#t~mem176#1.offset_21|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_3328 .cse2))))) (not (= (store (select .cse3 .cse4) .cse5 (select v_ArrVal_3326 .cse5)) v_ArrVal_3326)) (< .cse6 |v_ULTIMATE.start_main_~j~0#1_40|) (< .cse5 0) (< (+ (select (select (store .cse0 .cse1 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) |v_ULTIMATE.start_main_~j~0#1_40| 3) (select |c_#length| (select (select (store .cse8 .cse1 v_ArrVal_3327) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (< (+ (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) |v_ULTIMATE.start_main_~j~0#1_40|) 0) (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))))))))))) (forall ((|v_ULTIMATE.start_main_~j~0#1_40| Int) (v_ArrVal_3320 (Array Int Int)) (v_ArrVal_3321 (Array Int Int)) (v_ArrVal_3322 (Array Int Int)) (v_ArrVal_3323 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int) (v_ArrVal_3324 (Array Int Int)) (v_ArrVal_3325 (Array Int Int)) (v_ArrVal_3326 (Array Int Int)) (v_ArrVal_3317 (Array Int Int)) (v_ArrVal_3328 (Array Int Int)) (v_ArrVal_3318 (Array Int Int)) (v_ArrVal_3319 (Array Int Int))) (let ((.cse31 (store |c_#memory_$Pointer$.base| .cse12 v_ArrVal_3317))) (let ((.cse28 (select (select .cse31 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse30 (store .cse31 .cse28 v_ArrVal_3319))) (let ((.cse29 (select (select .cse30 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse27 (store .cse30 .cse29 v_ArrVal_3321))) (let ((.cse26 (select (select .cse27 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse22 (store (store (store |c_#memory_$Pointer$.offset| .cse12 v_ArrVal_3318) .cse28 v_ArrVal_3320) .cse29 v_ArrVal_3322)) (.cse25 (store .cse27 .cse26 v_ArrVal_3323))) (let ((.cse24 (select (select .cse25 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse23 (store .cse22 .cse26 v_ArrVal_3324))) (let ((.cse21 (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select .cse23 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) 1)) (.cse19 (select (select (store .cse25 .cse24 v_ArrVal_3325) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse18 (store .cse23 .cse24 v_ArrVal_3326))) (or (not (= v_ArrVal_3328 (let ((.cse20 (+ |v_ULTIMATE.start_main_~j~0#1_40| 2 |v_ULTIMATE.start_main_#t~mem176#1.offset_21|))) (store (select .cse18 .cse19) .cse20 (select v_ArrVal_3328 .cse20))))) (< .cse6 |v_ULTIMATE.start_main_~j~0#1_40|) (< .cse21 0) (not (= v_ArrVal_3326 (store v_ArrVal_3324 .cse21 (select v_ArrVal_3326 .cse21)))) (< 0 (+ (select (select (store .cse18 .cse19 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) |v_ULTIMATE.start_main_~j~0#1_40| 4)) (< (+ (select (select .cse22 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) |v_ULTIMATE.start_main_~j~0#1_40|) 0) (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))))))))))))) is different from false [2024-11-28 03:31:24,244 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (and (forall ((|v_ULTIMATE.start_main_~j~0#1_40| Int) (v_ArrVal_3320 (Array Int Int)) (v_ArrVal_3321 (Array Int Int)) (v_ArrVal_3322 (Array Int Int)) (v_ArrVal_3323 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int) (v_ArrVal_3324 (Array Int Int)) (v_ArrVal_3325 (Array Int Int)) (v_ArrVal_3326 (Array Int Int)) (v_ArrVal_3317 (Array Int Int)) (v_ArrVal_3328 (Array Int Int)) (v_ArrVal_3318 (Array Int Int)) (v_ArrVal_3319 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_3317))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_3319))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse10 (store .cse14 .cse13 v_ArrVal_3321))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store (store (store |c_#memory_$Pointer$.offset| .cse11 v_ArrVal_3318) .cse12 v_ArrVal_3320) .cse13 v_ArrVal_3322)) (.cse8 (store .cse10 .cse9 v_ArrVal_3323))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (.cse6 (store .cse5 .cse9 v_ArrVal_3324))) (let ((.cse3 (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 1)) (.cse1 (select (select (store .cse8 .cse7 v_ArrVal_3325) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (.cse0 (store .cse6 .cse7 v_ArrVal_3326))) (or (not (= v_ArrVal_3328 (let ((.cse2 (+ |v_ULTIMATE.start_main_~j~0#1_40| 2 |v_ULTIMATE.start_main_#t~mem176#1.offset_21|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_3328 .cse2))))) (< 3 |v_ULTIMATE.start_main_~j~0#1_40|) (< .cse3 0) (not (= v_ArrVal_3326 (store v_ArrVal_3324 .cse3 (select v_ArrVal_3326 .cse3)))) (< 0 (+ (select (select (store .cse0 .cse1 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |v_ULTIMATE.start_main_~j~0#1_40| 4)) (< (+ (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |v_ULTIMATE.start_main_~j~0#1_40|) 0) (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))))))))) (forall ((|v_ULTIMATE.start_main_~j~0#1_40| Int) (v_ArrVal_3320 (Array Int Int)) (v_ArrVal_3321 (Array Int Int)) (v_ArrVal_3322 (Array Int Int)) (v_ArrVal_3323 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int) (v_ArrVal_3324 (Array Int Int)) (v_ArrVal_3325 (Array Int Int)) (v_ArrVal_3326 (Array Int Int)) (v_ArrVal_3327 (Array Int Int)) (v_ArrVal_3317 (Array Int Int)) (v_ArrVal_3328 (Array Int Int)) (v_ArrVal_3318 (Array Int Int)) (v_ArrVal_3319 (Array Int Int))) (let ((.cse30 (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_3317))) (let ((.cse26 (select (select .cse30 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse29 (store .cse30 .cse26 v_ArrVal_3319))) (let ((.cse27 (select (select .cse29 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse28 (store .cse29 .cse27 v_ArrVal_3321))) (let ((.cse24 (select (select .cse28 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse25 (store .cse28 .cse24 v_ArrVal_3323))) (let ((.cse23 (store (store (store |c_#memory_$Pointer$.offset| .cse11 v_ArrVal_3318) .cse26 v_ArrVal_3320) .cse27 v_ArrVal_3322)) (.cse20 (select (select .cse25 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse22 (store .cse25 .cse20 v_ArrVal_3325)) (.cse19 (store .cse23 .cse24 v_ArrVal_3324))) (let ((.cse21 (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select .cse19 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 1)) (.cse17 (select (select .cse22 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (.cse16 (store .cse19 .cse20 v_ArrVal_3326))) (or (not (= v_ArrVal_3328 (let ((.cse18 (+ |v_ULTIMATE.start_main_~j~0#1_40| 2 |v_ULTIMATE.start_main_#t~mem176#1.offset_21|))) (store (select .cse16 .cse17) .cse18 (select v_ArrVal_3328 .cse18))))) (not (= (store (select .cse19 .cse20) .cse21 (select v_ArrVal_3326 .cse21)) v_ArrVal_3326)) (< 3 |v_ULTIMATE.start_main_~j~0#1_40|) (< .cse21 0) (< (+ (select (select (store .cse16 .cse17 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |v_ULTIMATE.start_main_~j~0#1_40| 3) (select |c_#length| (select (select (store .cse22 .cse17 v_ArrVal_3327) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (< (+ (select (select .cse23 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |v_ULTIMATE.start_main_~j~0#1_40|) 0) (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))))))))))))) is different from false [2024-11-28 03:31:26,074 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~j~0#1_40| Int) (v_ArrVal_3320 (Array Int Int)) (v_ArrVal_3321 (Array Int Int)) (v_ArrVal_3322 (Array Int Int)) (v_ArrVal_3323 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int) (v_ArrVal_3324 (Array Int Int)) (v_ArrVal_3325 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3326 (Array Int Int)) (v_ArrVal_3316 (Array Int Int)) (v_ArrVal_3327 (Array Int Int)) (v_ArrVal_3317 (Array Int Int)) (v_ArrVal_3328 (Array Int Int)) (v_ArrVal_3318 (Array Int Int)) (v_ArrVal_3319 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem175#1.base| v_ArrVal_3315))) (let ((.cse11 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse16 (store .cse17 .cse11 v_ArrVal_3317))) (let ((.cse12 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse15 (store .cse16 .cse12 v_ArrVal_3319))) (let ((.cse13 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse13 v_ArrVal_3321))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse10 (store .cse14 .cse9 v_ArrVal_3323))) (let ((.cse3 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem175#1.base| v_ArrVal_3316) .cse11 v_ArrVal_3318) .cse12 v_ArrVal_3320) .cse13 v_ArrVal_3322)) (.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse5 (store .cse10 .cse7 v_ArrVal_3325)) (.cse6 (store .cse3 .cse9 v_ArrVal_3324))) (let ((.cse2 (+ (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |v_ULTIMATE.start_main_~j~0#1_40| 1)) (.cse0 (store .cse6 .cse7 v_ArrVal_3326)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (< .cse2 0) (< (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) 0) (< 3 |v_ULTIMATE.start_main_~j~0#1_40|) (< (+ |v_ULTIMATE.start_main_~j~0#1_40| 3 (select (select (store .cse0 .cse4 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_3327) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (not (= v_ArrVal_3326 (store (select .cse6 .cse7) .cse2 (select v_ArrVal_3326 .cse2)))) (not (= (let ((.cse8 (+ |v_ULTIMATE.start_main_~j~0#1_40| 2 |v_ULTIMATE.start_main_#t~mem176#1.offset_21|))) (store (select .cse0 .cse4) .cse8 (select v_ArrVal_3328 .cse8))) v_ArrVal_3328)))))))))))))))) (forall ((|v_ULTIMATE.start_main_~j~0#1_40| Int) (v_ArrVal_3320 (Array Int Int)) (v_ArrVal_3321 (Array Int Int)) (v_ArrVal_3322 (Array Int Int)) (v_ArrVal_3323 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int) (v_ArrVal_3324 (Array Int Int)) (v_ArrVal_3325 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3326 (Array Int Int)) (v_ArrVal_3316 (Array Int Int)) (v_ArrVal_3317 (Array Int Int)) (v_ArrVal_3328 (Array Int Int)) (v_ArrVal_3318 (Array Int Int)) (v_ArrVal_3319 (Array Int Int))) (let ((.cse33 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem175#1.base| v_ArrVal_3315))) (let ((.cse28 (select (select .cse33 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse32 (store .cse33 .cse28 v_ArrVal_3317))) (let ((.cse29 (select (select .cse32 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse31 (store .cse32 .cse29 v_ArrVal_3319))) (let ((.cse30 (select (select .cse31 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse27 (store .cse31 .cse30 v_ArrVal_3321))) (let ((.cse26 (select (select .cse27 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse20 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem175#1.base| v_ArrVal_3316) .cse28 v_ArrVal_3318) .cse29 v_ArrVal_3320) .cse30 v_ArrVal_3322)) (.cse23 (store .cse27 .cse26 v_ArrVal_3323))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (.cse25 (store .cse20 .cse26 v_ArrVal_3324))) (let ((.cse19 (+ (select (select .cse25 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |v_ULTIMATE.start_main_~j~0#1_40| 1)) (.cse18 (store .cse25 .cse24 v_ArrVal_3326)) (.cse21 (select (select (store .cse23 .cse24 v_ArrVal_3325) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (< .cse19 0) (< (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select .cse20 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) 0) (< 3 |v_ULTIMATE.start_main_~j~0#1_40|) (< 0 (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select (store .cse18 .cse21 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 4)) (not (= v_ArrVal_3326 (store v_ArrVal_3324 .cse19 (select v_ArrVal_3326 .cse19)))) (not (= (let ((.cse22 (+ |v_ULTIMATE.start_main_~j~0#1_40| 2 |v_ULTIMATE.start_main_#t~mem176#1.offset_21|))) (store (select .cse18 .cse21) .cse22 (select v_ArrVal_3328 .cse22))) v_ArrVal_3328))))))))))))))))) is different from false [2024-11-28 03:31:28,905 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((|v_ULTIMATE.start_main_~j~0#1_40| Int) (v_ArrVal_3320 (Array Int Int)) (v_ArrVal_3321 (Array Int Int)) (v_ArrVal_3322 (Array Int Int)) (v_ArrVal_3323 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int) (v_ArrVal_3324 (Array Int Int)) (v_ArrVal_3325 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3326 (Array Int Int)) (v_ArrVal_3316 (Array Int Int)) (v_ArrVal_3327 (Array Int Int)) (v_ArrVal_3317 (Array Int Int)) (v_ArrVal_3328 (Array Int Int)) (v_ArrVal_3318 (Array Int Int)) (v_ArrVal_3319 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_3315))) (let ((.cse12 (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse17 (store .cse18 .cse12 v_ArrVal_3317))) (let ((.cse13 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse16 (store .cse17 .cse13 v_ArrVal_3319))) (let ((.cse14 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse15 (store .cse16 .cse14 v_ArrVal_3321))) (let ((.cse9 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse10 (store .cse15 .cse9 v_ArrVal_3323))) (let ((.cse1 (store (store (store (store |c_#memory_$Pointer$.offset| .cse11 v_ArrVal_3316) .cse12 v_ArrVal_3318) .cse13 v_ArrVal_3320) .cse14 v_ArrVal_3322)) (.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse8 (store .cse10 .cse7 v_ArrVal_3325)) (.cse6 (store .cse1 .cse9 v_ArrVal_3324))) (let ((.cse0 (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1)) (.cse3 (store .cse6 .cse7 v_ArrVal_3326)) (.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (< .cse0 0) (< (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) 0) (< 3 |v_ULTIMATE.start_main_~j~0#1_40|) (not (= (let ((.cse5 (+ |v_ULTIMATE.start_main_~j~0#1_40| 2 |v_ULTIMATE.start_main_#t~mem176#1.offset_21|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_3328 .cse5))) v_ArrVal_3328)) (not (= (store (select .cse6 .cse7) .cse0 (select v_ArrVal_3326 .cse0)) v_ArrVal_3326)) (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (< (+ (select (select (store .cse3 .cse4 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |v_ULTIMATE.start_main_~j~0#1_40| 3) (select |c_#length| (select (select (store .cse8 .cse4 v_ArrVal_3327) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))))))))))))))) (forall ((|v_ULTIMATE.start_main_~j~0#1_40| Int) (v_ArrVal_3320 (Array Int Int)) (v_ArrVal_3321 (Array Int Int)) (v_ArrVal_3322 (Array Int Int)) (v_ArrVal_3323 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int) (v_ArrVal_3324 (Array Int Int)) (v_ArrVal_3325 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3326 (Array Int Int)) (v_ArrVal_3316 (Array Int Int)) (v_ArrVal_3317 (Array Int Int)) (v_ArrVal_3328 (Array Int Int)) (v_ArrVal_3318 (Array Int Int)) (v_ArrVal_3319 (Array Int Int))) (let ((.cse34 (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_3315))) (let ((.cse29 (select (select .cse34 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse33 (store .cse34 .cse29 v_ArrVal_3317))) (let ((.cse30 (select (select .cse33 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse32 (store .cse33 .cse30 v_ArrVal_3319))) (let ((.cse31 (select (select .cse32 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse28 (store .cse32 .cse31 v_ArrVal_3321))) (let ((.cse27 (select (select .cse28 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse20 (store (store (store (store |c_#memory_$Pointer$.offset| .cse11 v_ArrVal_3316) .cse29 v_ArrVal_3318) .cse30 v_ArrVal_3320) .cse31 v_ArrVal_3322)) (.cse26 (store .cse28 .cse27 v_ArrVal_3323))) (let ((.cse25 (select (select .cse26 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (.cse24 (store .cse20 .cse27 v_ArrVal_3324))) (let ((.cse19 (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select .cse24 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1)) (.cse22 (select (select (store .cse26 .cse25 v_ArrVal_3325) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (.cse21 (store .cse24 .cse25 v_ArrVal_3326))) (or (< .cse19 0) (< (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select .cse20 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) 0) (not (= (store v_ArrVal_3324 .cse19 (select v_ArrVal_3326 .cse19)) v_ArrVal_3326)) (< 3 |v_ULTIMATE.start_main_~j~0#1_40|) (< 0 (+ (select (select (store .cse21 .cse22 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |v_ULTIMATE.start_main_~j~0#1_40| 4)) (not (= (let ((.cse23 (+ |v_ULTIMATE.start_main_~j~0#1_40| 2 |v_ULTIMATE.start_main_#t~mem176#1.offset_21|))) (store (select .cse21 .cse22) .cse23 (select v_ArrVal_3328 .cse23))) v_ArrVal_3328)) (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| (select (select .cse21 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))))))))))))) is different from false [2024-11-28 03:31:51,454 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~j~0#1_40| Int) (v_ArrVal_3320 (Array Int Int)) (v_ArrVal_3321 (Array Int Int)) (v_ArrVal_3322 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3323 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int) (v_ArrVal_3324 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3325 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3326 (Array Int Int)) (v_ArrVal_3316 (Array Int Int)) (v_ArrVal_3317 (Array Int Int)) (v_ArrVal_3328 (Array Int Int)) (v_ArrVal_3318 (Array Int Int)) (v_ArrVal_3319 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_3312))) (let ((.cse10 (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse17 (store .cse18 .cse10 v_ArrVal_3315))) (let ((.cse11 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse16 (store .cse17 .cse11 v_ArrVal_3317))) (let ((.cse12 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse15 (store .cse16 .cse12 v_ArrVal_3319))) (let ((.cse13 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse14 (store .cse15 .cse13 v_ArrVal_3321))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse8 (store .cse14 .cse9 v_ArrVal_3323)) (.cse5 (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_3314) .cse10 v_ArrVal_3316) .cse11 v_ArrVal_3318) .cse12 v_ArrVal_3320) .cse13 v_ArrVal_3322))) (let ((.cse6 (store .cse5 .cse9 v_ArrVal_3324)) (.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse1 (select (select (store .cse8 .cse7 v_ArrVal_3325) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (.cse0 (store .cse6 .cse7 v_ArrVal_3326)) (.cse4 (+ (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |v_ULTIMATE.start_main_~j~0#1_40| 1))) (or (< 0 (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select (store .cse0 .cse1 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 4)) (not (= (let ((.cse3 (+ |v_ULTIMATE.start_main_~j~0#1_40| 2 |v_ULTIMATE.start_main_#t~mem176#1.offset_21|))) (store (select .cse0 .cse1) .cse3 (select v_ArrVal_3328 .cse3))) v_ArrVal_3328)) (not (= (store v_ArrVal_3324 .cse4 (select v_ArrVal_3326 .cse4)) v_ArrVal_3326)) (< 3 |v_ULTIMATE.start_main_~j~0#1_40|) (< (+ (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |v_ULTIMATE.start_main_~j~0#1_40|) 0) (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (< .cse4 0)))))))))))))))) (forall ((|v_ULTIMATE.start_main_~j~0#1_40| Int) (v_ArrVal_3320 (Array Int Int)) (v_ArrVal_3321 (Array Int Int)) (v_ArrVal_3322 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3323 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem176#1.offset_21| Int) (v_ArrVal_3324 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3325 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3326 (Array Int Int)) (v_ArrVal_3316 (Array Int Int)) (v_ArrVal_3327 (Array Int Int)) (v_ArrVal_3317 (Array Int Int)) (v_ArrVal_3328 (Array Int Int)) (v_ArrVal_3318 (Array Int Int)) (v_ArrVal_3319 (Array Int Int))) (let ((.cse37 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_3312))) (let ((.cse29 (select (select .cse37 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse36 (store .cse37 .cse29 v_ArrVal_3315))) (let ((.cse30 (select (select .cse36 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse35 (store .cse36 .cse30 v_ArrVal_3317))) (let ((.cse31 (select (select .cse35 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse34 (store .cse35 .cse31 v_ArrVal_3319))) (let ((.cse32 (select (select .cse34 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse33 (store .cse34 .cse32 v_ArrVal_3321))) (let ((.cse27 (select (select .cse33 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse28 (store .cse33 .cse27 v_ArrVal_3323))) (let ((.cse22 (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_3314) .cse29 v_ArrVal_3316) .cse30 v_ArrVal_3318) .cse31 v_ArrVal_3320) .cse32 v_ArrVal_3322)) (.cse26 (select (select .cse28 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse23 (store .cse28 .cse26 v_ArrVal_3325)) (.cse25 (store .cse22 .cse27 v_ArrVal_3324))) (let ((.cse19 (store .cse25 .cse26 v_ArrVal_3326)) (.cse20 (select (select .cse23 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (.cse24 (+ (select (select .cse25 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |v_ULTIMATE.start_main_~j~0#1_40| 1))) (or (not (= (let ((.cse21 (+ |v_ULTIMATE.start_main_~j~0#1_40| 2 |v_ULTIMATE.start_main_#t~mem176#1.offset_21|))) (store (select .cse19 .cse20) .cse21 (select v_ArrVal_3328 .cse21))) v_ArrVal_3328)) (< 3 |v_ULTIMATE.start_main_~j~0#1_40|) (< (+ (select (select .cse22 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |v_ULTIMATE.start_main_~j~0#1_40|) 0) (< |v_ULTIMATE.start_main_#t~mem176#1.offset_21| (select (select .cse19 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (< (+ |v_ULTIMATE.start_main_~j~0#1_40| (select (select (store .cse19 .cse20 v_ArrVal_3328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 3) (select |c_#length| (select (select (store .cse23 .cse20 v_ArrVal_3327) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (< .cse24 0) (not (= v_ArrVal_3326 (store (select .cse25 .cse26) .cse24 (select v_ArrVal_3326 .cse24)))))))))))))))))))))) is different from false [2024-11-28 03:31:52,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:31:52,028 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 11253 treesize of output 11181 [2024-11-28 03:31:52,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:31:52,050 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 11169 treesize of output 6081