./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd --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 32bit --witnessprinter.graph.data.programhash 8d4416b38cd75f122474354d64a020f92e3751959548582c6308a6e879679f77 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:30:15,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:30:15,525 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 13:30:15,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:30:15,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:30:15,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:30:15,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:30:15,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:30:15,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:30:15,567 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:30:15,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:30:15,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:30:15,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:30:15,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:30:15,569 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:30:15,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:30:15,569 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:30:15,569 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:30:15,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:30:15,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:30:15,570 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 13:30:15,570 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 13:30:15,570 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 13:30:15,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:30:15,571 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:30:15,571 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:30:15,571 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 13:30:15,571 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:30:15,571 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:30:15,572 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:30:15,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:30:15,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:30:15,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:30:15,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:30:15,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:30:15,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:30:15,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:30:15,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:30:15,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:30:15,574 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:30:15,574 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:30:15,574 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:30:15,574 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_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8d4416b38cd75f122474354d64a020f92e3751959548582c6308a6e879679f77 [2024-11-13 13:30:15,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:30:15,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:30:15,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:30:15,952 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:30:15,952 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:30:15,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-1.i Unable to find full path for "g++" [2024-11-13 13:30:18,006 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:30:18,513 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:30:18,513 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-1.i [2024-11-13 13:30:18,545 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/data/2893b7c27/25d99ca47c4a4bb39659d459ed366ae3/FLAGb8096f0f8 [2024-11-13 13:30:18,572 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/data/2893b7c27/25d99ca47c4a4bb39659d459ed366ae3 [2024-11-13 13:30:18,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:30:18,580 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:30:18,581 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:30:18,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:30:18,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:30:18,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:30:18" (1/1) ... [2024-11-13 13:30:18,594 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@238a1e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:18, skipping insertion in model container [2024-11-13 13:30:18,594 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:30:18" (1/1) ... [2024-11-13 13:30:18,661 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:30:19,136 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 13:30:19,172 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 13:30:19,176 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 13:30:19,180 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 13:30:19,187 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 13:30:19,229 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 13:30:19,231 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 13:30:19,238 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 13:30:19,251 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 13:30:19,267 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 13:30:19,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:30:19,289 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:30:19,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:30:19,543 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:30:19,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:19 WrapperNode [2024-11-13 13:30:19,543 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:30:19,544 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:30:19,545 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:30:19,545 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:30:19,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:19" (1/1) ... [2024-11-13 13:30:19,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:19" (1/1) ... [2024-11-13 13:30:19,668 INFO L138 Inliner]: procedures = 176, calls = 336, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1569 [2024-11-13 13:30:19,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:30:19,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:30:19,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:30:19,671 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:30:19,681 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:19" (1/1) ... [2024-11-13 13:30:19,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:19" (1/1) ... [2024-11-13 13:30:19,696 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:19" (1/1) ... [2024-11-13 13:30:19,826 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2024-11-13 13:30:19,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:19" (1/1) ... [2024-11-13 13:30:19,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:19" (1/1) ... [2024-11-13 13:30:19,884 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:19" (1/1) ... [2024-11-13 13:30:19,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:19" (1/1) ... [2024-11-13 13:30:19,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:19" (1/1) ... [2024-11-13 13:30:19,923 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:19" (1/1) ... [2024-11-13 13:30:19,934 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:30:19,935 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:30:19,935 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:30:19,935 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:30:19,936 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:19" (1/1) ... [2024-11-13 13:30:19,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:30:19,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:30:19,979 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:30:19,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:30:20,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 13:30:20,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 13:30:20,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-13 13:30:20,022 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-13 13:30:20,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 13:30:20,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 13:30:20,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-13 13:30:20,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-13 13:30:20,023 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-13 13:30:20,023 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-13 13:30:20,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 13:30:20,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:30:20,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 13:30:20,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 13:30:20,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 13:30:20,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 13:30:20,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 13:30:20,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:30:20,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 13:30:20,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:30:20,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:30:20,342 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:30:20,344 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:30:20,347 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-13 13:30:20,397 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-13 13:30:23,782 INFO L? ?]: Removed 1502 outVars from TransFormulas that were not future-live. [2024-11-13 13:30:23,782 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:30:23,824 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:30:23,825 INFO L316 CfgBuilder]: Removed 60 assume(true) statements. [2024-11-13 13:30:23,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:30:23 BoogieIcfgContainer [2024-11-13 13:30:23,825 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:30:23,827 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:30:23,827 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:30:23,832 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:30:23,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:30:18" (1/3) ... [2024-11-13 13:30:23,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa1972d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:30:23, skipping insertion in model container [2024-11-13 13:30:23,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:19" (2/3) ... [2024-11-13 13:30:23,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa1972d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:30:23, skipping insertion in model container [2024-11-13 13:30:23,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:30:23" (3/3) ... [2024-11-13 13:30:23,838 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test4-1.i [2024-11-13 13:30:23,859 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:30:23,861 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test4-1.i that has 4 procedures, 1457 locations, 1 initial locations, 36 loop locations, and 628 error locations. [2024-11-13 13:30:23,922 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:30:23,934 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;@37d4fad4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:30:23,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2024-11-13 13:30:23,941 INFO L276 IsEmpty]: Start isEmpty. Operand has 1452 states, 811 states have (on average 2.0752157829839706) internal successors, (1683), 1443 states have internal predecessors, (1683), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 13:30:23,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 13:30:23,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:30:23,947 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 13:30:23,948 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:30:23,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:30:23,952 INFO L85 PathProgramCache]: Analyzing trace with hash 45876316, now seen corresponding path program 1 times [2024-11-13 13:30:23,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:30:23,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124073365] [2024-11-13 13:30:23,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:23,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:30:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:24,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:30:24,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:30:24,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124073365] [2024-11-13 13:30:24,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124073365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:30:24,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:30:24,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:30:24,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837745041] [2024-11-13 13:30:24,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:30:24,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:30:24,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:30:24,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:30:24,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:30:24,277 INFO L87 Difference]: Start difference. First operand has 1452 states, 811 states have (on average 2.0752157829839706) internal successors, (1683), 1443 states have internal predecessors, (1683), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:30:25,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:30:25,615 INFO L93 Difference]: Finished difference Result 1341 states and 1536 transitions. [2024-11-13 13:30:25,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:30:25,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-13 13:30:25,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:30:25,635 INFO L225 Difference]: With dead ends: 1341 [2024-11-13 13:30:25,635 INFO L226 Difference]: Without dead ends: 1339 [2024-11-13 13:30:25,637 INFO L431 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-13 13:30:25,640 INFO L432 NwaCegarLoop]: 922 mSDtfsCounter, 1366 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:30:25,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1382 Valid, 935 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 13:30:25,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2024-11-13 13:30:25,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2024-11-13 13:30:25,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 801 states have (on average 1.8714107365792758) internal successors, (1499), 1328 states have internal predecessors, (1499), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 13:30:25,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1531 transitions. [2024-11-13 13:30:25,741 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1531 transitions. Word has length 5 [2024-11-13 13:30:25,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:30:25,742 INFO L471 AbstractCegarLoop]: Abstraction has 1337 states and 1531 transitions. [2024-11-13 13:30:25,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:30:25,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1531 transitions. [2024-11-13 13:30:25,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 13:30:25,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:30:25,743 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 13:30:25,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:30:25,743 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:30:25,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:30:25,744 INFO L85 PathProgramCache]: Analyzing trace with hash 45876317, now seen corresponding path program 1 times [2024-11-13 13:30:25,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:30:25,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785291175] [2024-11-13 13:30:25,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:25,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:30:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:25,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:30:25,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:30:25,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785291175] [2024-11-13 13:30:25,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785291175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:30:25,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:30:25,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:30:25,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020668827] [2024-11-13 13:30:25,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:30:25,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:30:25,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:30:25,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:30:25,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:30:25,901 INFO L87 Difference]: Start difference. First operand 1337 states and 1531 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:30:27,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:30:27,151 INFO L93 Difference]: Finished difference Result 1753 states and 2025 transitions. [2024-11-13 13:30:27,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:30:27,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-13 13:30:27,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:30:27,160 INFO L225 Difference]: With dead ends: 1753 [2024-11-13 13:30:27,160 INFO L226 Difference]: Without dead ends: 1753 [2024-11-13 13:30:27,160 INFO L431 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-13 13:30:27,161 INFO L432 NwaCegarLoop]: 1286 mSDtfsCounter, 820 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:30:27,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1947 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 13:30:27,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2024-11-13 13:30:27,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 1600. [2024-11-13 13:30:27,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1074 states have (on average 1.8370577281191807) internal successors, (1973), 1591 states have internal predecessors, (1973), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 13:30:27,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2005 transitions. [2024-11-13 13:30:27,240 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2005 transitions. Word has length 5 [2024-11-13 13:30:27,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:30:27,240 INFO L471 AbstractCegarLoop]: Abstraction has 1600 states and 2005 transitions. [2024-11-13 13:30:27,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:30:27,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2005 transitions. [2024-11-13 13:30:27,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 13:30:27,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:30:27,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 13:30:27,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:30:27,242 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:30:27,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:30:27,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1424530325, now seen corresponding path program 1 times [2024-11-13 13:30:27,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:30:27,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969247141] [2024-11-13 13:30:27,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:27,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:30:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:27,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:30:27,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:30:27,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969247141] [2024-11-13 13:30:27,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969247141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:30:27,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:30:27,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:30:27,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896962608] [2024-11-13 13:30:27,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:30:27,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:30:27,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:30:27,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:30:27,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:30:27,290 INFO L87 Difference]: Start difference. First operand 1600 states and 2005 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:30:27,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:30:27,400 INFO L93 Difference]: Finished difference Result 3150 states and 3940 transitions. [2024-11-13 13:30:27,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:30:27,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-13 13:30:27,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:30:27,416 INFO L225 Difference]: With dead ends: 3150 [2024-11-13 13:30:27,416 INFO L226 Difference]: Without dead ends: 3150 [2024-11-13 13:30:27,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:30:27,418 INFO L432 NwaCegarLoop]: 1802 mSDtfsCounter, 1438 mSDsluCounter, 1516 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 3318 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:30:27,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1444 Valid, 3318 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:30:27,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3150 states. [2024-11-13 13:30:27,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3150 to 1601. [2024-11-13 13:30:27,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1075 states have (on average 1.8362790697674418) internal successors, (1974), 1592 states have internal predecessors, (1974), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 13:30:27,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2006 transitions. [2024-11-13 13:30:27,490 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2006 transitions. Word has length 6 [2024-11-13 13:30:27,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:30:27,490 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2006 transitions. [2024-11-13 13:30:27,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:30:27,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2006 transitions. [2024-11-13 13:30:27,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 13:30:27,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:30:27,491 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:30:27,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:30:27,493 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:30:27,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:30:27,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1344610682, now seen corresponding path program 1 times [2024-11-13 13:30:27,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:30:27,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797768643] [2024-11-13 13:30:27,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:27,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:30:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:27,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:30:27,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:30:27,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797768643] [2024-11-13 13:30:27,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797768643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:30:27,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:30:27,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:30:27,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634695759] [2024-11-13 13:30:27,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:30:27,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:30:27,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:30:27,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:30:27,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:30:27,667 INFO L87 Difference]: Start difference. First operand 1601 states and 2006 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) 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-13 13:30:29,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:30:29,189 INFO L93 Difference]: Finished difference Result 1627 states and 2059 transitions. [2024-11-13 13:30:29,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:30:29,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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 11 [2024-11-13 13:30:29,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:30:29,196 INFO L225 Difference]: With dead ends: 1627 [2024-11-13 13:30:29,196 INFO L226 Difference]: Without dead ends: 1627 [2024-11-13 13:30:29,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:30:29,197 INFO L432 NwaCegarLoop]: 894 mSDtfsCounter, 1634 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1650 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:30:29,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1650 Valid, 1633 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1347 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-13 13:30:29,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2024-11-13 13:30:29,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1578. [2024-11-13 13:30:29,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1075 states have (on average 1.8148837209302326) internal successors, (1951), 1569 states have internal predecessors, (1951), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 13:30:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 1983 transitions. [2024-11-13 13:30:29,240 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 1983 transitions. Word has length 11 [2024-11-13 13:30:29,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:30:29,241 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 1983 transitions. [2024-11-13 13:30:29,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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-13 13:30:29,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 1983 transitions. [2024-11-13 13:30:29,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 13:30:29,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:30:29,242 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:30:29,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:30:29,242 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:30:29,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:30:29,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1344610681, now seen corresponding path program 1 times [2024-11-13 13:30:29,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:30:29,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590186709] [2024-11-13 13:30:29,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:29,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:30:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:29,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:30:29,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:30:29,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590186709] [2024-11-13 13:30:29,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590186709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:30:29,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:30:29,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:30:29,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644832500] [2024-11-13 13:30:29,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:30:29,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:30:29,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:30:29,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:30:29,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:30:29,374 INFO L87 Difference]: Start difference. First operand 1578 states and 1983 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-13 13:30:29,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:30:29,415 INFO L93 Difference]: Finished difference Result 1503 states and 1880 transitions. [2024-11-13 13:30:29,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:30:29,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 11 [2024-11-13 13:30:29,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:30:29,421 INFO L225 Difference]: With dead ends: 1503 [2024-11-13 13:30:29,421 INFO L226 Difference]: Without dead ends: 1503 [2024-11-13 13:30:29,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:30:29,424 INFO L432 NwaCegarLoop]: 1383 mSDtfsCounter, 61 mSDsluCounter, 1330 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 2713 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:30:29,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 2713 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:30:29,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2024-11-13 13:30:29,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2024-11-13 13:30:29,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1012 states have (on average 1.826086956521739) internal successors, (1848), 1494 states have internal predecessors, (1848), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 13:30:29,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1880 transitions. [2024-11-13 13:30:29,460 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1880 transitions. Word has length 11 [2024-11-13 13:30:29,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:30:29,461 INFO L471 AbstractCegarLoop]: Abstraction has 1503 states and 1880 transitions. [2024-11-13 13:30:29,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-13 13:30:29,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1880 transitions. [2024-11-13 13:30:29,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 13:30:29,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:30:29,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:30:29,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 13:30:29,467 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:30:29,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:30:29,467 INFO L85 PathProgramCache]: Analyzing trace with hash 614446658, now seen corresponding path program 1 times [2024-11-13 13:30:29,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:30:29,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188557492] [2024-11-13 13:30:29,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:29,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:30:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:30:29,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:30:29,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188557492] [2024-11-13 13:30:29,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188557492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:30:29,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:30:29,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:30:29,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835181951] [2024-11-13 13:30:29,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:30:29,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:30:29,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:30:29,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:30:29,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:30:29,566 INFO L87 Difference]: Start difference. First operand 1503 states and 1880 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:30:29,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:30:29,649 INFO L93 Difference]: Finished difference Result 1485 states and 1855 transitions. [2024-11-13 13:30:29,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:30:29,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-11-13 13:30:29,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:30:29,654 INFO L225 Difference]: With dead ends: 1485 [2024-11-13 13:30:29,654 INFO L226 Difference]: Without dead ends: 1485 [2024-11-13 13:30:29,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:30:29,655 INFO L432 NwaCegarLoop]: 1348 mSDtfsCounter, 41 mSDsluCounter, 2668 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 4016 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:30:29,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 4016 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:30:29,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2024-11-13 13:30:29,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1482. [2024-11-13 13:30:29,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 998 states have (on average 1.8236472945891784) internal successors, (1820), 1473 states have internal predecessors, (1820), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 13:30:29,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 1852 transitions. [2024-11-13 13:30:29,701 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 1852 transitions. Word has length 13 [2024-11-13 13:30:29,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:30:29,701 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 1852 transitions. [2024-11-13 13:30:29,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:30:29,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 1852 transitions. [2024-11-13 13:30:29,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 13:30:29,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:30:29,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:30:29,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 13:30:29,703 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:30:29,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:30:29,704 INFO L85 PathProgramCache]: Analyzing trace with hash 448345584, now seen corresponding path program 1 times [2024-11-13 13:30:29,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:30:29,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220594596] [2024-11-13 13:30:29,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:29,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:30:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:29,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:30:29,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:30:29,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220594596] [2024-11-13 13:30:29,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220594596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:30:29,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:30:29,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:30:29,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964132120] [2024-11-13 13:30:29,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:30:29,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:30:29,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:30:29,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:30:29,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:30:29,985 INFO L87 Difference]: Start difference. First operand 1482 states and 1852 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:30:31,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:30:31,527 INFO L93 Difference]: Finished difference Result 1680 states and 1944 transitions. [2024-11-13 13:30:31,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:30:31,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-13 13:30:31,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:30:31,533 INFO L225 Difference]: With dead ends: 1680 [2024-11-13 13:30:31,533 INFO L226 Difference]: Without dead ends: 1680 [2024-11-13 13:30:31,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:30:31,534 INFO L432 NwaCegarLoop]: 1168 mSDtfsCounter, 825 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 2596 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:30:31,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 2596 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-13 13:30:31,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2024-11-13 13:30:31,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1478. [2024-11-13 13:30:31,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1478 states, 998 states have (on average 1.8196392785571143) internal successors, (1816), 1469 states have internal predecessors, (1816), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 13:30:31,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 1848 transitions. [2024-11-13 13:30:31,573 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 1848 transitions. Word has length 27 [2024-11-13 13:30:31,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:30:31,573 INFO L471 AbstractCegarLoop]: Abstraction has 1478 states and 1848 transitions. [2024-11-13 13:30:31,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:30:31,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 1848 transitions. [2024-11-13 13:30:31,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-13 13:30:31,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:30:31,576 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:30:31,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 13:30:31,576 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:30:31,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:30:31,576 INFO L85 PathProgramCache]: Analyzing trace with hash -234532926, now seen corresponding path program 1 times [2024-11-13 13:30:31,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:30:31,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120621796] [2024-11-13 13:30:31,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:31,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:30:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:30:31,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:30:31,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120621796] [2024-11-13 13:30:31,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120621796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:30:31,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:30:31,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:30:31,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024860093] [2024-11-13 13:30:31,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:30:31,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:30:31,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:30:31,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:30:31,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:30:31,764 INFO L87 Difference]: Start difference. First operand 1478 states and 1848 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:30:31,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:30:31,836 INFO L93 Difference]: Finished difference Result 1478 states and 1844 transitions. [2024-11-13 13:30:31,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:30:31,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-13 13:30:31,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:30:31,842 INFO L225 Difference]: With dead ends: 1478 [2024-11-13 13:30:31,842 INFO L226 Difference]: Without dead ends: 1478 [2024-11-13 13:30:31,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:30:31,843 INFO L432 NwaCegarLoop]: 1343 mSDtfsCounter, 21 mSDsluCounter, 2655 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3998 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:30:31,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3998 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:30:31,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2024-11-13 13:30:31,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1478. [2024-11-13 13:30:31,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1478 states, 998 states have (on average 1.8156312625250501) internal successors, (1812), 1469 states have internal predecessors, (1812), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 13:30:31,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 1844 transitions. [2024-11-13 13:30:31,875 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 1844 transitions. Word has length 61 [2024-11-13 13:30:31,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:30:31,876 INFO L471 AbstractCegarLoop]: Abstraction has 1478 states and 1844 transitions. [2024-11-13 13:30:31,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:30:31,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 1844 transitions. [2024-11-13 13:30:31,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-13 13:30:31,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:30:31,880 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 13:30:31,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 13:30:31,881 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:30:31,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:30:31,881 INFO L85 PathProgramCache]: Analyzing trace with hash -2013989618, now seen corresponding path program 1 times [2024-11-13 13:30:31,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:30:31,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031989045] [2024-11-13 13:30:31,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:31,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:30:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:32,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:30:32,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:30:32,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031989045] [2024-11-13 13:30:32,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031989045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:30:32,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:30:32,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:30:32,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792461531] [2024-11-13 13:30:32,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:30:32,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:30:32,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:30:32,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:30:32,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:30:32,089 INFO L87 Difference]: Start difference. First operand 1478 states and 1844 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:30:32,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:30:32,141 INFO L93 Difference]: Finished difference Result 1570 states and 1963 transitions. [2024-11-13 13:30:32,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:30:32,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 69 [2024-11-13 13:30:32,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:30:32,149 INFO L225 Difference]: With dead ends: 1570 [2024-11-13 13:30:32,150 INFO L226 Difference]: Without dead ends: 1570 [2024-11-13 13:30:32,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:30:32,151 INFO L432 NwaCegarLoop]: 1358 mSDtfsCounter, 54 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2689 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:30:32,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2689 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:30:32,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2024-11-13 13:30:32,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1570. [2024-11-13 13:30:32,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1090 states have (on average 1.771559633027523) internal successors, (1931), 1561 states have internal predecessors, (1931), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 13:30:32,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 1963 transitions. [2024-11-13 13:30:32,208 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 1963 transitions. Word has length 69 [2024-11-13 13:30:32,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:30:32,209 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 1963 transitions. [2024-11-13 13:30:32,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:30:32,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 1963 transitions. [2024-11-13 13:30:32,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-13 13:30:32,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:30:32,213 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:30:32,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 13:30:32,213 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:30:32,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:30:32,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1821260209, now seen corresponding path program 1 times [2024-11-13 13:30:32,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:30:32,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109877512] [2024-11-13 13:30:32,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:32,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:30:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:32,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:30:32,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:30:32,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109877512] [2024-11-13 13:30:32,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109877512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:30:32,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:30:32,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:30:32,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398670539] [2024-11-13 13:30:32,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:30:32,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:30:32,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:30:32,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:30:32,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:30:32,870 INFO L87 Difference]: Start difference. First operand 1570 states and 1963 transitions. Second operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:30:34,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:30:34,406 INFO L93 Difference]: Finished difference Result 1486 states and 1879 transitions. [2024-11-13 13:30:34,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:30:34,406 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 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 72 [2024-11-13 13:30:34,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:30:34,411 INFO L225 Difference]: With dead ends: 1486 [2024-11-13 13:30:34,411 INFO L226 Difference]: Without dead ends: 1486 [2024-11-13 13:30:34,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:30:34,412 INFO L432 NwaCegarLoop]: 611 mSDtfsCounter, 2272 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2278 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:30:34,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2278 Valid, 1223 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-13 13:30:34,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2024-11-13 13:30:34,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1213. [2024-11-13 13:30:34,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 817 states have (on average 1.6682986536107711) internal successors, (1363), 1204 states have internal predecessors, (1363), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 13:30:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1395 transitions. [2024-11-13 13:30:34,441 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1395 transitions. Word has length 72 [2024-11-13 13:30:34,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:30:34,441 INFO L471 AbstractCegarLoop]: Abstraction has 1213 states and 1395 transitions. [2024-11-13 13:30:34,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:30:34,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1395 transitions. [2024-11-13 13:30:34,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-13 13:30:34,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:30:34,444 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:30:34,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 13:30:34,444 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:30:34,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:30:34,445 INFO L85 PathProgramCache]: Analyzing trace with hash -840152991, now seen corresponding path program 1 times [2024-11-13 13:30:34,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:30:34,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520095823] [2024-11-13 13:30:34,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:34,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:30:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:34,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:30:34,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:30:34,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520095823] [2024-11-13 13:30:34,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520095823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:30:34,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:30:34,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:30:34,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149014092] [2024-11-13 13:30:34,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:30:34,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:30:34,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:30:34,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:30:34,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:30:34,819 INFO L87 Difference]: Start difference. First operand 1213 states and 1395 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:30:36,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:30:36,091 INFO L93 Difference]: Finished difference Result 1212 states and 1394 transitions. [2024-11-13 13:30:36,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:30:36,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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 77 [2024-11-13 13:30:36,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:30:36,097 INFO L225 Difference]: With dead ends: 1212 [2024-11-13 13:30:36,097 INFO L226 Difference]: Without dead ends: 1212 [2024-11-13 13:30:36,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:30:36,099 INFO L432 NwaCegarLoop]: 1270 mSDtfsCounter, 2 mSDsluCounter, 2350 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3620 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:30:36,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3620 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 13:30:36,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2024-11-13 13:30:36,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1212. [2024-11-13 13:30:36,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 817 states have (on average 1.6670746634026927) internal successors, (1362), 1203 states have internal predecessors, (1362), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 13:30:36,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1394 transitions. [2024-11-13 13:30:36,120 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1394 transitions. Word has length 77 [2024-11-13 13:30:36,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:30:36,121 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1394 transitions. [2024-11-13 13:30:36,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:30:36,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1394 transitions. [2024-11-13 13:30:36,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-13 13:30:36,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:30:36,122 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:30:36,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 13:30:36,122 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:30:36,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:30:36,123 INFO L85 PathProgramCache]: Analyzing trace with hash -840152990, now seen corresponding path program 1 times [2024-11-13 13:30:36,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:30:36,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629148606] [2024-11-13 13:30:36,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:36,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:30:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:36,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:30:36,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:30:36,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629148606] [2024-11-13 13:30:36,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629148606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:30:36,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:30:36,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:30:36,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980048994] [2024-11-13 13:30:36,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:30:36,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:30:36,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:30:36,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:30:36,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:30:36,720 INFO L87 Difference]: Start difference. First operand 1212 states and 1394 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:30:38,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:30:38,114 INFO L93 Difference]: Finished difference Result 1211 states and 1393 transitions. [2024-11-13 13:30:38,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:30:38,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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 77 [2024-11-13 13:30:38,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:30:38,118 INFO L225 Difference]: With dead ends: 1211 [2024-11-13 13:30:38,118 INFO L226 Difference]: Without dead ends: 1211 [2024-11-13 13:30:38,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:30:38,119 INFO L432 NwaCegarLoop]: 1270 mSDtfsCounter, 1 mSDsluCounter, 2365 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3635 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:30:38,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3635 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-13 13:30:38,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2024-11-13 13:30:38,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1211. [2024-11-13 13:30:38,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 816 states have (on average 1.6678921568627452) internal successors, (1361), 1202 states have internal predecessors, (1361), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 13:30:38,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1393 transitions. [2024-11-13 13:30:38,140 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1393 transitions. Word has length 77 [2024-11-13 13:30:38,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:30:38,140 INFO L471 AbstractCegarLoop]: Abstraction has 1211 states and 1393 transitions. [2024-11-13 13:30:38,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:30:38,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1393 transitions. [2024-11-13 13:30:38,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-13 13:30:38,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:30:38,145 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:30:38,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 13:30:38,145 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:30:38,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:30:38,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1142943912, now seen corresponding path program 1 times [2024-11-13 13:30:38,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:30:38,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160027288] [2024-11-13 13:30:38,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:38,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:30:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:38,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:30:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:38,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:30:38,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:30:38,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160027288] [2024-11-13 13:30:38,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160027288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:30:38,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:30:38,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:30:38,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526251204] [2024-11-13 13:30:38,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:30:38,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:30:38,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:30:38,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:30:38,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:30:38,455 INFO L87 Difference]: Start difference. First operand 1211 states and 1393 transitions. Second operand has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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-13 13:30:40,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:30:40,191 INFO L93 Difference]: Finished difference Result 1223 states and 1411 transitions. [2024-11-13 13:30:40,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:30:40,191 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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-13 13:30:40,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:30:40,196 INFO L225 Difference]: With dead ends: 1223 [2024-11-13 13:30:40,196 INFO L226 Difference]: Without dead ends: 1223 [2024-11-13 13:30:40,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-13 13:30:40,197 INFO L432 NwaCegarLoop]: 1253 mSDtfsCounter, 16 mSDsluCounter, 4251 mSDsCounter, 0 mSdLazyCounter, 2107 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 5504 SdHoareTripleChecker+Invalid, 2124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:30:40,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 5504 Invalid, 2124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2107 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 13:30:40,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2024-11-13 13:30:40,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1217. [2024-11-13 13:30:40,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 821 states have (on average 1.66626065773447) internal successors, (1368), 1207 states have internal predecessors, (1368), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-13 13:30:40,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1406 transitions. [2024-11-13 13:30:40,220 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1406 transitions. Word has length 85 [2024-11-13 13:30:40,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:30:40,221 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1406 transitions. [2024-11-13 13:30:40,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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-13 13:30:40,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1406 transitions. [2024-11-13 13:30:40,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-13 13:30:40,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:30:40,222 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:30:40,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 13:30:40,222 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:30:40,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:30:40,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1142943913, now seen corresponding path program 1 times [2024-11-13 13:30:40,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:30:40,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952382486] [2024-11-13 13:30:40,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:40,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:30:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:40,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:30:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:40,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:30:40,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:30:40,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952382486] [2024-11-13 13:30:40,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952382486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:30:40,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:30:40,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:30:40,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321255700] [2024-11-13 13:30:40,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:30:40,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:30:40,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:30:40,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:30:40,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:30:40,952 INFO L87 Difference]: Start difference. First operand 1217 states and 1406 transitions. Second operand has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-13 13:30:42,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:30:42,546 INFO L93 Difference]: Finished difference Result 1217 states and 1405 transitions. [2024-11-13 13:30:42,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:30:42,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-13 13:30:42,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:30:42,551 INFO L225 Difference]: With dead ends: 1217 [2024-11-13 13:30:42,551 INFO L226 Difference]: Without dead ends: 1217 [2024-11-13 13:30:42,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:30:42,552 INFO L432 NwaCegarLoop]: 1260 mSDtfsCounter, 17 mSDsluCounter, 3348 mSDsCounter, 0 mSdLazyCounter, 1727 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4608 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:30:42,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4608 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-13 13:30:42,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2024-11-13 13:30:42,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1217. [2024-11-13 13:30:42,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 821 states have (on average 1.6650426309378807) internal successors, (1367), 1207 states have internal predecessors, (1367), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-13 13:30:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1405 transitions. [2024-11-13 13:30:42,574 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1405 transitions. Word has length 85 [2024-11-13 13:30:42,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:30:42,575 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1405 transitions. [2024-11-13 13:30:42,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-13 13:30:42,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1405 transitions. [2024-11-13 13:30:42,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 13:30:42,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:30:42,576 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:30:42,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 13:30:42,576 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:30:42,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:30:42,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1242134335, now seen corresponding path program 1 times [2024-11-13 13:30:42,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:30:42,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13889882] [2024-11-13 13:30:42,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:42,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:30:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:43,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:30:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:43,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:30:43,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:30:43,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13889882] [2024-11-13 13:30:43,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13889882] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:30:43,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745946664] [2024-11-13 13:30:43,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:43,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:30:43,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:30:43,193 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:30:43,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:30:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:43,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-13 13:30:43,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:30:43,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:30:43,664 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:30:43,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:30:43,680 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 19 treesize of output 1 [2024-11-13 13:30:43,782 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:30:43,782 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 42 treesize of output 41 [2024-11-13 13:30:43,823 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 31 treesize of output 13 [2024-11-13 13:30:43,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:30:43,827 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:30:43,883 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-13 13:30:43,883 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 21 treesize of output 20 [2024-11-13 13:30:43,892 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_507 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)))) is different from false [2024-11-13 13:30:43,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745946664] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:30:43,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:30:43,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2024-11-13 13:30:43,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823480209] [2024-11-13 13:30:43,894 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:30:43,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 13:30:43,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:30:43,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 13:30:43,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=176, Unknown=1, NotChecked=26, Total=240 [2024-11-13 13:30:43,896 INFO L87 Difference]: Start difference. First operand 1217 states and 1405 transitions. Second operand has 15 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:30:47,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:30:47,518 INFO L93 Difference]: Finished difference Result 1216 states and 1404 transitions. [2024-11-13 13:30:47,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:30:47,518 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2024-11-13 13:30:47,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:30:47,522 INFO L225 Difference]: With dead ends: 1216 [2024-11-13 13:30:47,522 INFO L226 Difference]: Without dead ends: 1216 [2024-11-13 13:30:47,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=419, Unknown=1, NotChecked=42, Total=552 [2024-11-13 13:30:47,523 INFO L432 NwaCegarLoop]: 780 mSDtfsCounter, 1170 mSDsluCounter, 8162 mSDsCounter, 0 mSdLazyCounter, 6239 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 8942 SdHoareTripleChecker+Invalid, 6270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 6239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:30:47,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1190 Valid, 8942 Invalid, 6270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 6239 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-13 13:30:47,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2024-11-13 13:30:47,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1216. [2024-11-13 13:30:47,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 821 states have (on average 1.6638246041412912) internal successors, (1366), 1206 states have internal predecessors, (1366), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-13 13:30:47,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1404 transitions. [2024-11-13 13:30:47,544 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1404 transitions. Word has length 86 [2024-11-13 13:30:47,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:30:47,544 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1404 transitions. [2024-11-13 13:30:47,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:30:47,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1404 transitions. [2024-11-13 13:30:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 13:30:47,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:30:47,546 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:30:47,567 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 13:30:47,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:30:47,750 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:30:47,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:30:47,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1242134336, now seen corresponding path program 1 times [2024-11-13 13:30:47,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:30:47,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453528982] [2024-11-13 13:30:47,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:47,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:30:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:48,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:30:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:48,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:30:48,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:30:48,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453528982] [2024-11-13 13:30:48,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453528982] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:30:48,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248273396] [2024-11-13 13:30:48,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:48,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:30:48,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:30:48,662 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:30:48,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 13:30:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:48,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-13 13:30:48,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:30:48,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:30:49,082 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:30:49,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:30:49,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 13:30:49,123 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 19 treesize of output 1 [2024-11-13 13:30:49,361 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:30:49,362 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 70 treesize of output 65 [2024-11-13 13:30:49,371 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 30 [2024-11-13 13:30:49,428 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 39 treesize of output 21 [2024-11-13 13:30:49,437 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 32 treesize of output 14 [2024-11-13 13:30:49,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:30:49,468 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:30:49,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:30:49,622 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 48 treesize of output 52 [2024-11-13 13:30:49,670 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_1 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_1) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ |c_ULTIMATE.start_main_#t~mem50#1.offset| 25))) (forall ((v_ArrVal_641 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_641) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))) (forall ((v_ArrVal_642 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem50#1.base|)))) is different from false [2024-11-13 13:30:49,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248273396] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:30:49,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:30:49,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2024-11-13 13:30:49,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334378138] [2024-11-13 13:30:49,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:30:49,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 13:30:49,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:30:49,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 13:30:49,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=399, Unknown=1, NotChecked=40, Total=506 [2024-11-13 13:30:49,674 INFO L87 Difference]: Start difference. First operand 1216 states and 1404 transitions. Second operand has 20 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 19 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:30:54,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:30:54,889 INFO L93 Difference]: Finished difference Result 1215 states and 1403 transitions. [2024-11-13 13:30:54,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 13:30:54,889 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 19 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 86 [2024-11-13 13:30:54,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:30:54,893 INFO L225 Difference]: With dead ends: 1215 [2024-11-13 13:30:54,893 INFO L226 Difference]: Without dead ends: 1215 [2024-11-13 13:30:54,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=596, Unknown=1, NotChecked=50, Total=756 [2024-11-13 13:30:54,894 INFO L432 NwaCegarLoop]: 779 mSDtfsCounter, 1166 mSDsluCounter, 8646 mSDsCounter, 0 mSdLazyCounter, 8304 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 9425 SdHoareTripleChecker+Invalid, 8339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 8304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:30:54,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 9425 Invalid, 8339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 8304 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-13 13:30:54,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2024-11-13 13:30:54,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1209. [2024-11-13 13:30:54,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 816 states have (on average 1.6654411764705883) internal successors, (1359), 1200 states have internal predecessors, (1359), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 13:30:54,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1391 transitions. [2024-11-13 13:30:54,913 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1391 transitions. Word has length 86 [2024-11-13 13:30:54,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:30:54,914 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1391 transitions. [2024-11-13 13:30:54,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 19 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:30:54,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1391 transitions. [2024-11-13 13:30:54,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-13 13:30:54,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:30:54,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:30:54,935 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 13:30:55,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 13:30:55,115 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:30:55,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:30:55,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1058039496, now seen corresponding path program 1 times [2024-11-13 13:30:55,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:30:55,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616231595] [2024-11-13 13:30:55,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:55,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:30:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:55,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:30:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:30:55,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:30:55,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616231595] [2024-11-13 13:30:55,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616231595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:30:55,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:30:55,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 13:30:55,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432668823] [2024-11-13 13:30:55,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:30:55,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 13:30:55,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:30:55,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 13:30:55,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-13 13:30:55,742 INFO L87 Difference]: Start difference. First operand 1209 states and 1391 transitions. Second operand has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 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-13 13:30:58,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:30:58,174 INFO L93 Difference]: Finished difference Result 1219 states and 1407 transitions. [2024-11-13 13:30:58,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 13:30:58,175 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 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 88 [2024-11-13 13:30:58,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:30:58,182 INFO L225 Difference]: With dead ends: 1219 [2024-11-13 13:30:58,182 INFO L226 Difference]: Without dead ends: 1219 [2024-11-13 13:30:58,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-13 13:30:58,183 INFO L432 NwaCegarLoop]: 779 mSDtfsCounter, 1201 mSDsluCounter, 5214 mSDsCounter, 0 mSdLazyCounter, 4181 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 5993 SdHoareTripleChecker+Invalid, 4212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 4181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:30:58,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1221 Valid, 5993 Invalid, 4212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 4181 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-13 13:30:58,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2024-11-13 13:30:58,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1218. [2024-11-13 13:30:58,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 824 states have (on average 1.6614077669902914) internal successors, (1369), 1208 states have internal predecessors, (1369), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-13 13:30:58,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1407 transitions. [2024-11-13 13:30:58,216 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1407 transitions. Word has length 88 [2024-11-13 13:30:58,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:30:58,216 INFO L471 AbstractCegarLoop]: Abstraction has 1218 states and 1407 transitions. [2024-11-13 13:30:58,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 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-13 13:30:58,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1407 transitions. [2024-11-13 13:30:58,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-13 13:30:58,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:30:58,217 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:30:58,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 13:30:58,218 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:30:58,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:30:58,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1058039495, now seen corresponding path program 1 times [2024-11-13 13:30:58,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:30:58,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6795414] [2024-11-13 13:30:58,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:58,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:30:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:59,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:30:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:59,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:30:59,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:30:59,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6795414] [2024-11-13 13:30:59,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6795414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:30:59,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:30:59,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 13:30:59,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601123769] [2024-11-13 13:30:59,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:30:59,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 13:30:59,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:30:59,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 13:30:59,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-13 13:30:59,224 INFO L87 Difference]: Start difference. First operand 1218 states and 1407 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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-13 13:31:02,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:31:02,704 INFO L93 Difference]: Finished difference Result 1218 states and 1406 transitions. [2024-11-13 13:31:02,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:31:02,705 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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 88 [2024-11-13 13:31:02,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:31:02,708 INFO L225 Difference]: With dead ends: 1218 [2024-11-13 13:31:02,708 INFO L226 Difference]: Without dead ends: 1218 [2024-11-13 13:31:02,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-13 13:31:02,709 INFO L432 NwaCegarLoop]: 786 mSDtfsCounter, 1194 mSDsluCounter, 3963 mSDsCounter, 0 mSdLazyCounter, 4125 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 4749 SdHoareTripleChecker+Invalid, 4154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 4125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:31:02,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 4749 Invalid, 4154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 4125 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-13 13:31:02,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2024-11-13 13:31:02,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1218. [2024-11-13 13:31:02,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 824 states have (on average 1.6601941747572815) internal successors, (1368), 1208 states have internal predecessors, (1368), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-13 13:31:02,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1406 transitions. [2024-11-13 13:31:02,729 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1406 transitions. Word has length 88 [2024-11-13 13:31:02,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:31:02,729 INFO L471 AbstractCegarLoop]: Abstraction has 1218 states and 1406 transitions. [2024-11-13 13:31:02,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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-13 13:31:02,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1406 transitions. [2024-11-13 13:31:02,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-13 13:31:02,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:31:02,731 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:31:02,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 13:31:02,731 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:31:02,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:31:02,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1013647551, now seen corresponding path program 1 times [2024-11-13 13:31:02,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:31:02,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207808432] [2024-11-13 13:31:02,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:02,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:31:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:03,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:31:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:31:03,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:31:03,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207808432] [2024-11-13 13:31:03,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207808432] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:31:03,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030793489] [2024-11-13 13:31:03,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:03,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:31:03,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:31:03,526 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:31:03,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 13:31:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:03,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-13 13:31:03,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:31:03,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:31:04,055 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:31:04,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:31:04,067 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 19 treesize of output 1 [2024-11-13 13:31:04,177 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:31:04,178 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 42 treesize of output 41 [2024-11-13 13:31:04,256 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:31:04,256 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 42 treesize of output 41 [2024-11-13 13:31:04,274 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 31 treesize of output 13 [2024-11-13 13:31:04,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:31:04,279 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:31:04,345 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_897 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_897) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-13 13:31:04,404 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-13 13:31:04,405 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 33 treesize of output 32 [2024-11-13 13:31:04,415 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_897 (Array Int Int)) (v_ArrVal_900 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_900))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_897)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-13 13:31:04,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030793489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:31:04,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:31:04,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 16 [2024-11-13 13:31:04,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473114853] [2024-11-13 13:31:04,418 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:31:04,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 13:31:04,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:31:04,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 13:31:04,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=8, NotChecked=66, Total=380 [2024-11-13 13:31:04,421 INFO L87 Difference]: Start difference. First operand 1218 states and 1406 transitions. Second operand has 17 states, 15 states have (on average 8.6) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:31:08,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:31:08,276 INFO L93 Difference]: Finished difference Result 1217 states and 1405 transitions. [2024-11-13 13:31:08,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:31:08,276 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 8.6) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2024-11-13 13:31:08,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:31:08,280 INFO L225 Difference]: With dead ends: 1217 [2024-11-13 13:31:08,280 INFO L226 Difference]: Without dead ends: 1217 [2024-11-13 13:31:08,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=541, Unknown=8, NotChecked=98, Total=756 [2024-11-13 13:31:08,280 INFO L432 NwaCegarLoop]: 779 mSDtfsCounter, 1164 mSDsluCounter, 8888 mSDsCounter, 0 mSdLazyCounter, 6765 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 9667 SdHoareTripleChecker+Invalid, 6795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 6765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:31:08,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 9667 Invalid, 6795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 6765 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-13 13:31:08,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2024-11-13 13:31:08,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1217. [2024-11-13 13:31:08,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 824 states have (on average 1.6589805825242718) internal successors, (1367), 1207 states have internal predecessors, (1367), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-13 13:31:08,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1405 transitions. [2024-11-13 13:31:08,297 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1405 transitions. Word has length 89 [2024-11-13 13:31:08,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:31:08,297 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1405 transitions. [2024-11-13 13:31:08,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 8.6) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:31:08,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1405 transitions. [2024-11-13 13:31:08,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-13 13:31:08,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:31:08,299 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:31:08,320 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 13:31:08,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:31:08,503 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:31:08,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:31:08,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1013647550, now seen corresponding path program 1 times [2024-11-13 13:31:08,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:31:08,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736984696] [2024-11-13 13:31:08,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:08,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:31:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:09,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:31:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:31:09,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:31:09,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736984696] [2024-11-13 13:31:09,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736984696] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:31:09,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795092355] [2024-11-13 13:31:09,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:09,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:31:09,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:31:09,453 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:31:09,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 13:31:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:09,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-13 13:31:09,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:31:09,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:31:09,850 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:31:09,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:31:09,857 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-13 13:31:09,865 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 19 treesize of output 1 [2024-11-13 13:31:09,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 13:31:09,951 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 22 treesize of output 10 [2024-11-13 13:31:09,961 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 9 treesize of output 3 [2024-11-13 13:31:10,094 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:31:10,094 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 62 treesize of output 57 [2024-11-13 13:31:10,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:31:10,189 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:31:10,189 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 62 treesize of output 57 [2024-11-13 13:31:10,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:31:10,221 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 31 treesize of output 13 [2024-11-13 13:31:10,226 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 9 treesize of output 3 [2024-11-13 13:31:10,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:31:10,231 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:31:10,316 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1043 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1043) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1043 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1043) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-13 13:31:10,331 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1043 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1043) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1044) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1043 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1043) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-13 13:31:10,396 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1043 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1050) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1049) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1043) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1043 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1049))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1050) .cse1 v_ArrVal_1043) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1044) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-13 13:31:10,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795092355] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:31:10,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:31:10,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 16 [2024-11-13 13:31:10,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541515781] [2024-11-13 13:31:10,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:31:10,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 13:31:10,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:31:10,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 13:31:10,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=293, Unknown=3, NotChecked=108, Total=462 [2024-11-13 13:31:10,401 INFO L87 Difference]: Start difference. First operand 1217 states and 1405 transitions. Second operand has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 16 states have internal predecessors, (133), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:31:16,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:31:16,031 INFO L93 Difference]: Finished difference Result 1224 states and 1412 transitions. [2024-11-13 13:31:16,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:31:16,032 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 16 states have internal predecessors, (133), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 89 [2024-11-13 13:31:16,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:31:16,035 INFO L225 Difference]: With dead ends: 1224 [2024-11-13 13:31:16,035 INFO L226 Difference]: Without dead ends: 1224 [2024-11-13 13:31:16,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=599, Unknown=3, NotChecked=156, Total=870 [2024-11-13 13:31:16,036 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 1170 mSDsluCounter, 7290 mSDsCounter, 0 mSdLazyCounter, 8379 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 8067 SdHoareTripleChecker+Invalid, 8412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 8379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:31:16,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1190 Valid, 8067 Invalid, 8412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 8379 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-13 13:31:16,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2024-11-13 13:31:16,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1212. [2024-11-13 13:31:16,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 820 states have (on average 1.6609756097560975) internal successors, (1362), 1202 states have internal predecessors, (1362), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 13:31:16,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1394 transitions. [2024-11-13 13:31:16,048 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1394 transitions. Word has length 89 [2024-11-13 13:31:16,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:31:16,048 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1394 transitions. [2024-11-13 13:31:16,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 16 states have internal predecessors, (133), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:31:16,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1394 transitions. [2024-11-13 13:31:16,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-13 13:31:16,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:31:16,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:31:16,063 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 13:31:16,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:31:16,250 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:31:16,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:31:16,250 INFO L85 PathProgramCache]: Analyzing trace with hash 710967759, now seen corresponding path program 1 times [2024-11-13 13:31:16,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:31:16,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443546422] [2024-11-13 13:31:16,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:16,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:31:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:16,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:31:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:16,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:31:16,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:31:16,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443546422] [2024-11-13 13:31:16,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443546422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:31:16,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:31:16,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 13:31:16,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11218919] [2024-11-13 13:31:16,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:31:16,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 13:31:16,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:31:16,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 13:31:16,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-13 13:31:16,877 INFO L87 Difference]: Start difference. First operand 1212 states and 1394 transitions. Second operand has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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-13 13:31:20,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:31:20,078 INFO L93 Difference]: Finished difference Result 1228 states and 1416 transitions. [2024-11-13 13:31:20,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:31:20,079 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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 91 [2024-11-13 13:31:20,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:31:20,082 INFO L225 Difference]: With dead ends: 1228 [2024-11-13 13:31:20,083 INFO L226 Difference]: Without dead ends: 1228 [2024-11-13 13:31:20,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-13 13:31:20,084 INFO L432 NwaCegarLoop]: 778 mSDtfsCounter, 1178 mSDsluCounter, 7406 mSDsCounter, 0 mSdLazyCounter, 5755 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 8184 SdHoareTripleChecker+Invalid, 5785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 5755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:31:20,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 8184 Invalid, 5785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 5755 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-13 13:31:20,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2024-11-13 13:31:20,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1224. [2024-11-13 13:31:20,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 831 states have (on average 1.654632972322503) internal successors, (1375), 1213 states have internal predecessors, (1375), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-13 13:31:20,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1408 transitions. [2024-11-13 13:31:20,105 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1408 transitions. Word has length 91 [2024-11-13 13:31:20,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:31:20,106 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1408 transitions. [2024-11-13 13:31:20,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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-13 13:31:20,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1408 transitions. [2024-11-13 13:31:20,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-13 13:31:20,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:31:20,107 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:31:20,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 13:31:20,107 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:31:20,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:31:20,107 INFO L85 PathProgramCache]: Analyzing trace with hash 710967760, now seen corresponding path program 1 times [2024-11-13 13:31:20,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:31:20,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529663488] [2024-11-13 13:31:20,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:20,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:31:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:20,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:31:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:20,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:31:20,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:31:20,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529663488] [2024-11-13 13:31:20,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529663488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:31:20,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:31:20,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 13:31:20,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170784523] [2024-11-13 13:31:20,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:31:21,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 13:31:21,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:31:21,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 13:31:21,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-13 13:31:21,001 INFO L87 Difference]: Start difference. First operand 1224 states and 1408 transitions. Second operand has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 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-13 13:31:23,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:31:23,829 INFO L93 Difference]: Finished difference Result 1227 states and 1415 transitions. [2024-11-13 13:31:23,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:31:23,829 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 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 91 [2024-11-13 13:31:23,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:31:23,833 INFO L225 Difference]: With dead ends: 1227 [2024-11-13 13:31:23,833 INFO L226 Difference]: Without dead ends: 1227 [2024-11-13 13:31:23,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-13 13:31:23,834 INFO L432 NwaCegarLoop]: 785 mSDtfsCounter, 1195 mSDsluCounter, 3965 mSDsCounter, 0 mSdLazyCounter, 4126 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1215 SdHoareTripleChecker+Valid, 4750 SdHoareTripleChecker+Invalid, 4155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 4126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:31:23,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1215 Valid, 4750 Invalid, 4155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 4126 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-13 13:31:23,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2024-11-13 13:31:23,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1224. [2024-11-13 13:31:23,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 831 states have (on average 1.6534296028880866) internal successors, (1374), 1213 states have internal predecessors, (1374), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-13 13:31:23,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1407 transitions. [2024-11-13 13:31:23,852 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1407 transitions. Word has length 91 [2024-11-13 13:31:23,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:31:23,852 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1407 transitions. [2024-11-13 13:31:23,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 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-13 13:31:23,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1407 transitions. [2024-11-13 13:31:23,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 13:31:23,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:31:23,853 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:31:23,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 13:31:23,854 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:31:23,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:31:23,854 INFO L85 PathProgramCache]: Analyzing trace with hash 341474086, now seen corresponding path program 1 times [2024-11-13 13:31:23,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:31:23,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470236351] [2024-11-13 13:31:23,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:23,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:31:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:24,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:31:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:24,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:31:24,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:31:24,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470236351] [2024-11-13 13:31:24,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470236351] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:31:24,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948306162] [2024-11-13 13:31:24,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:24,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:31:24,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:31:24,525 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:31:24,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 13:31:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:24,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-13 13:31:24,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:31:24,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:31:24,925 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:31:24,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:31:24,933 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 19 treesize of output 1 [2024-11-13 13:31:25,019 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:31:25,020 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 42 treesize of output 41 [2024-11-13 13:31:25,070 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:31:25,070 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 42 treesize of output 41 [2024-11-13 13:31:25,136 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:31:25,136 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 42 treesize of output 41 [2024-11-13 13:31:25,150 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 31 treesize of output 13 [2024-11-13 13:31:25,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:31:25,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:31:25,247 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1329 (Array Int Int)) (v_ArrVal_1330 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1329))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1330)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 13:31:25,325 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-13 13:31:25,325 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 57 treesize of output 56 [2024-11-13 13:31:25,334 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1329 (Array Int Int)) (v_ArrVal_1333 (Array Int Int)) (v_ArrVal_1330 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1333))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1329)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1330)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-13 13:31:25,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948306162] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:31:25,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:31:25,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 18 [2024-11-13 13:31:25,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584216174] [2024-11-13 13:31:25,337 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:31:25,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 13:31:25,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:31:25,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 13:31:25,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=378, Unknown=17, NotChecked=82, Total=552 [2024-11-13 13:31:25,338 INFO L87 Difference]: Start difference. First operand 1224 states and 1407 transitions. Second operand has 19 states, 17 states have (on average 7.882352941176471) internal successors, (134), 17 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:31:29,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:31:29,459 INFO L93 Difference]: Finished difference Result 1226 states and 1414 transitions. [2024-11-13 13:31:29,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 13:31:29,460 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 7.882352941176471) internal successors, (134), 17 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-13 13:31:29,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:31:29,463 INFO L225 Difference]: With dead ends: 1226 [2024-11-13 13:31:29,467 INFO L226 Difference]: Without dead ends: 1226 [2024-11-13 13:31:29,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=769, Unknown=17, NotChecked=118, Total=1056 [2024-11-13 13:31:29,469 INFO L432 NwaCegarLoop]: 778 mSDtfsCounter, 1162 mSDsluCounter, 9632 mSDsCounter, 0 mSdLazyCounter, 7297 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 10410 SdHoareTripleChecker+Invalid, 7327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 7297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:31:29,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 10410 Invalid, 7327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 7297 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-13 13:31:29,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2024-11-13 13:31:29,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1223. [2024-11-13 13:31:29,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 831 states have (on average 1.6522262334536704) internal successors, (1373), 1212 states have internal predecessors, (1373), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-13 13:31:29,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1406 transitions. [2024-11-13 13:31:29,509 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1406 transitions. Word has length 92 [2024-11-13 13:31:29,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:31:29,510 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1406 transitions. [2024-11-13 13:31:29,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 7.882352941176471) internal successors, (134), 17 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:31:29,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1406 transitions. [2024-11-13 13:31:29,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 13:31:29,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:31:29,513 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:31:29,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-13 13:31:29,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:31:29,718 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:31:29,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:31:29,719 INFO L85 PathProgramCache]: Analyzing trace with hash 341474087, now seen corresponding path program 1 times [2024-11-13 13:31:29,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:31:29,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499853018] [2024-11-13 13:31:29,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:29,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:31:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:30,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:31:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:30,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:31:30,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:31:30,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499853018] [2024-11-13 13:31:30,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499853018] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:31:30,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658596996] [2024-11-13 13:31:30,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:30,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:31:30,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:31:30,598 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:31:30,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 13:31:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:30,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-13 13:31:30,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:31:30,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:31:31,059 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-13 13:31:31,072 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:31:31,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:31:31,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 13:31:31,092 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 19 treesize of output 1 [2024-11-13 13:31:31,158 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 22 treesize of output 10 [2024-11-13 13:31:31,163 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 9 treesize of output 3 [2024-11-13 13:31:31,321 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:31:31,321 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 62 treesize of output 57 [2024-11-13 13:31:31,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:31:31,427 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:31:31,427 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 62 treesize of output 57 [2024-11-13 13:31:31,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:31:31,514 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:31:31,515 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 62 treesize of output 57 [2024-11-13 13:31:31,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:31:31,544 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 31 treesize of output 13 [2024-11-13 13:31:31,549 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 9 treesize of output 3 [2024-11-13 13:31:31,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:31:31,551 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:31:31,624 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1491 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1490) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1491 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))))) is different from false [2024-11-13 13:31:31,641 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1491 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1490) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1491 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-13 13:31:31,691 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1491 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1489))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1488) .cse0 v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1490) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1491 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1488) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1489) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2024-11-13 13:31:31,715 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1491 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1488) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1489) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1491 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1489))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1488) .cse2 v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1490) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-13 13:31:31,816 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1497 (Array Int Int)) (v_ArrVal_1496 (Array Int Int)) (v_ArrVal_1491 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1496))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1497) .cse0 v_ArrVal_1488) (select (select (store .cse1 .cse0 v_ArrVal_1489) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1491))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1497 (Array Int Int)) (v_ArrVal_1496 (Array Int Int)) (v_ArrVal_1491 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1496))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1489))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1497) .cse3 v_ArrVal_1488) .cse4 v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1490) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-13 13:31:31,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658596996] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:31:31,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:31:31,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 18 [2024-11-13 13:31:31,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604196536] [2024-11-13 13:31:31,820 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:31:31,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 13:31:31,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:31:31,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 13:31:31,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=362, Unknown=5, NotChecked=210, Total=650 [2024-11-13 13:31:31,821 INFO L87 Difference]: Start difference. First operand 1223 states and 1406 transitions. Second operand has 19 states, 17 states have (on average 8.117647058823529) internal successors, (138), 18 states have internal predecessors, (138), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:31:39,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:31:39,380 INFO L93 Difference]: Finished difference Result 1225 states and 1413 transitions. [2024-11-13 13:31:39,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 13:31:39,381 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.117647058823529) internal successors, (138), 18 states have internal predecessors, (138), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 92 [2024-11-13 13:31:39,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:31:39,384 INFO L225 Difference]: With dead ends: 1225 [2024-11-13 13:31:39,384 INFO L226 Difference]: Without dead ends: 1225 [2024-11-13 13:31:39,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=749, Unknown=5, NotChecked=300, Total=1190 [2024-11-13 13:31:39,385 INFO L432 NwaCegarLoop]: 776 mSDtfsCounter, 1168 mSDsluCounter, 7716 mSDsCounter, 0 mSdLazyCounter, 9221 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 8492 SdHoareTripleChecker+Invalid, 9254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 9221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:31:39,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 8492 Invalid, 9254 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [33 Valid, 9221 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-13 13:31:39,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2024-11-13 13:31:39,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1210. [2024-11-13 13:31:39,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 820 states have (on average 1.6585365853658536) internal successors, (1360), 1200 states have internal predecessors, (1360), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 13:31:39,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1392 transitions. [2024-11-13 13:31:39,412 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1392 transitions. Word has length 92 [2024-11-13 13:31:39,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:31:39,412 INFO L471 AbstractCegarLoop]: Abstraction has 1210 states and 1392 transitions. [2024-11-13 13:31:39,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.117647058823529) internal successors, (138), 18 states have internal predecessors, (138), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:31:39,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1392 transitions. [2024-11-13 13:31:39,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 13:31:39,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:31:39,416 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:31:39,442 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 13:31:39,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-13 13:31:39,624 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:31:39,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:31:39,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1957386495, now seen corresponding path program 1 times [2024-11-13 13:31:39,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:31:39,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229824557] [2024-11-13 13:31:39,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:39,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:31:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:40,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:31:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:40,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:31:40,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:31:40,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229824557] [2024-11-13 13:31:40,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229824557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:31:40,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:31:40,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-13 13:31:40,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053571170] [2024-11-13 13:31:40,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:31:40,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 13:31:40,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:31:40,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 13:31:40,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-13 13:31:40,234 INFO L87 Difference]: Start difference. First operand 1210 states and 1392 transitions. Second operand has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 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-13 13:31:42,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:31:42,943 INFO L93 Difference]: Finished difference Result 1229 states and 1417 transitions. [2024-11-13 13:31:42,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 13:31:42,943 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 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 94 [2024-11-13 13:31:42,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:31:42,947 INFO L225 Difference]: With dead ends: 1229 [2024-11-13 13:31:42,947 INFO L226 Difference]: Without dead ends: 1229 [2024-11-13 13:31:42,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-13 13:31:42,948 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 1185 mSDsluCounter, 5210 mSDsCounter, 0 mSdLazyCounter, 4191 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 5987 SdHoareTripleChecker+Invalid, 4222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 4191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:31:42,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 5987 Invalid, 4222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 4191 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-13 13:31:42,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2024-11-13 13:31:42,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1225. [2024-11-13 13:31:42,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 834 states have (on average 1.6498800959232613) internal successors, (1376), 1214 states have internal predecessors, (1376), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-13 13:31:42,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1409 transitions. [2024-11-13 13:31:42,969 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1409 transitions. Word has length 94 [2024-11-13 13:31:42,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:31:42,969 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1409 transitions. [2024-11-13 13:31:42,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 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-13 13:31:42,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1409 transitions. [2024-11-13 13:31:42,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 13:31:42,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:31:42,971 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:31:42,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 13:31:42,971 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:31:42,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:31:42,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1957386496, now seen corresponding path program 1 times [2024-11-13 13:31:42,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:31:42,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341949078] [2024-11-13 13:31:42,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:42,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:31:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:43,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:31:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:43,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:31:43,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:31:43,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341949078] [2024-11-13 13:31:43,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341949078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:31:43,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:31:43,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 13:31:43,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853186318] [2024-11-13 13:31:43,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:31:43,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 13:31:43,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:31:43,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 13:31:43,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-13 13:31:43,967 INFO L87 Difference]: Start difference. First operand 1225 states and 1409 transitions. Second operand has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 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-13 13:31:47,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:31:47,178 INFO L93 Difference]: Finished difference Result 1228 states and 1416 transitions. [2024-11-13 13:31:47,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 13:31:47,179 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 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 94 [2024-11-13 13:31:47,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:31:47,181 INFO L225 Difference]: With dead ends: 1228 [2024-11-13 13:31:47,182 INFO L226 Difference]: Without dead ends: 1228 [2024-11-13 13:31:47,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-13 13:31:47,183 INFO L432 NwaCegarLoop]: 784 mSDtfsCounter, 1183 mSDsluCounter, 3791 mSDsCounter, 0 mSdLazyCounter, 4328 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 4575 SdHoareTripleChecker+Invalid, 4372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 4328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:31:47,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 4575 Invalid, 4372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 4328 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-13 13:31:47,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2024-11-13 13:31:47,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2024-11-13 13:31:47,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 834 states have (on average 1.6486810551558753) internal successors, (1375), 1214 states have internal predecessors, (1375), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-13 13:31:47,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1408 transitions. [2024-11-13 13:31:47,207 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1408 transitions. Word has length 94 [2024-11-13 13:31:47,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:31:47,207 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1408 transitions. [2024-11-13 13:31:47,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 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-13 13:31:47,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1408 transitions. [2024-11-13 13:31:47,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 13:31:47,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:31:47,210 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:31:47,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 13:31:47,210 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:31:47,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:31:47,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1922413496, now seen corresponding path program 1 times [2024-11-13 13:31:47,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:31:47,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300111421] [2024-11-13 13:31:47,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:47,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:31:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:48,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:31:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:48,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:31:48,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:31:48,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300111421] [2024-11-13 13:31:48,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300111421] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:31:48,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796639364] [2024-11-13 13:31:48,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:48,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:31:48,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:31:48,125 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:31:48,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 13:31:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:48,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-13 13:31:48,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:31:48,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:31:48,629 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:31:48,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:31:48,640 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 19 treesize of output 1 [2024-11-13 13:31:48,733 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:31:48,733 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 42 treesize of output 41 [2024-11-13 13:31:48,789 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:31:48,789 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 42 treesize of output 41 [2024-11-13 13:31:48,851 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:31:48,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 13:31:48,912 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:31:48,912 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 42 treesize of output 41 [2024-11-13 13:31:48,926 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 31 treesize of output 13 [2024-11-13 13:31:48,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:31:48,930 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:31:48,987 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1802) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-13 13:31:48,998 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int)) (v_ArrVal_1801 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1801))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1802)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 13:31:49,053 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int)) (v_ArrVal_1801 (Array Int Int)) (v_ArrVal_1800 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1800))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1801)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1802)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 13:31:49,156 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-13 13:31:49,156 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 105 treesize of output 104 [2024-11-13 13:31:49,165 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int)) (v_ArrVal_1801 (Array Int Int)) (v_ArrVal_1800 (Array Int Int)) (v_ArrVal_1805 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1805))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1800)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1801)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1802)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-13 13:31:49,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796639364] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:31:49,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:31:49,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 21 [2024-11-13 13:31:49,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153767744] [2024-11-13 13:31:49,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:31:49,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 13:31:49,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:31:49,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 13:31:49,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=498, Unknown=22, NotChecked=196, Total=812 [2024-11-13 13:31:49,169 INFO L87 Difference]: Start difference. First operand 1225 states and 1408 transitions. Second operand has 22 states, 20 states have (on average 7.2) internal successors, (144), 21 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:31:52,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:31:52,374 INFO L93 Difference]: Finished difference Result 1227 states and 1415 transitions. [2024-11-13 13:31:52,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 13:31:52,375 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 7.2) internal successors, (144), 21 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 95 [2024-11-13 13:31:52,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:31:52,378 INFO L225 Difference]: With dead ends: 1227 [2024-11-13 13:31:52,378 INFO L226 Difference]: Without dead ends: 1227 [2024-11-13 13:31:52,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=998, Unknown=22, NotChecked=276, Total=1482 [2024-11-13 13:31:52,380 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 1168 mSDsluCounter, 6641 mSDsCounter, 0 mSdLazyCounter, 5257 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 7418 SdHoareTripleChecker+Invalid, 5303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 5257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:31:52,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 7418 Invalid, 5303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 5257 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-13 13:31:52,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2024-11-13 13:31:52,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1224. [2024-11-13 13:31:52,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 834 states have (on average 1.6474820143884892) internal successors, (1374), 1213 states have internal predecessors, (1374), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-13 13:31:52,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1407 transitions. [2024-11-13 13:31:52,399 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1407 transitions. Word has length 95 [2024-11-13 13:31:52,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:31:52,399 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1407 transitions. [2024-11-13 13:31:52,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 7.2) internal successors, (144), 21 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:31:52,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1407 transitions. [2024-11-13 13:31:52,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 13:31:52,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:31:52,401 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:31:52,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-13 13:31:52,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:31:52,602 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:31:52,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:31:52,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1922413495, now seen corresponding path program 1 times [2024-11-13 13:31:52,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:31:52,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379330123] [2024-11-13 13:31:52,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:52,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:31:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:53,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:31:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:53,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:31:53,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:31:53,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379330123] [2024-11-13 13:31:53,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379330123] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:31:53,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903429237] [2024-11-13 13:31:53,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:53,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:31:53,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:31:53,820 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:31:53,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 13:31:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:54,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-13 13:31:54,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:31:54,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:31:54,324 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-13 13:31:54,335 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:31:54,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:31:54,379 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 19 treesize of output 1 [2024-11-13 13:31:54,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 13:31:54,504 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 22 treesize of output 10 [2024-11-13 13:31:54,510 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 9 treesize of output 3 [2024-11-13 13:31:54,655 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:31:54,655 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 62 treesize of output 57 [2024-11-13 13:31:54,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:31:54,773 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:31:54,774 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 62 treesize of output 57 [2024-11-13 13:31:54,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:31:54,857 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:31:54,858 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 62 treesize of output 57 [2024-11-13 13:31:54,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:31:54,949 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:31:54,950 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 62 treesize of output 57 [2024-11-13 13:31:54,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:31:54,985 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 31 treesize of output 13 [2024-11-13 13:31:54,993 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 9 treesize of output 3 [2024-11-13 13:31:55,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:31:55,032 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:31:55,222 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1977 (Array Int Int))) (<= 0 (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-13 13:31:55,249 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int))) (<= 0 (+ 20 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1975) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1974) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1974))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1975) .cse1 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-13 13:31:55,267 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1974))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1975) .cse1 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1975) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1974) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2024-11-13 13:31:55,294 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1973 (Array Int Int)) (v_ArrVal_1972 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1972))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1973) .cse0 v_ArrVal_1975) (select (select (store .cse1 .cse0 v_ArrVal_1974) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1977))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1973 (Array Int Int)) (v_ArrVal_1972 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1972))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1974))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1973) .cse3 v_ArrVal_1975) .cse4 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-13 13:31:55,313 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1973 (Array Int Int)) (v_ArrVal_1972 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1972))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1973) .cse1 v_ArrVal_1975) (select (select (store .cse2 .cse1 v_ArrVal_1974) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1977))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1973 (Array Int Int)) (v_ArrVal_1972 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1972))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_1974))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1973) .cse4 v_ArrVal_1975) .cse5 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2024-11-13 13:31:55,392 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1973 (Array Int Int)) (v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1972 (Array Int Int)) (v_ArrVal_1982 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1983))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_1972))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1982) .cse0 v_ArrVal_1973) .cse1 v_ArrVal_1975) (select (select (store .cse2 .cse1 v_ArrVal_1974) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1977))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1973 (Array Int Int)) (v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1972 (Array Int Int)) (v_ArrVal_1982 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1983))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1972))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1974))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1982) .cse5 v_ArrVal_1973) .cse6 v_ArrVal_1975) .cse7 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-13 13:31:55,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903429237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:31:55,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:31:55,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2024-11-13 13:31:55,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361856541] [2024-11-13 13:31:55,397 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:31:55,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-13 13:31:55,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:31:55,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-13 13:31:55,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=654, Unknown=19, NotChecked=342, Total=1122 [2024-11-13 13:31:55,398 INFO L87 Difference]: Start difference. First operand 1224 states and 1407 transitions. Second operand has 25 states, 22 states have (on average 6.954545454545454) internal successors, (153), 24 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:32:00,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:32:00,038 INFO L93 Difference]: Finished difference Result 1226 states and 1414 transitions. [2024-11-13 13:32:00,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 13:32:00,039 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 6.954545454545454) internal successors, (153), 24 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 95 [2024-11-13 13:32:00,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:32:00,041 INFO L225 Difference]: With dead ends: 1226 [2024-11-13 13:32:00,041 INFO L226 Difference]: Without dead ends: 1226 [2024-11-13 13:32:00,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=178, Invalid=1087, Unknown=19, NotChecked=438, Total=1722 [2024-11-13 13:32:00,042 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 1172 mSDsluCounter, 5514 mSDsCounter, 0 mSdLazyCounter, 6466 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 6296 SdHoareTripleChecker+Invalid, 6516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 6466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:32:00,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 6296 Invalid, 6516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 6466 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-13 13:32:00,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2024-11-13 13:32:00,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1208. [2024-11-13 13:32:00,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 820 states have (on average 1.6560975609756097) internal successors, (1358), 1198 states have internal predecessors, (1358), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 13:32:00,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1390 transitions. [2024-11-13 13:32:00,057 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1390 transitions. Word has length 95 [2024-11-13 13:32:00,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:32:00,057 INFO L471 AbstractCegarLoop]: Abstraction has 1208 states and 1390 transitions. [2024-11-13 13:32:00,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 6.954545454545454) internal successors, (153), 24 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:32:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1390 transitions. [2024-11-13 13:32:00,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 13:32:00,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:00,058 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:32:00,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-13 13:32:00,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-13 13:32:00,258 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:32:00,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:00,259 INFO L85 PathProgramCache]: Analyzing trace with hash 242143809, now seen corresponding path program 1 times [2024-11-13 13:32:00,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:32:00,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019774931] [2024-11-13 13:32:00,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:00,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:32:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:01,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:32:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:01,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:32:01,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:32:01,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019774931] [2024-11-13 13:32:01,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019774931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:32:01,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:32:01,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 13:32:01,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354333921] [2024-11-13 13:32:01,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:32:01,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 13:32:01,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:32:01,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 13:32:01,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-13 13:32:01,220 INFO L87 Difference]: Start difference. First operand 1208 states and 1390 transitions. Second operand has 15 states, 14 states have (on average 6.857142857142857) internal successors, (96), 14 states have internal predecessors, (96), 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-13 13:32:04,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:32:04,473 INFO L93 Difference]: Finished difference Result 1231 states and 1419 transitions. [2024-11-13 13:32:04,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 13:32:04,473 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 6.857142857142857) internal successors, (96), 14 states have internal predecessors, (96), 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 98 [2024-11-13 13:32:04,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:32:04,475 INFO L225 Difference]: With dead ends: 1231 [2024-11-13 13:32:04,475 INFO L226 Difference]: Without dead ends: 1231 [2024-11-13 13:32:04,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2024-11-13 13:32:04,476 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 1206 mSDsluCounter, 6597 mSDsCounter, 0 mSdLazyCounter, 5212 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 7379 SdHoareTripleChecker+Invalid, 5259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 5212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:32:04,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1226 Valid, 7379 Invalid, 5259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 5212 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-13 13:32:04,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2024-11-13 13:32:04,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1227. [2024-11-13 13:32:04,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 838 states have (on average 1.6443914081145585) internal successors, (1378), 1216 states have internal predecessors, (1378), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-13 13:32:04,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1411 transitions. [2024-11-13 13:32:04,489 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1411 transitions. Word has length 98 [2024-11-13 13:32:04,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:32:04,490 INFO L471 AbstractCegarLoop]: Abstraction has 1227 states and 1411 transitions. [2024-11-13 13:32:04,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.857142857142857) internal successors, (96), 14 states have internal predecessors, (96), 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-13 13:32:04,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1411 transitions. [2024-11-13 13:32:04,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 13:32:04,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:04,491 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:32:04,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-13 13:32:04,491 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:32:04,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:04,491 INFO L85 PathProgramCache]: Analyzing trace with hash 242143810, now seen corresponding path program 1 times [2024-11-13 13:32:04,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:32:04,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116348329] [2024-11-13 13:32:04,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:04,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:32:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:05,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:32:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:05,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:32:05,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:32:05,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116348329] [2024-11-13 13:32:05,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116348329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:32:05,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:32:05,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-13 13:32:05,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754930710] [2024-11-13 13:32:05,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:32:05,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 13:32:05,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:32:05,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 13:32:05,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-13 13:32:05,657 INFO L87 Difference]: Start difference. First operand 1227 states and 1411 transitions. Second operand has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 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-13 13:32:10,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:32:10,572 INFO L93 Difference]: Finished difference Result 1230 states and 1418 transitions. [2024-11-13 13:32:10,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 13:32:10,573 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 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 98 [2024-11-13 13:32:10,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:32:10,575 INFO L225 Difference]: With dead ends: 1230 [2024-11-13 13:32:10,576 INFO L226 Difference]: Without dead ends: 1230 [2024-11-13 13:32:10,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2024-11-13 13:32:10,577 INFO L432 NwaCegarLoop]: 776 mSDtfsCounter, 1178 mSDsluCounter, 6694 mSDsCounter, 0 mSdLazyCounter, 7718 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 7470 SdHoareTripleChecker+Invalid, 7751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 7718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:32:10,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 7470 Invalid, 7751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 7718 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-13 13:32:10,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2024-11-13 13:32:10,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1227. [2024-11-13 13:32:10,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 838 states have (on average 1.6431980906921242) internal successors, (1377), 1216 states have internal predecessors, (1377), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-13 13:32:10,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1410 transitions. [2024-11-13 13:32:10,591 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1410 transitions. Word has length 98 [2024-11-13 13:32:10,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:32:10,592 INFO L471 AbstractCegarLoop]: Abstraction has 1227 states and 1410 transitions. [2024-11-13 13:32:10,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 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-13 13:32:10,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1410 transitions. [2024-11-13 13:32:10,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 13:32:10,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:10,593 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:32:10,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-13 13:32:10,593 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:32:10,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:10,594 INFO L85 PathProgramCache]: Analyzing trace with hash -58656502, now seen corresponding path program 1 times [2024-11-13 13:32:10,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:32:10,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694308871] [2024-11-13 13:32:10,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:10,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:32:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:11,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:32:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:11,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:32:11,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:32:11,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694308871] [2024-11-13 13:32:11,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694308871] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:32:11,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139163601] [2024-11-13 13:32:11,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:11,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:32:11,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:32:11,477 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:32:11,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 13:32:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:11,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-13 13:32:11,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:32:11,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:32:11,922 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:32:11,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:32:11,940 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 19 treesize of output 1 [2024-11-13 13:32:12,045 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:12,046 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 42 treesize of output 41 [2024-11-13 13:32:12,096 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:12,097 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 42 treesize of output 41 [2024-11-13 13:32:12,147 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:12,147 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 42 treesize of output 41 [2024-11-13 13:32:12,197 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:12,198 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 42 treesize of output 41 [2024-11-13 13:32:12,248 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:12,248 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 42 treesize of output 41 [2024-11-13 13:32:12,261 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 31 treesize of output 13 [2024-11-13 13:32:12,284 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-13 13:32:12,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-13 13:32:12,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:32:12,288 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:32:13,071 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-13 13:32:13,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 794 [2024-11-13 13:32:13,086 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2319 (Array Int Int)) (v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2321 (Array Int Int)) (v_ArrVal_2320 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2325))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2318)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2319)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2320)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2321)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-13 13:32:13,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139163601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:32:13,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:32:13,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 25 [2024-11-13 13:32:13,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612462589] [2024-11-13 13:32:13,089 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:32:13,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-13 13:32:13,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:32:13,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-13 13:32:13,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1046, Unknown=45, NotChecked=68, Total=1332 [2024-11-13 13:32:13,090 INFO L87 Difference]: Start difference. First operand 1227 states and 1410 transitions. Second operand has 26 states, 23 states have (on average 6.739130434782608) internal successors, (155), 25 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:32:18,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:32:18,445 INFO L93 Difference]: Finished difference Result 1229 states and 1417 transitions. [2024-11-13 13:32:18,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 13:32:18,445 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 6.739130434782608) internal successors, (155), 25 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 99 [2024-11-13 13:32:18,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:32:18,447 INFO L225 Difference]: With dead ends: 1229 [2024-11-13 13:32:18,448 INFO L226 Difference]: Without dead ends: 1229 [2024-11-13 13:32:18,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=284, Invalid=1655, Unknown=45, NotChecked=86, Total=2070 [2024-11-13 13:32:18,449 INFO L432 NwaCegarLoop]: 775 mSDtfsCounter, 1159 mSDsluCounter, 12536 mSDsCounter, 0 mSdLazyCounter, 9382 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 13311 SdHoareTripleChecker+Invalid, 9415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 9382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:32:18,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1179 Valid, 13311 Invalid, 9415 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [33 Valid, 9382 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-13 13:32:18,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2024-11-13 13:32:18,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1226. [2024-11-13 13:32:18,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 838 states have (on average 1.6420047732696896) internal successors, (1376), 1215 states have internal predecessors, (1376), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-13 13:32:18,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1409 transitions. [2024-11-13 13:32:18,463 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1409 transitions. Word has length 99 [2024-11-13 13:32:18,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:32:18,464 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1409 transitions. [2024-11-13 13:32:18,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 6.739130434782608) internal successors, (155), 25 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:32:18,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1409 transitions. [2024-11-13 13:32:18,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 13:32:18,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:18,464 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:32:18,487 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 13:32:18,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:32:18,665 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:32:18,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:18,665 INFO L85 PathProgramCache]: Analyzing trace with hash -58656501, now seen corresponding path program 1 times [2024-11-13 13:32:18,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:32:18,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240857289] [2024-11-13 13:32:18,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:18,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:32:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:19,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:32:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:20,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:32:20,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:32:20,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240857289] [2024-11-13 13:32:20,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240857289] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:32:20,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795170461] [2024-11-13 13:32:20,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:20,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:32:20,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:32:20,039 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:32:20,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 13:32:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:20,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-13 13:32:20,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:32:20,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:32:20,504 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:32:20,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:32:20,510 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-13 13:32:20,518 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 19 treesize of output 1 [2024-11-13 13:32:20,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 13:32:20,593 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 22 treesize of output 10 [2024-11-13 13:32:20,598 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 9 treesize of output 3 [2024-11-13 13:32:20,779 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:20,780 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 73 treesize of output 66 [2024-11-13 13:32:20,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:32:20,897 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:20,897 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 73 treesize of output 66 [2024-11-13 13:32:20,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:32:21,019 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:21,019 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 73 treesize of output 66 [2024-11-13 13:32:21,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:32:21,106 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:21,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 73 treesize of output 66 [2024-11-13 13:32:21,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:32:21,222 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:21,222 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 73 treesize of output 66 [2024-11-13 13:32:21,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:32:21,256 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 42 treesize of output 18 [2024-11-13 13:32:21,265 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 9 treesize of output 3 [2024-11-13 13:32:21,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:32:21,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-13 13:32:21,282 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:32:21,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:32:21,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:32:21,287 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:32:21,739 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2512 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2513) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2512) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2515) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)))) (forall ((v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2514 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2512 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)) (forall ((v_ArrVal_2516 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2512))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2513) .cse1 v_ArrVal_2515) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2516) (select (select (store .cse2 .cse1 v_ArrVal_2514) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))))) is different from false [2024-11-13 13:32:22,104 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0))) (forall ((v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2512 (Array Int Int)) (v_ArrVal_2511 (Array Int Int)) (v_ArrVal_2510 (Array Int Int))) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2510))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2511) .cse1 v_ArrVal_2513) (select (select (store .cse2 .cse1 v_ArrVal_2512) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2515))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2514 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2512 (Array Int Int)) (v_ArrVal_2511 (Array Int Int)) (v_ArrVal_2510 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)) (forall ((v_ArrVal_2516 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2510))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2512))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2511) .cse4 v_ArrVal_2513) .cse5 v_ArrVal_2515) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2516) (select (select (store .cse6 .cse5 v_ArrVal_2514) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))))) is different from false [2024-11-13 13:32:28,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:32:28,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 604 treesize of output 622 [2024-11-13 13:32:28,557 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_19 (Array Int Int)) (v_ArrVal_2514 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_26 (Array Int Int)) (v_ArrVal_2516 Int)) (or (= |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_24) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_22))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_prenex_26))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_prenex_23))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_prenex_19))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_20) .cse0 v_prenex_25) .cse1 v_prenex_21) .cse2 v_prenex_18) .cse3 v_prenex_17) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 3) (select (store |c_#length| v_prenex_24 v_ArrVal_2516) (select (select (store .cse5 .cse3 v_ArrVal_2514) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))) (forall ((v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2512 (Array Int Int)) (v_ArrVal_2522 (Array Int Int)) (v_ArrVal_2511 (Array Int Int)) (v_ArrVal_2521 (Array Int Int)) (v_ArrVal_2510 (Array Int Int)) (v_ArrVal_2509 (Array Int Int)) (v_ArrVal_2508 (Array Int Int))) (< 0 (+ (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2521))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_2508))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_2510))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2522) .cse9 v_ArrVal_2509) .cse10 v_ArrVal_2511) .cse11 v_ArrVal_2513) (select (select (store .cse12 .cse11 v_ArrVal_2512) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2515))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))))) is different from false [2024-11-13 13:32:28,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795170461] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:32:28,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:32:28,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 25 [2024-11-13 13:32:28,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981850849] [2024-11-13 13:32:28,565 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:32:28,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-13 13:32:28,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:32:28,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-13 13:32:28,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1008, Unknown=43, NotChecked=204, Total=1406 [2024-11-13 13:32:28,567 INFO L87 Difference]: Start difference. First operand 1226 states and 1409 transitions. Second operand has 26 states, 24 states have (on average 6.208333333333333) internal successors, (149), 24 states have internal predecessors, (149), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:32:49,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:32:49,019 INFO L93 Difference]: Finished difference Result 1228 states and 1416 transitions. [2024-11-13 13:32:49,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 13:32:49,020 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 6.208333333333333) internal successors, (149), 24 states have internal predecessors, (149), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 99 [2024-11-13 13:32:49,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:32:49,023 INFO L225 Difference]: With dead ends: 1228 [2024-11-13 13:32:49,023 INFO L226 Difference]: Without dead ends: 1228 [2024-11-13 13:32:49,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=289, Invalid=2031, Unknown=44, NotChecked=288, Total=2652 [2024-11-13 13:32:49,024 INFO L432 NwaCegarLoop]: 774 mSDtfsCounter, 1164 mSDsluCounter, 8921 mSDsCounter, 0 mSdLazyCounter, 10516 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 9695 SdHoareTripleChecker+Invalid, 10550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 10516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:32:49,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 9695 Invalid, 10550 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [34 Valid, 10516 Invalid, 0 Unknown, 0 Unchecked, 19.0s Time] [2024-11-13 13:32:49,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2024-11-13 13:32:49,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1206. [2024-11-13 13:32:49,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 820 states have (on average 1.6536585365853658) internal successors, (1356), 1196 states have internal predecessors, (1356), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 13:32:49,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1388 transitions. [2024-11-13 13:32:49,043 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1388 transitions. Word has length 99 [2024-11-13 13:32:49,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:32:49,044 INFO L471 AbstractCegarLoop]: Abstraction has 1206 states and 1388 transitions. [2024-11-13 13:32:49,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 6.208333333333333) internal successors, (149), 24 states have internal predecessors, (149), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:32:49,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1388 transitions. [2024-11-13 13:32:49,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 13:32:49,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:49,047 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:32:49,072 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 13:32:49,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-13 13:32:49,248 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:32:49,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:49,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1838213764, now seen corresponding path program 1 times [2024-11-13 13:32:49,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:32:49,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440780189] [2024-11-13 13:32:49,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:49,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:32:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:50,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:32:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:50,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:32:50,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:32:50,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440780189] [2024-11-13 13:32:50,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440780189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:32:50,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:32:50,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-13 13:32:50,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660892295] [2024-11-13 13:32:50,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:32:50,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 13:32:50,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:32:50,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 13:32:50,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-13 13:32:50,168 INFO L87 Difference]: Start difference. First operand 1206 states and 1388 transitions. Second operand has 16 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 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-13 13:32:59,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:32:59,748 INFO L93 Difference]: Finished difference Result 1232 states and 1420 transitions. [2024-11-13 13:32:59,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:32:59,749 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 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 101 [2024-11-13 13:32:59,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:32:59,752 INFO L225 Difference]: With dead ends: 1232 [2024-11-13 13:32:59,752 INFO L226 Difference]: Without dead ends: 1232 [2024-11-13 13:32:59,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2024-11-13 13:32:59,753 INFO L432 NwaCegarLoop]: 781 mSDtfsCounter, 1200 mSDsluCounter, 8167 mSDsCounter, 0 mSdLazyCounter, 6153 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 8948 SdHoareTripleChecker+Invalid, 6183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 6153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:32:59,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1220 Valid, 8948 Invalid, 6183 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 6153 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2024-11-13 13:32:59,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2024-11-13 13:32:59,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1228. [2024-11-13 13:32:59,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 841 states have (on average 1.6397146254458976) internal successors, (1379), 1217 states have internal predecessors, (1379), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-13 13:32:59,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1412 transitions. [2024-11-13 13:32:59,770 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1412 transitions. Word has length 101 [2024-11-13 13:32:59,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:32:59,771 INFO L471 AbstractCegarLoop]: Abstraction has 1228 states and 1412 transitions. [2024-11-13 13:32:59,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 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-13 13:32:59,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1412 transitions. [2024-11-13 13:32:59,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 13:32:59,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:59,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:32:59,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-13 13:32:59,773 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:32:59,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:59,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1838213763, now seen corresponding path program 1 times [2024-11-13 13:32:59,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:32:59,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892526680] [2024-11-13 13:32:59,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:59,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:32:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:33:01,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:33:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:33:01,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:33:01,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:33:01,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892526680] [2024-11-13 13:33:01,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892526680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:33:01,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:33:01,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-13 13:33:01,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357504988] [2024-11-13 13:33:01,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:33:01,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 13:33:01,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:33:01,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 13:33:01,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2024-11-13 13:33:01,400 INFO L87 Difference]: Start difference. First operand 1228 states and 1412 transitions. Second operand has 19 states, 17 states have (on average 5.823529411764706) internal successors, (99), 18 states have internal predecessors, (99), 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-13 13:33:11,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:33:11,515 INFO L93 Difference]: Finished difference Result 1231 states and 1419 transitions. [2024-11-13 13:33:11,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 13:33:11,516 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.823529411764706) internal successors, (99), 18 states have internal predecessors, (99), 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 101 [2024-11-13 13:33:11,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:33:11,520 INFO L225 Difference]: With dead ends: 1231 [2024-11-13 13:33:11,520 INFO L226 Difference]: Without dead ends: 1231 [2024-11-13 13:33:11,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=148, Invalid=782, Unknown=0, NotChecked=0, Total=930 [2024-11-13 13:33:11,521 INFO L432 NwaCegarLoop]: 775 mSDtfsCounter, 1179 mSDsluCounter, 6722 mSDsCounter, 0 mSdLazyCounter, 6430 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1199 SdHoareTripleChecker+Valid, 7497 SdHoareTripleChecker+Invalid, 6463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 6430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:33:11,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1199 Valid, 7497 Invalid, 6463 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [33 Valid, 6430 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2024-11-13 13:33:11,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2024-11-13 13:33:11,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1228. [2024-11-13 13:33:11,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 841 states have (on average 1.638525564803805) internal successors, (1378), 1217 states have internal predecessors, (1378), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-13 13:33:11,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1411 transitions. [2024-11-13 13:33:11,538 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1411 transitions. Word has length 101 [2024-11-13 13:33:11,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:33:11,538 INFO L471 AbstractCegarLoop]: Abstraction has 1228 states and 1411 transitions. [2024-11-13 13:33:11,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.823529411764706) internal successors, (99), 18 states have internal predecessors, (99), 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-13 13:33:11,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1411 transitions. [2024-11-13 13:33:11,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 13:33:11,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:33:11,540 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:33:11,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-13 13:33:11,540 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:33:11,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:33:11,541 INFO L85 PathProgramCache]: Analyzing trace with hash 616467987, now seen corresponding path program 1 times [2024-11-13 13:33:11,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:33:11,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423477966] [2024-11-13 13:33:11,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:33:11,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:33:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:33:12,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:33:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:33:12,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:33:12,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:33:12,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423477966] [2024-11-13 13:33:12,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423477966] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:33:12,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622139191] [2024-11-13 13:33:12,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:33:12,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:33:12,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:33:12,814 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:33:12,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 13:33:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:33:13,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-13 13:33:13,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:33:13,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:33:13,433 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:33:13,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:33:13,443 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 19 treesize of output 1 [2024-11-13 13:33:13,547 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:33:13,548 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 31 treesize of output 32 [2024-11-13 13:33:13,675 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:33:13,675 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 31 treesize of output 32 [2024-11-13 13:33:13,793 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:33:13,793 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 31 treesize of output 32 [2024-11-13 13:33:13,910 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:33:13,910 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 31 treesize of output 32 [2024-11-13 13:33:14,003 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:33:14,003 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 31 treesize of output 32 [2024-11-13 13:33:14,083 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:33:14,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 13:33:14,171 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 31 treesize of output 13 [2024-11-13 13:33:14,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:33:14,176 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:33:14,205 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-13 13:33:14,205 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 21 treesize of output 20 [2024-11-13 13:33:14,297 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2885 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse0)))) is different from false [2024-11-13 13:33:14,413 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2885 (Array Int Int)) (v_ArrVal_2884 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2884))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-13 13:33:14,430 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2885 (Array Int Int)) (v_ArrVal_2884 (Array Int Int)) (v_ArrVal_2883 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2883))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2884)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-13 13:33:14,442 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2885 (Array Int Int)) (v_ArrVal_2884 (Array Int Int)) (v_ArrVal_2883 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2883))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2884)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-13 13:33:14,460 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2885 (Array Int Int)) (v_ArrVal_2884 (Array Int Int)) (v_ArrVal_2883 (Array Int Int)) (v_ArrVal_2882 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2882))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2883)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2884)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-13 13:33:14,474 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2885 (Array Int Int)) (v_ArrVal_2884 (Array Int Int)) (v_ArrVal_2883 (Array Int Int)) (v_ArrVal_2882 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2882))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2883)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2884)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-13 13:33:14,497 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2885 (Array Int Int)) (v_ArrVal_2884 (Array Int Int)) (v_ArrVal_2883 (Array Int Int)) (v_ArrVal_2882 (Array Int Int)) (v_ArrVal_2881 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2881))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2882)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2883)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2884)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-13 13:33:14,512 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2885 (Array Int Int)) (v_ArrVal_2884 (Array Int Int)) (v_ArrVal_2883 (Array Int Int)) (v_ArrVal_2882 (Array Int Int)) (v_ArrVal_2881 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2881))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2882)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2883)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2884)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-13 13:33:14,594 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2888 (Array Int Int)) (v_ArrVal_2885 (Array Int Int)) (v_ArrVal_2884 (Array Int Int)) (v_ArrVal_2883 (Array Int Int)) (v_ArrVal_2882 (Array Int Int)) (v_ArrVal_2881 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2888))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2881)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2882)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2883)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2884)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-13 13:33:14,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622139191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:33:14,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:33:14,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 22 [2024-11-13 13:33:14,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833995309] [2024-11-13 13:33:14,598 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:33:14,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 13:33:14,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:33:14,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 13:33:14,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=523, Unknown=24, NotChecked=486, Total=1122 [2024-11-13 13:33:14,600 INFO L87 Difference]: Start difference. First operand 1228 states and 1411 transitions. Second operand has 23 states, 21 states have (on average 7.095238095238095) internal successors, (149), 22 states have internal predecessors, (149), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:33:24,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:33:24,070 INFO L93 Difference]: Finished difference Result 1230 states and 1418 transitions. [2024-11-13 13:33:24,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 13:33:24,071 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 7.095238095238095) internal successors, (149), 22 states have internal predecessors, (149), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2024-11-13 13:33:24,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:33:24,075 INFO L225 Difference]: With dead ends: 1230 [2024-11-13 13:33:24,075 INFO L226 Difference]: Without dead ends: 1230 [2024-11-13 13:33:24,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=167, Invalid=1035, Unknown=24, NotChecked=666, Total=1892 [2024-11-13 13:33:24,076 INFO L432 NwaCegarLoop]: 781 mSDtfsCounter, 1164 mSDsluCounter, 8180 mSDsCounter, 0 mSdLazyCounter, 6208 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 8961 SdHoareTripleChecker+Invalid, 6243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 6208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:33:24,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 8961 Invalid, 6243 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [35 Valid, 6208 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2024-11-13 13:33:24,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2024-11-13 13:33:24,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1227. [2024-11-13 13:33:24,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 841 states have (on average 1.6373365041617123) internal successors, (1377), 1216 states have internal predecessors, (1377), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-13 13:33:24,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1410 transitions. [2024-11-13 13:33:24,099 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1410 transitions. Word has length 102 [2024-11-13 13:33:24,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:33:24,099 INFO L471 AbstractCegarLoop]: Abstraction has 1227 states and 1410 transitions. [2024-11-13 13:33:24,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 7.095238095238095) internal successors, (149), 22 states have internal predecessors, (149), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:33:24,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1410 transitions. [2024-11-13 13:33:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 13:33:24,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:33:24,100 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:33:24,126 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 13:33:24,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-13 13:33:24,302 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:33:24,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:33:24,303 INFO L85 PathProgramCache]: Analyzing trace with hash 616467988, now seen corresponding path program 1 times [2024-11-13 13:33:24,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:33:24,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624360507] [2024-11-13 13:33:24,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:33:24,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:33:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:33:26,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:33:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:33:26,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:33:26,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:33:26,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624360507] [2024-11-13 13:33:26,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624360507] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:33:26,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391329501] [2024-11-13 13:33:26,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:33:26,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:33:26,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:33:26,332 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:33:26,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 13:33:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:33:26,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-13 13:33:26,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:33:26,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:33:26,946 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-13 13:33:26,966 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:33:26,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:33:26,979 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 19 treesize of output 1 [2024-11-13 13:33:26,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 13:33:27,067 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 22 treesize of output 10 [2024-11-13 13:33:27,072 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 9 treesize of output 3 [2024-11-13 13:33:27,391 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:33:27,391 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 73 treesize of output 66 [2024-11-13 13:33:27,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:33:27,597 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:33:27,597 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 73 treesize of output 66 [2024-11-13 13:33:27,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:33:27,769 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:33:27,770 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 73 treesize of output 66 [2024-11-13 13:33:27,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:33:27,952 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:33:27,952 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 73 treesize of output 66 [2024-11-13 13:33:27,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:33:28,113 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:33:28,113 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 73 treesize of output 66 [2024-11-13 13:33:28,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:33:28,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:33:28,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-13 13:33:28,255 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:33:28,255 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-13 13:33:28,295 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:33:28,295 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 62 treesize of output 57 [2024-11-13 13:33:28,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:33:28,336 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 31 treesize of output 13 [2024-11-13 13:33:28,341 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 9 treesize of output 3 [2024-11-13 13:33:28,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:33:28,348 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:33:29,647 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (or (forall ((v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3088 (Array Int Int)) (v_ArrVal_3089 (Array Int Int)) (v_ArrVal_3090 (Array Int Int)) (v_ArrVal_3093 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3088))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3087) .cse1 v_ArrVal_3089) (select (select (store .cse2 .cse1 v_ArrVal_3090) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3093))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_11| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_11|) 0)))) (forall ((v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3088 (Array Int Int)) (v_ArrVal_3089 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_11| Int) (v_ArrVal_3090 (Array Int Int))) (or (forall ((v_ArrVal_3091 Int) (v_ArrVal_3092 (Array Int Int)) (v_ArrVal_3093 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3088))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_3090))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 44 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3087) .cse4 v_ArrVal_3089) .cse5 v_ArrVal_3093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_11| v_ArrVal_3091) (select (select (store .cse6 .cse5 v_ArrVal_3092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_11|) 0))))))) is different from false [2024-11-13 13:33:29,733 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_3085 (Array Int Int)) (v_ArrVal_3086 (Array Int Int)) (v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3088 (Array Int Int)) (v_ArrVal_3089 (Array Int Int)) (v_ArrVal_3090 (Array Int Int)) (v_ArrVal_3093 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3086))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_3088))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3085) .cse0 v_ArrVal_3087) .cse1 v_ArrVal_3089) (select (select (store .cse2 .cse1 v_ArrVal_3090) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3093))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_11| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_11|) 0)))) (forall ((v_ArrVal_3085 (Array Int Int)) (v_ArrVal_3086 (Array Int Int)) (v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3088 (Array Int Int)) (v_ArrVal_3089 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_11| Int) (v_ArrVal_3090 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_11|) 0)) (forall ((v_ArrVal_3091 Int) (v_ArrVal_3092 (Array Int Int)) (v_ArrVal_3093 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3086))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_3088))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3090))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 44 (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3085) .cse5 v_ArrVal_3087) .cse6 v_ArrVal_3089) .cse7 v_ArrVal_3093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_11| v_ArrVal_3091) (select (select (store .cse8 .cse7 v_ArrVal_3092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-13 13:33:46,134 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_11| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_11|) 0))) (forall ((v_ArrVal_3085 (Array Int Int)) (v_ArrVal_3086 (Array Int Int)) (v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3088 (Array Int Int)) (v_ArrVal_3089 (Array Int Int)) (v_ArrVal_3090 (Array Int Int)) (v_ArrVal_3093 (Array Int Int)) (v_ArrVal_3083 (Array Int Int)) (v_ArrVal_3084 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3084))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_3086))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3088))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3083) .cse0 v_ArrVal_3085) .cse1 v_ArrVal_3087) .cse2 v_ArrVal_3089) (select (select (store .cse3 .cse2 v_ArrVal_3090) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3093))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))) (forall ((v_ArrVal_3085 (Array Int Int)) (v_ArrVal_3086 (Array Int Int)) (v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3088 (Array Int Int)) (v_ArrVal_3089 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_11| Int) (v_ArrVal_3090 (Array Int Int)) (v_ArrVal_3083 (Array Int Int)) (v_ArrVal_3084 (Array Int Int))) (or (forall ((v_ArrVal_3091 Int) (v_ArrVal_3092 (Array Int Int)) (v_ArrVal_3093 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3084))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_3086))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_3088))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_3090))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ 44 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3083) .cse7 v_ArrVal_3085) .cse8 v_ArrVal_3087) .cse9 v_ArrVal_3089) .cse10 v_ArrVal_3093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_11| v_ArrVal_3091) (select (select (store .cse11 .cse10 v_ArrVal_3092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_11|) 0)))))) is different from false [2024-11-13 13:34:08,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:34:08,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1180 treesize of output 1198 [2024-11-13 13:34:13,585 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3085 (Array Int Int)) (v_ArrVal_3086 (Array Int Int)) (v_ArrVal_3098 (Array Int Int)) (v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3099 (Array Int Int)) (v_ArrVal_3088 (Array Int Int)) (v_ArrVal_3089 (Array Int Int)) (v_ArrVal_3090 (Array Int Int)) (v_ArrVal_3093 (Array Int Int)) (v_ArrVal_3083 (Array Int Int)) (v_ArrVal_3084 (Array Int Int))) (< 0 (+ 41 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3098))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_3084))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3086))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3088))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3099) .cse0 v_ArrVal_3083) .cse1 v_ArrVal_3085) .cse2 v_ArrVal_3087) .cse3 v_ArrVal_3089) (select (select (store .cse4 .cse3 v_ArrVal_3090) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3093))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))) (forall ((v_prenex_27 Int) (v_ArrVal_3092 (Array Int Int)) (v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_ArrVal_3091 Int) (v_prenex_30 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_38 (Array Int Int)) (v_prenex_37 (Array Int Int))) (or (= |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_27) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_34))) (let ((.cse9 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse9 v_prenex_31))) (let ((.cse10 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse10 v_prenex_33))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse11 v_prenex_37))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse12 v_prenex_28))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< (+ (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_36) .cse9 v_prenex_30) .cse10 v_prenex_32) .cse11 v_prenex_35) .cse12 v_prenex_38) .cse13 v_prenex_29) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 43) (select (store |c_#length| v_prenex_27 v_ArrVal_3091) (select (select (store .cse14 .cse13 v_ArrVal_3092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))))))))))) is different from false [2024-11-13 13:34:13,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391329501] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:34:13,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:34:13,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 26 [2024-11-13 13:34:13,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346515783] [2024-11-13 13:34:13,623 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:34:13,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-13 13:34:13,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:13,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-13 13:34:13,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1116, Unknown=47, NotChecked=292, Total=1640 [2024-11-13 13:34:13,624 INFO L87 Difference]: Start difference. First operand 1227 states and 1410 transitions. Second operand has 27 states, 25 states have (on average 6.12) internal successors, (153), 25 states have internal predecessors, (153), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:35:10,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:35:10,411 INFO L93 Difference]: Finished difference Result 1229 states and 1417 transitions. [2024-11-13 13:35:10,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 13:35:10,412 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 6.12) internal successors, (153), 25 states have internal predecessors, (153), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2024-11-13 13:35:10,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:35:10,414 INFO L225 Difference]: With dead ends: 1229 [2024-11-13 13:35:10,415 INFO L226 Difference]: Without dead ends: 1229 [2024-11-13 13:35:10,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 48.5s TimeCoverageRelationStatistics Valid=348, Invalid=2273, Unknown=47, NotChecked=412, Total=3080 [2024-11-13 13:35:10,416 INFO L432 NwaCegarLoop]: 773 mSDtfsCounter, 1165 mSDsluCounter, 6574 mSDsCounter, 0 mSdLazyCounter, 7899 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 7347 SdHoareTripleChecker+Invalid, 7934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 7899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:35:10,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 7347 Invalid, 7934 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [35 Valid, 7899 Invalid, 0 Unknown, 0 Unchecked, 53.1s Time] [2024-11-13 13:35:10,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2024-11-13 13:35:10,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1204. [2024-11-13 13:35:10,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 820 states have (on average 1.6512195121951219) internal successors, (1354), 1194 states have internal predecessors, (1354), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 13:35:10,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1386 transitions. [2024-11-13 13:35:10,435 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1386 transitions. Word has length 102 [2024-11-13 13:35:10,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:35:10,435 INFO L471 AbstractCegarLoop]: Abstraction has 1204 states and 1386 transitions. [2024-11-13 13:35:10,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 6.12) internal successors, (153), 25 states have internal predecessors, (153), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:35:10,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1386 transitions. [2024-11-13 13:35:10,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 13:35:10,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:35:10,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 13:35:10,464 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 13:35:10,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-13 13:35:10,637 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:35:10,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:10,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1392582776, now seen corresponding path program 1 times [2024-11-13 13:35:10,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:35:10,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535912570] [2024-11-13 13:35:10,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:10,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:35:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:13,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:35:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:13,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:35:13,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:35:13,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535912570] [2024-11-13 13:35:13,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535912570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:35:13,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:35:13,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-13 13:35:13,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532428192] [2024-11-13 13:35:13,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:35:13,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 13:35:13,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:35:13,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 13:35:13,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-13 13:35:13,736 INFO L87 Difference]: Start difference. First operand 1204 states and 1386 transitions. Second operand has 18 states, 17 states have (on average 6.0) internal successors, (102), 17 states have internal predecessors, (102), 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-13 13:35:52,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:35:52,540 INFO L93 Difference]: Finished difference Result 1255 states and 1445 transitions. [2024-11-13 13:35:52,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 13:35:52,541 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.0) internal successors, (102), 17 states have internal predecessors, (102), 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 104 [2024-11-13 13:35:52,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:35:52,543 INFO L225 Difference]: With dead ends: 1255 [2024-11-13 13:35:52,543 INFO L226 Difference]: Without dead ends: 1255 [2024-11-13 13:35:52,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2024-11-13 13:35:52,544 INFO L432 NwaCegarLoop]: 779 mSDtfsCounter, 1265 mSDsluCounter, 7483 mSDsCounter, 0 mSdLazyCounter, 5707 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1285 SdHoareTripleChecker+Valid, 8262 SdHoareTripleChecker+Invalid, 5742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 5707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:35:52,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1285 Valid, 8262 Invalid, 5742 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [35 Valid, 5707 Invalid, 0 Unknown, 0 Unchecked, 37.3s Time] [2024-11-13 13:35:52,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-13 13:35:52,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1229. [2024-11-13 13:35:52,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 844 states have (on average 1.6350710900473933) internal successors, (1380), 1218 states have internal predecessors, (1380), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-13 13:35:52,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1413 transitions. [2024-11-13 13:35:52,558 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1413 transitions. Word has length 104 [2024-11-13 13:35:52,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:35:52,558 INFO L471 AbstractCegarLoop]: Abstraction has 1229 states and 1413 transitions. [2024-11-13 13:35:52,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.0) internal successors, (102), 17 states have internal predecessors, (102), 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-13 13:35:52,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1413 transitions. [2024-11-13 13:35:52,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 13:35:52,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:35:52,559 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 13:35:52,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-13 13:35:52,560 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:35:52,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:52,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1392582775, now seen corresponding path program 1 times [2024-11-13 13:35:52,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:35:52,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809209436] [2024-11-13 13:35:52,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:52,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:35:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:55,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:35:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:35:55,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:35:55,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809209436] [2024-11-13 13:35:55,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809209436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:35:55,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:35:55,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-13 13:35:55,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788749781] [2024-11-13 13:35:55,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:35:55,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 13:35:55,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:35:55,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 13:35:55,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-11-13 13:35:55,847 INFO L87 Difference]: Start difference. First operand 1229 states and 1413 transitions. Second operand has 17 states, 16 states have (on average 6.375) internal successors, (102), 16 states have internal predecessors, (102), 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-13 13:36:46,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:36:46,523 INFO L93 Difference]: Finished difference Result 1254 states and 1444 transitions. [2024-11-13 13:36:46,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 13:36:46,523 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.375) internal successors, (102), 16 states have internal predecessors, (102), 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 104 [2024-11-13 13:36:46,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:36:46,525 INFO L225 Difference]: With dead ends: 1254 [2024-11-13 13:36:46,525 INFO L226 Difference]: Without dead ends: 1254 [2024-11-13 13:36:46,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2024-11-13 13:36:46,525 INFO L432 NwaCegarLoop]: 783 mSDtfsCounter, 1235 mSDsluCounter, 9362 mSDsCounter, 0 mSdLazyCounter, 7661 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 10145 SdHoareTripleChecker+Invalid, 7710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 7661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:36:46,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 10145 Invalid, 7710 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [49 Valid, 7661 Invalid, 0 Unknown, 0 Unchecked, 49.1s Time] [2024-11-13 13:36:46,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-11-13 13:36:46,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1229. [2024-11-13 13:36:46,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 844 states have (on average 1.6338862559241707) internal successors, (1379), 1218 states have internal predecessors, (1379), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-13 13:36:46,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1412 transitions. [2024-11-13 13:36:46,539 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1412 transitions. Word has length 104 [2024-11-13 13:36:46,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:36:46,539 INFO L471 AbstractCegarLoop]: Abstraction has 1229 states and 1412 transitions. [2024-11-13 13:36:46,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.375) internal successors, (102), 16 states have internal predecessors, (102), 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-13 13:36:46,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1412 transitions. [2024-11-13 13:36:46,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 13:36:46,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:36:46,541 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 13:36:46,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-13 13:36:46,541 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:36:46,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:36:46,541 INFO L85 PathProgramCache]: Analyzing trace with hash -81720431, now seen corresponding path program 1 times [2024-11-13 13:36:46,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:36:46,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601751871] [2024-11-13 13:36:46,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:36:46,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:36:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:36:50,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:36:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:36:50,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:36:50,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:36:50,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601751871] [2024-11-13 13:36:50,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601751871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:36:50,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:36:50,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 13:36:50,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748325955] [2024-11-13 13:36:50,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:36:50,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 13:36:50,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:36:50,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 13:36:50,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-13 13:36:50,593 INFO L87 Difference]: Start difference. First operand 1229 states and 1412 transitions. Second operand has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 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-13 13:37:15,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:37:15,085 INFO L93 Difference]: Finished difference Result 1245 states and 1433 transitions. [2024-11-13 13:37:15,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 13:37:15,086 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 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 105 [2024-11-13 13:37:15,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:37:15,088 INFO L225 Difference]: With dead ends: 1245 [2024-11-13 13:37:15,088 INFO L226 Difference]: Without dead ends: 1245 [2024-11-13 13:37:15,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2024-11-13 13:37:15,089 INFO L432 NwaCegarLoop]: 1128 mSDtfsCounter, 1162 mSDsluCounter, 10200 mSDsCounter, 0 mSdLazyCounter, 3591 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 11328 SdHoareTripleChecker+Invalid, 3612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:37:15,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 11328 Invalid, 3612 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 3591 Invalid, 0 Unknown, 0 Unchecked, 23.7s Time] [2024-11-13 13:37:15,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2024-11-13 13:37:15,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 1228. [2024-11-13 13:37:15,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 844 states have (on average 1.632701421800948) internal successors, (1378), 1217 states have internal predecessors, (1378), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-13 13:37:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1411 transitions. [2024-11-13 13:37:15,107 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1411 transitions. Word has length 105 [2024-11-13 13:37:15,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:37:15,108 INFO L471 AbstractCegarLoop]: Abstraction has 1228 states and 1411 transitions. [2024-11-13 13:37:15,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 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-13 13:37:15,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1411 transitions. [2024-11-13 13:37:15,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 13:37:15,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:37:15,109 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 13:37:15,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-13 13:37:15,109 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:37:15,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:37:15,110 INFO L85 PathProgramCache]: Analyzing trace with hash -81720430, now seen corresponding path program 1 times [2024-11-13 13:37:15,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:37:15,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856023446] [2024-11-13 13:37:15,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:37:15,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:37:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:37:18,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:37:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:37:18,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:37:18,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:37:18,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856023446] [2024-11-13 13:37:18,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856023446] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:37:18,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263888598] [2024-11-13 13:37:18,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:37:18,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:37:18,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:37:18,777 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:37:18,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 13:37:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:37:19,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-13 13:37:19,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:37:19,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:37:20,190 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:37:20,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:37:20,430 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 19 treesize of output 1 [2024-11-13 13:37:20,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 13:37:21,199 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:37:21,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-13 13:37:21,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:37:21,611 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:37:21,611 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 51 treesize of output 48 [2024-11-13 13:37:21,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:37:22,069 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:37:22,069 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 51 treesize of output 48 [2024-11-13 13:37:22,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:37:22,506 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:37:22,506 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 51 treesize of output 48 [2024-11-13 13:37:22,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:37:22,955 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:37:22,955 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 51 treesize of output 48 [2024-11-13 13:37:22,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:37:23,529 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:37:23,529 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 70 treesize of output 65 [2024-11-13 13:37:23,545 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 30 [2024-11-13 13:37:24,367 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:37:24,367 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 70 treesize of output 65 [2024-11-13 13:37:24,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-11-13 13:37:24,491 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 39 treesize of output 21 [2024-11-13 13:37:24,506 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 32 treesize of output 14 [2024-11-13 13:37:24,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:37:24,809 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:37:25,176 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3597 (Array Int Int)) (v_ArrVal_3598 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3598) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3597) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3598 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3598) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2024-11-13 13:37:25,227 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3598 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3598) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3597 (Array Int Int)) (v_ArrVal_3598 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3598) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3597) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-13 13:37:25,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:37:25,329 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 82 treesize of output 86 [2024-11-13 13:37:25,526 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3596 (Array Int Int)) (v_ArrVal_3598 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3596) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3595) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3598) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ |c_ULTIMATE.start_main_#t~mem56#1.offset| 1))) (forall ((v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3597 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3595))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3597)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem56#1.base|)) (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_prenex_40) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2024-11-13 13:37:25,642 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3597 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_3595))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3597)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse2)) (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_prenex_40) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3596 (Array Int Int)) (v_ArrVal_3598 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_3596) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_3595) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3598) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)))))) is different from false [2024-11-13 13:37:25,757 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3597 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3594))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3595))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3597)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) (forall ((v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3596 (Array Int Int)) (v_ArrVal_3598 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3593))) (< (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3594))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store .cse4 .cse5 v_ArrVal_3596) (select (select (store .cse6 .cse5 v_ArrVal_3595) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3598))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)))) (forall ((v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3594))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3593) .cse7 v_prenex_40) (select (select (store .cse8 .cse7 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_41))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-13 13:37:25,843 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3596 (Array Int Int)) (v_ArrVal_3598 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_3593))) (< (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3594))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store .cse0 .cse1 v_ArrVal_3596) (select (select (store .cse2 .cse1 v_ArrVal_3595) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3598))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3594))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_3593) .cse5 v_prenex_40) (select (select (store .cse6 .cse5 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_41))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3597 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3594))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= .cse7 (select (select (let ((.cse8 (store .cse9 .cse7 v_ArrVal_3595))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3597)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) is different from false [2024-11-13 13:37:25,990 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3592))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_3594))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3591) .cse0 v_ArrVal_3593) .cse1 v_prenex_40) (select (select (store .cse2 .cse1 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_41))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3597 (Array Int Int))) (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3592))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3594)))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= .cse5 (select (select (let ((.cse6 (store .cse7 .cse5 v_ArrVal_3595))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3597)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3596 (Array Int Int)) (v_ArrVal_3598 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3592))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3591) .cse13 v_ArrVal_3593))) (< (select (select (let ((.cse11 (store .cse12 .cse13 v_ArrVal_3594))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store .cse9 .cse10 v_ArrVal_3596) (select (select (store .cse11 .cse10 v_ArrVal_3595) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3598))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))))))) is different from false [2024-11-13 13:37:28,075 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3597 (Array Int Int)) (v_ArrVal_3589 (Array Int Int))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3589))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3592)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3594)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3595))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3597)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (<= 0 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3589))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_3592))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_3594))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3590) .cse6 v_ArrVal_3591) .cse7 v_ArrVal_3593) .cse8 v_prenex_40) (select (select (store .cse9 .cse8 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_41))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3596 (Array Int Int)) (v_ArrVal_3598 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3589))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse18 .cse17 v_ArrVal_3592))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3590) .cse17 v_ArrVal_3591) .cse16 v_ArrVal_3593))) (< (select (select (let ((.cse14 (store .cse15 .cse16 v_ArrVal_3594))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store .cse12 .cse13 v_ArrVal_3596) (select (select (store .cse14 .cse13 v_ArrVal_3595) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3598))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)))))))))) is different from false [2024-11-13 13:37:32,733 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3597 (Array Int Int)) (v_ArrVal_3589 (Array Int Int))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_3589))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3592)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3594)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3595))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3597)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (<= 0 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_3589))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_3592))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_3594))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_3590) .cse7 v_ArrVal_3591) .cse8 v_ArrVal_3593) .cse9 v_prenex_40) (select (select (store .cse10 .cse9 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_41))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3596 (Array Int Int)) (v_ArrVal_3598 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_3589))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse19 .cse18 v_ArrVal_3592))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store (store (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_3590) .cse18 v_ArrVal_3591) .cse17 v_ArrVal_3593))) (< (select (select (let ((.cse15 (store .cse16 .cse17 v_ArrVal_3594))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store .cse13 .cse14 v_ArrVal_3596) (select (select (store .cse15 .cse14 v_ArrVal_3595) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3598))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1))))))))))) is different from false [2024-11-13 13:37:37,199 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3596 (Array Int Int)) (v_ArrVal_3587 (Array Int Int)) (v_ArrVal_3598 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3588))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3589))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse8 .cse7 v_ArrVal_3592))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3587) .cse6 v_ArrVal_3590) .cse7 v_ArrVal_3591) .cse5 v_ArrVal_3593))) (< (select (select (let ((.cse2 (store .cse4 .cse5 v_ArrVal_3594))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store .cse0 .cse1 v_ArrVal_3596) (select (select (store .cse2 .cse1 v_ArrVal_3595) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3598))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))))))))) (forall ((v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3597 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int))) (let ((.cse12 (let ((.cse13 (let ((.cse14 (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3588))) (store .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3589)))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3592)))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3594)))) (let ((.cse10 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= .cse10 (select (select (let ((.cse11 (store .cse12 .cse10 v_ArrVal_3595))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3597)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3587 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (<= 0 (select (select (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3588))) (let ((.cse16 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse22 (store .cse23 .cse16 v_ArrVal_3589))) (let ((.cse17 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse21 (store .cse22 .cse17 v_ArrVal_3592))) (let ((.cse18 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse20 (store .cse21 .cse18 v_ArrVal_3594))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3587) .cse16 v_ArrVal_3590) .cse17 v_ArrVal_3591) .cse18 v_ArrVal_3593) .cse19 v_prenex_40) (select (select (store .cse20 .cse19 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_41))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) is different from false [2024-11-13 13:37:42,515 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (and (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3587 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (<= 0 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3588))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_3589))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_3592))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_3594))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3587) .cse1 v_ArrVal_3590) .cse2 v_ArrVal_3591) .cse3 v_ArrVal_3593) .cse4 v_prenex_40) (select (select (store .cse5 .cse4 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_prenex_41))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3596 (Array Int Int)) (v_ArrVal_3587 (Array Int Int)) (v_ArrVal_3598 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3588))) (let ((.cse15 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse17 (store .cse18 .cse15 v_ArrVal_3589))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse13 (store .cse17 .cse16 v_ArrVal_3592))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse10 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3587) .cse15 v_ArrVal_3590) .cse16 v_ArrVal_3591) .cse14 v_ArrVal_3593))) (< (select (select (let ((.cse12 (store .cse13 .cse14 v_ArrVal_3594))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store .cse10 .cse11 v_ArrVal_3596) (select (select (store .cse12 .cse11 v_ArrVal_3595) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3598))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) (+ (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) 1)))))))))) (forall ((v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3597 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int))) (let ((.cse21 (let ((.cse22 (let ((.cse23 (let ((.cse24 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3588))) (store .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3589)))) (store .cse23 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3592)))) (store .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3594)))) (let ((.cse19 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (= .cse19 (select (select (let ((.cse20 (store .cse21 .cse19 v_ArrVal_3595))) (store .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3597)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)))))))) is different from false [2024-11-13 13:37:48,125 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3597 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3603 (Array Int Int))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3603))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3588)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3589)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3592)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3594)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3595))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3597)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3590 (Array Int Int)) (v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3596 (Array Int Int)) (v_ArrVal_3587 (Array Int Int)) (v_ArrVal_3598 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3603 (Array Int Int)) (v_ArrVal_3604 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3603))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_3588))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_3589))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse11 (store .cse16 .cse15 v_ArrVal_3592))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3604) .cse13 v_ArrVal_3587) .cse14 v_ArrVal_3590) .cse15 v_ArrVal_3591) .cse12 v_ArrVal_3593))) (< (select (select (let ((.cse10 (store .cse11 .cse12 v_ArrVal_3594))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store .cse8 .cse9 v_ArrVal_3596) (select (select (store .cse10 .cse9 v_ArrVal_3595) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3598))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1)))))))))))) (forall ((v_ArrVal_3590 (Array Int Int)) (v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3587 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3603 (Array Int Int)) (v_ArrVal_3604 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (let ((.cse28 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3603))) (let ((.cse19 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse27 (store .cse28 .cse19 v_ArrVal_3588))) (let ((.cse20 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse26 (store .cse27 .cse20 v_ArrVal_3589))) (let ((.cse21 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse25 (store .cse26 .cse21 v_ArrVal_3592))) (let ((.cse22 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse24 (store .cse25 .cse22 v_ArrVal_3594))) (let ((.cse23 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3604) .cse19 v_ArrVal_3587) .cse20 v_ArrVal_3590) .cse21 v_ArrVal_3591) .cse22 v_ArrVal_3593) .cse23 v_prenex_40) (select (select (store .cse24 .cse23 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_41))))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-13 13:37:48,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263888598] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:37:48,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:37:48,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 29 [2024-11-13 13:37:48,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970344457] [2024-11-13 13:37:48,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:37:48,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-13 13:37:48,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:37:48,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-13 13:37:48,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=886, Unknown=17, NotChecked=852, Total=1892 [2024-11-13 13:37:48,144 INFO L87 Difference]: Start difference. First operand 1228 states and 1411 transitions. Second operand has 30 states, 27 states have (on average 6.2592592592592595) internal successors, (169), 29 states have internal predecessors, (169), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:39:17,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:39:17,047 INFO L93 Difference]: Finished difference Result 1244 states and 1432 transitions. [2024-11-13 13:39:17,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 13:39:17,048 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 6.2592592592592595) internal successors, (169), 29 states have internal predecessors, (169), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 105 [2024-11-13 13:39:17,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:39:17,050 INFO L225 Difference]: With dead ends: 1244 [2024-11-13 13:39:17,050 INFO L226 Difference]: Without dead ends: 1244 [2024-11-13 13:39:17,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=260, Invalid=1663, Unknown=17, NotChecked=1140, Total=3080 [2024-11-13 13:39:17,052 INFO L432 NwaCegarLoop]: 774 mSDtfsCounter, 1274 mSDsluCounter, 9949 mSDsCounter, 0 mSdLazyCounter, 8462 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 83.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1292 SdHoareTripleChecker+Valid, 10723 SdHoareTripleChecker+Invalid, 8534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 8462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 84.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:39:17,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1292 Valid, 10723 Invalid, 8534 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [72 Valid, 8462 Invalid, 0 Unknown, 0 Unchecked, 84.6s Time] [2024-11-13 13:39:17,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2024-11-13 13:39:17,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1202. [2024-11-13 13:39:17,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 820 states have (on average 1.648780487804878) internal successors, (1352), 1192 states have internal predecessors, (1352), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 13:39:17,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1384 transitions. [2024-11-13 13:39:17,071 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1384 transitions. Word has length 105 [2024-11-13 13:39:17,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:39:17,072 INFO L471 AbstractCegarLoop]: Abstraction has 1202 states and 1384 transitions. [2024-11-13 13:39:17,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 6.2592592592592595) internal successors, (169), 29 states have internal predecessors, (169), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:39:17,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1384 transitions. [2024-11-13 13:39:17,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 13:39:17,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:39:17,073 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 13:39:17,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-13 13:39:17,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-13 13:39:17,274 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:39:17,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:39:17,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1343711344, now seen corresponding path program 1 times [2024-11-13 13:39:17,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:39:17,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107858635] [2024-11-13 13:39:17,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:39:17,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:39:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:39:17,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:39:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:39:17,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:39:17,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:39:17,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107858635] [2024-11-13 13:39:17,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107858635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:39:17,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:39:17,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:39:17,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600939129] [2024-11-13 13:39:17,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:39:17,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:39:17,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:39:17,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:39:17,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:39:17,749 INFO L87 Difference]: Start difference. First operand 1202 states and 1384 transitions. Second operand has 6 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-13 13:39:33,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:39:33,862 INFO L93 Difference]: Finished difference Result 1221 states and 1409 transitions. [2024-11-13 13:39:33,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:39:33,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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 107 [2024-11-13 13:39:33,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:39:33,864 INFO L225 Difference]: With dead ends: 1221 [2024-11-13 13:39:33,864 INFO L226 Difference]: Without dead ends: 1221 [2024-11-13 13:39:33,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:39:33,865 INFO L432 NwaCegarLoop]: 1238 mSDtfsCounter, 28 mSDsluCounter, 3453 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 4691 SdHoareTripleChecker+Invalid, 1582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:39:33,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 4691 Invalid, 1582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 16.0s Time] [2024-11-13 13:39:33,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2024-11-13 13:39:33,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1201. [2024-11-13 13:39:33,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 820 states have (on average 1.647560975609756) internal successors, (1351), 1191 states have internal predecessors, (1351), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 13:39:33,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1383 transitions. [2024-11-13 13:39:33,881 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1383 transitions. Word has length 107 [2024-11-13 13:39:33,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:39:33,882 INFO L471 AbstractCegarLoop]: Abstraction has 1201 states and 1383 transitions. [2024-11-13 13:39:33,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-13 13:39:33,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1383 transitions. [2024-11-13 13:39:33,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 13:39:33,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:39:33,883 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 13:39:33,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-13 13:39:33,883 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:39:33,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:39:33,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1343711343, now seen corresponding path program 1 times [2024-11-13 13:39:33,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:39:33,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208170606] [2024-11-13 13:39:33,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:39:33,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:39:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:39:38,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:39:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:39:39,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:39:39,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:39:39,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208170606] [2024-11-13 13:39:39,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208170606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:39:39,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:39:39,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-13 13:39:39,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491964107] [2024-11-13 13:39:39,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:39:39,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 13:39:39,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:39:39,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 13:39:39,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-13 13:39:39,185 INFO L87 Difference]: Start difference. First operand 1201 states and 1383 transitions. Second operand has 19 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-13 13:40:35,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:40:35,959 INFO L93 Difference]: Finished difference Result 1249 states and 1439 transitions. [2024-11-13 13:40:35,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 13:40:35,960 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 107 [2024-11-13 13:40:35,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:40:35,961 INFO L225 Difference]: With dead ends: 1249 [2024-11-13 13:40:35,961 INFO L226 Difference]: Without dead ends: 1249 [2024-11-13 13:40:35,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2024-11-13 13:40:35,962 INFO L432 NwaCegarLoop]: 783 mSDtfsCounter, 1225 mSDsluCounter, 5532 mSDsCounter, 0 mSdLazyCounter, 5347 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1245 SdHoareTripleChecker+Valid, 6315 SdHoareTripleChecker+Invalid, 5396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 5347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:40:35,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1245 Valid, 6315 Invalid, 5396 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [49 Valid, 5347 Invalid, 0 Unknown, 0 Unchecked, 54.2s Time] [2024-11-13 13:40:35,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2024-11-13 13:40:35,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1229. [2024-11-13 13:40:35,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 847 states have (on average 1.628099173553719) internal successors, (1379), 1218 states have internal predecessors, (1379), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-13 13:40:35,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1412 transitions. [2024-11-13 13:40:35,977 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1412 transitions. Word has length 107 [2024-11-13 13:40:35,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:40:35,977 INFO L471 AbstractCegarLoop]: Abstraction has 1229 states and 1412 transitions. [2024-11-13 13:40:35,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-13 13:40:35,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1412 transitions. [2024-11-13 13:40:35,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 13:40:35,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:40:35,978 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:40:35,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-13 13:40:35,979 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:40:35,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:40:35,979 INFO L85 PathProgramCache]: Analyzing trace with hash 713753320, now seen corresponding path program 1 times [2024-11-13 13:40:35,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:40:35,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968864128] [2024-11-13 13:40:35,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:40:35,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:40:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:40:36,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:40:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:40:36,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:40:36,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:40:36,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968864128] [2024-11-13 13:40:36,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968864128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:40:36,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:40:36,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:40:36,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369280236] [2024-11-13 13:40:36,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:40:36,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:40:36,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:40:36,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:40:36,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:40:36,726 INFO L87 Difference]: Start difference. First operand 1229 states and 1412 transitions. Second operand has 6 states, 5 states have (on average 21.2) internal successors, (106), 5 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-13 13:40:53,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:40:53,660 INFO L93 Difference]: Finished difference Result 1245 states and 1433 transitions. [2024-11-13 13:40:53,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:40:53,661 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.2) internal successors, (106), 5 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 108 [2024-11-13 13:40:53,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:40:53,662 INFO L225 Difference]: With dead ends: 1245 [2024-11-13 13:40:53,662 INFO L226 Difference]: Without dead ends: 1245 [2024-11-13 13:40:53,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:40:53,663 INFO L432 NwaCegarLoop]: 1238 mSDtfsCounter, 27 mSDsluCounter, 3463 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 4701 SdHoareTripleChecker+Invalid, 1568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:40:53,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 4701 Invalid, 1568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 16.7s Time] [2024-11-13 13:40:53,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2024-11-13 13:40:53,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 1200. [2024-11-13 13:40:53,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 820 states have (on average 1.646341463414634) internal successors, (1350), 1190 states have internal predecessors, (1350), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 13:40:53,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1382 transitions. [2024-11-13 13:40:53,680 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1382 transitions. Word has length 108 [2024-11-13 13:40:53,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:40:53,681 INFO L471 AbstractCegarLoop]: Abstraction has 1200 states and 1382 transitions. [2024-11-13 13:40:53,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.2) internal successors, (106), 5 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-13 13:40:53,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1382 transitions. [2024-11-13 13:40:53,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 13:40:53,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:40:53,682 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:40:53,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-13 13:40:53,683 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:40:53,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:40:53,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1294621964, now seen corresponding path program 1 times [2024-11-13 13:40:53,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:40:53,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132656463] [2024-11-13 13:40:53,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:40:53,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:40:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:40:59,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:40:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:00,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:00,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:41:00,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132656463] [2024-11-13 13:41:00,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132656463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:41:00,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:41:00,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-13 13:41:00,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876175297] [2024-11-13 13:41:00,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:41:00,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 13:41:00,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:41:00,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 13:41:00,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2024-11-13 13:41:00,005 INFO L87 Difference]: Start difference. First operand 1200 states and 1382 transitions. Second operand has 22 states, 21 states have (on average 5.0476190476190474) internal successors, (106), 21 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-13 13:42:04,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:42:04,400 INFO L93 Difference]: Finished difference Result 1248 states and 1438 transitions. [2024-11-13 13:42:04,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 13:42:04,401 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.0476190476190474) internal successors, (106), 21 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 108 [2024-11-13 13:42:04,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:42:04,403 INFO L225 Difference]: With dead ends: 1248 [2024-11-13 13:42:04,403 INFO L226 Difference]: Without dead ends: 1248 [2024-11-13 13:42:04,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2024-11-13 13:42:04,404 INFO L432 NwaCegarLoop]: 787 mSDtfsCounter, 2277 mSDsluCounter, 8202 mSDsCounter, 0 mSdLazyCounter, 6245 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2287 SdHoareTripleChecker+Valid, 8989 SdHoareTripleChecker+Invalid, 6308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 6245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 61.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:42:04,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2287 Valid, 8989 Invalid, 6308 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 6245 Invalid, 0 Unknown, 0 Unchecked, 61.9s Time] [2024-11-13 13:42:04,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2024-11-13 13:42:04,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1229. [2024-11-13 13:42:04,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 848 states have (on average 1.6261792452830188) internal successors, (1379), 1218 states have internal predecessors, (1379), 17 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (18), 8 states have call predecessors, (18), 17 states have call successors, (18) [2024-11-13 13:42:04,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1414 transitions. [2024-11-13 13:42:04,421 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1414 transitions. Word has length 108 [2024-11-13 13:42:04,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:42:04,421 INFO L471 AbstractCegarLoop]: Abstraction has 1229 states and 1414 transitions. [2024-11-13 13:42:04,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.0476190476190474) internal successors, (106), 21 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-13 13:42:04,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1414 transitions. [2024-11-13 13:42:04,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 13:42:04,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:42:04,422 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:42:04,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-13 13:42:04,423 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:42:04,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:42:04,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1294621965, now seen corresponding path program 1 times [2024-11-13 13:42:04,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:42:04,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856456954] [2024-11-13 13:42:04,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:42:04,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:42:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:42:11,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:42:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:42:11,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:42:11,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:42:11,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856456954] [2024-11-13 13:42:11,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856456954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:42:11,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:42:11,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-13 13:42:11,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900777831] [2024-11-13 13:42:11,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:42:11,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 13:42:11,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:42:11,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 13:42:11,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-11-13 13:42:11,882 INFO L87 Difference]: Start difference. First operand 1229 states and 1414 transitions. Second operand has 23 states, 22 states have (on average 4.818181818181818) internal successors, (106), 22 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-13 13:43:44,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:43:44,886 INFO L93 Difference]: Finished difference Result 1247 states and 1437 transitions. [2024-11-13 13:43:44,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 13:43:44,886 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.818181818181818) internal successors, (106), 22 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 108 [2024-11-13 13:43:44,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:43:44,888 INFO L225 Difference]: With dead ends: 1247 [2024-11-13 13:43:44,888 INFO L226 Difference]: Without dead ends: 1247 [2024-11-13 13:43:44,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=167, Invalid=1093, Unknown=0, NotChecked=0, Total=1260 [2024-11-13 13:43:44,888 INFO L432 NwaCegarLoop]: 783 mSDtfsCounter, 1299 mSDsluCounter, 9435 mSDsCounter, 0 mSdLazyCounter, 8865 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 87.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1319 SdHoareTripleChecker+Valid, 10218 SdHoareTripleChecker+Invalid, 8926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 8865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 89.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:43:44,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1319 Valid, 10218 Invalid, 8926 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 8865 Invalid, 0 Unknown, 0 Unchecked, 89.3s Time] [2024-11-13 13:43:44,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2024-11-13 13:43:44,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1229. [2024-11-13 13:43:44,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 847 states have (on average 1.6269185360094451) internal successors, (1378), 1218 states have internal predecessors, (1378), 17 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (18), 8 states have call predecessors, (18), 17 states have call successors, (18) [2024-11-13 13:43:44,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1413 transitions. [2024-11-13 13:43:44,905 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1413 transitions. Word has length 108 [2024-11-13 13:43:44,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:43:44,905 INFO L471 AbstractCegarLoop]: Abstraction has 1229 states and 1413 transitions. [2024-11-13 13:43:44,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.818181818181818) internal successors, (106), 22 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-13 13:43:44,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1413 transitions. [2024-11-13 13:43:44,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 13:43:44,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:43:44,906 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:43:44,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-13 13:43:44,907 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-13 13:43:44,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:43:44,907 INFO L85 PathProgramCache]: Analyzing trace with hash 651517077, now seen corresponding path program 1 times [2024-11-13 13:43:44,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:43:44,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959265177] [2024-11-13 13:43:44,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:43:44,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:43:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:43:50,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:43:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:43:51,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:43:51,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:43:51,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959265177] [2024-11-13 13:43:51,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959265177] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:43:51,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868339028] [2024-11-13 13:43:51,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:43:51,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:43:51,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:43:51,627 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:43:51,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b774fa-27c3-4e3e-b448-2c4cbfb8a876/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 13:43:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:43:52,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-13 13:43:52,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:43:52,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:43:53,502 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:43:53,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:43:53,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 13:43:53,895 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 19 treesize of output 1 [2024-11-13 13:43:55,101 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:43:55,102 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 51 treesize of output 48 [2024-11-13 13:43:55,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:43:55,979 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:43:55,980 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 51 treesize of output 48 [2024-11-13 13:43:56,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:43:56,725 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:43:56,726 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 51 treesize of output 48 [2024-11-13 13:43:56,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:43:57,462 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:43:57,462 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 51 treesize of output 48 [2024-11-13 13:43:57,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:43:58,190 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:43:58,190 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 51 treesize of output 48 [2024-11-13 13:43:58,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:43:58,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:43:59,717 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-11-13 13:43:59,718 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 79 treesize of output 45 [2024-11-13 13:43:59,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:44:00,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:44:00,779 INFO L349 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2024-11-13 13:44:00,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 52 [2024-11-13 13:44:00,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:44:01,160 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 9 treesize of output 3 [2024-11-13 13:44:01,677 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-13 13:44:01,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 16 [2024-11-13 13:44:01,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:44:01,696 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:44:01,877 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4283 (Array Int Int))) (or (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) 1) (not (= v_ArrVal_4284 (let ((.cse2 (+ 40 |c_ULTIMATE.start_main_#t~mem58#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base|) .cse2 (select v_ArrVal_4284 .cse2))))))) is different from false [2024-11-13 13:44:01,966 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4284 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4283 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (not (= v_ArrVal_4284 (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select |c_#memory_$Pointer$#1.base| .cse1) .cse2 (select v_ArrVal_4284 .cse2))))) (= (select |c_#valid| (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4284))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1))))) is different from false [2024-11-13 13:44:02,884 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 272 treesize of output 184 [2024-11-13 13:44:05,009 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4278 (Array Int Int)) (v_ArrVal_4279 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4282 (Array Int Int)) (v_ArrVal_4283 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4278)) (.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4279)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse3 (store .cse9 .cse8 (store (select .cse9 .cse8) .cse6 |v_ULTIMATE.start_main_#t~malloc57#1.base_16|)))) (let ((.cse0 (store .cse7 .cse8 v_ArrVal_4282)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4284))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_16|) (not (= v_ArrVal_4284 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4284 .cse5))))) (< .cse6 0))))))) is different from false [2024-11-13 13:44:05,378 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4278 (Array Int Int)) (v_ArrVal_4279 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4282 (Array Int Int)) (v_ArrVal_4283 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| .cse10 v_ArrVal_4278)) (.cse9 (store |c_#memory_$Pointer$#1.base| .cse10 v_ArrVal_4279))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse2 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse3 (store .cse9 .cse8 (store (select .cse9 .cse8) .cse2 |v_ULTIMATE.start_main_#t~malloc57#1.base_16|)))) (let ((.cse0 (store .cse7 .cse8 v_ArrVal_4282)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< .cse2 0) (not (= v_ArrVal_4284 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4284 .cse5))))) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_16| (select (let ((.cse6 (store .cse3 .cse4 v_ArrVal_4284))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) is different from false [2024-11-13 13:44:06,155 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4276 (Array Int Int)) (v_ArrVal_4277 (Array Int Int)) (v_ArrVal_4278 (Array Int Int)) (v_ArrVal_4279 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4282 (Array Int Int)) (v_ArrVal_4283 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4276)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4277) .cse11 v_ArrVal_4278)) (.cse9 (store .cse10 .cse11 v_ArrVal_4279))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store .cse9 .cse8 (store (select .cse9 .cse8) .cse5 |v_ULTIMATE.start_main_#t~malloc57#1.base_16|)))) (let ((.cse4 (store .cse7 .cse8 v_ArrVal_4282)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_#t~malloc57#1.base_16| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< .cse5 0) (not (= (let ((.cse6 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse2 .cse3) .cse6 (select v_ArrVal_4284 .cse6))) v_ArrVal_4284)))))))))) is different from false [2024-11-13 13:44:06,426 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4276 (Array Int Int)) (v_ArrVal_4277 (Array Int Int)) (v_ArrVal_4278 (Array Int Int)) (v_ArrVal_4279 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4282 (Array Int Int)) (v_ArrVal_4283 (Array Int Int))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4276))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4277) .cse11 v_ArrVal_4278)) (.cse9 (store .cse10 .cse11 v_ArrVal_4279))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse0 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse1 (store .cse9 .cse8 (store (select .cse9 .cse8) .cse0 |v_ULTIMATE.start_main_#t~malloc57#1.base_16|)))) (let ((.cse4 (store .cse7 .cse8 v_ArrVal_4282)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (or (< .cse0 0) (not (= v_ArrVal_4284 (let ((.cse3 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse1 .cse2) .cse3 (select v_ArrVal_4284 .cse3))))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_16| (select (let ((.cse6 (store .cse1 .cse2 v_ArrVal_4284))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (select (select (store .cse4 .cse2 v_ArrVal_4283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))))))) is different from false [2024-11-13 13:44:06,977 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4274 (Array Int Int)) (v_ArrVal_4275 (Array Int Int)) (v_ArrVal_4276 (Array Int Int)) (v_ArrVal_4277 (Array Int Int)) (v_ArrVal_4278 (Array Int Int)) (v_ArrVal_4279 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4282 (Array Int Int)) (v_ArrVal_4283 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4275)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse13 .cse12 v_ArrVal_4276))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4274) .cse12 v_ArrVal_4277) .cse11 v_ArrVal_4278)) (.cse9 (store .cse10 .cse11 v_ArrVal_4279))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store .cse9 .cse8 (store (select .cse9 .cse8) .cse6 |v_ULTIMATE.start_main_#t~malloc57#1.base_16|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store .cse7 .cse8 v_ArrVal_4282))) (or (= (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_16|) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4284 .cse5))) v_ArrVal_4284)) (< .cse6 0) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))) is different from false [2024-11-13 13:44:07,270 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4274 (Array Int Int)) (v_ArrVal_4275 (Array Int Int)) (v_ArrVal_4276 (Array Int Int)) (v_ArrVal_4277 (Array Int Int)) (v_ArrVal_4278 (Array Int Int)) (v_ArrVal_4279 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4282 (Array Int Int)) (v_ArrVal_4283 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4275))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse14 .cse13 v_ArrVal_4276))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4274) .cse13 v_ArrVal_4277) .cse11 v_ArrVal_4278)) (.cse9 (store .cse10 .cse11 v_ArrVal_4279))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store .cse9 .cse8 (store (select .cse9 .cse8) .cse6 |v_ULTIMATE.start_main_#t~malloc57#1.base_16|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store .cse7 .cse8 v_ArrVal_4282))) (or (= (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_16|) (not (= v_ArrVal_4284 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4284 .cse5))))) (< .cse6 0) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))) is different from false [2024-11-13 13:44:07,891 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_16| Int) (v_ArrVal_4282 (Array Int Int)) (v_ArrVal_4272 (Array Int Int)) (v_ArrVal_4283 (Array Int Int)) (v_ArrVal_4273 (Array Int Int)) (v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4274 (Array Int Int)) (v_ArrVal_4275 (Array Int Int)) (v_ArrVal_4276 (Array Int Int)) (v_ArrVal_4277 (Array Int Int)) (v_ArrVal_4278 (Array Int Int)) (v_ArrVal_4279 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_4272)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_4275))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse14 .cse13 v_ArrVal_4276))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_4273) .cse12 v_ArrVal_4274) .cse13 v_ArrVal_4277) .cse11 v_ArrVal_4278)) (.cse9 (store .cse10 .cse11 v_ArrVal_4279))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store .cse9 .cse8 (store (select .cse9 .cse8) .cse6 |v_ULTIMATE.start_main_#t~malloc57#1.base_16|)))) (let ((.cse0 (store .cse7 .cse8 v_ArrVal_4282)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4284 .cse4))) v_ArrVal_4284)) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_16| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4284))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< .cse6 0))))))))))))) is different from false [2024-11-13 13:44:08,211 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_16| Int) (v_ArrVal_4282 (Array Int Int)) (v_ArrVal_4272 (Array Int Int)) (v_ArrVal_4283 (Array Int Int)) (v_ArrVal_4273 (Array Int Int)) (v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4274 (Array Int Int)) (v_ArrVal_4275 (Array Int Int)) (v_ArrVal_4276 (Array Int Int)) (v_ArrVal_4277 (Array Int Int)) (v_ArrVal_4278 (Array Int Int)) (v_ArrVal_4279 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4272))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_4275))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse15 .cse14 v_ArrVal_4276))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4273) .cse13 v_ArrVal_4274) .cse14 v_ArrVal_4277) .cse11 v_ArrVal_4278)) (.cse9 (store .cse10 .cse11 v_ArrVal_4279))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse2 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse9 .cse8 (store (select .cse9 .cse8) .cse2 |v_ULTIMATE.start_main_#t~malloc57#1.base_16|)))) (let ((.cse0 (store .cse7 .cse8 v_ArrVal_4282)) (.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< .cse2 0) (= (select (let ((.cse3 (store .cse4 .cse5 v_ArrVal_4284))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse5 v_ArrVal_4283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_16|) (not (= (let ((.cse6 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse4 .cse5) .cse6 (select v_ArrVal_4284 .cse6))) v_ArrVal_4284)))))))))))))))) is different from false [2024-11-13 13:44:09,132 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_16| Int) (v_ArrVal_4282 (Array Int Int)) (v_ArrVal_4272 (Array Int Int)) (v_ArrVal_4283 (Array Int Int)) (v_ArrVal_4273 (Array Int Int)) (v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4274 (Array Int Int)) (v_ArrVal_4275 (Array Int Int)) (v_ArrVal_4276 (Array Int Int)) (v_ArrVal_4277 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4278 (Array Int Int)) (v_ArrVal_4279 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_4289)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse17 .cse12 v_ArrVal_4272))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_4275))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse15 .cse14 v_ArrVal_4276))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_4290) .cse12 v_ArrVal_4273) .cse13 v_ArrVal_4274) .cse14 v_ArrVal_4277) .cse11 v_ArrVal_4278)) (.cse9 (store .cse10 .cse11 v_ArrVal_4279))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store .cse9 .cse8 (store (select .cse9 .cse8) .cse5 |v_ULTIMATE.start_main_#t~malloc57#1.base_16|)))) (let ((.cse0 (store .cse7 .cse8 v_ArrVal_4282)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4284 (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4284 .cse4))))) (< .cse5 0) (= (select (let ((.cse6 (store .cse2 .cse3 v_ArrVal_4284))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_16|))))))))))))))) is different from false [2024-11-13 13:44:09,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868339028] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:44:09,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:44:09,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 32 [2024-11-13 13:44:09,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341791816] [2024-11-13 13:44:09,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:44:09,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-13 13:44:09,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:44:09,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-13 13:44:09,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1132, Unknown=13, NotChecked=858, Total=2162 [2024-11-13 13:44:09,155 INFO L87 Difference]: Start difference. First operand 1229 states and 1413 transitions. Second operand has 33 states, 30 states have (on average 5.833333333333333) internal successors, (175), 32 states have internal predecessors, (175), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)