./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-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_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/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_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/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_cf1c71ae-56d0-40bc-987c-10a664142f0f/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 1c32e831c11e67575bf9fc4420a056c0795572e7218bcd99a0067a1a2caea6f7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:20:05,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:20:05,469 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 14:20:05,475 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:20:05,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:20:05,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:20:05,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:20:05,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:20:05,509 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:20:05,510 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:20:05,510 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:20:05,510 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:20:05,510 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:20:05,510 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:20:05,510 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:20:05,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:20:05,511 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:20:05,511 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:20:05,511 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:20:05,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:20:05,511 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 14:20:05,511 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 14:20:05,512 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 14:20:05,512 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:20:05,512 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:20:05,512 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:20:05,513 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 14:20:05,513 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:20:05,513 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:20:05,513 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:20:05,513 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:20:05,514 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:20:05,514 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:20:05,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:20:05,514 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:20:05,515 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:20:05,515 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:20:05,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:20:05,515 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:20:05,515 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:20:05,515 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:20:05,516 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:20:05,516 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_cf1c71ae-56d0-40bc-987c-10a664142f0f/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 -> 1c32e831c11e67575bf9fc4420a056c0795572e7218bcd99a0067a1a2caea6f7 [2024-11-13 14:20:05,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:20:05,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:20:05,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:20:05,888 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:20:05,888 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:20:05,890 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.i Unable to find full path for "g++" [2024-11-13 14:20:08,098 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:20:08,638 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:20:08,641 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.i [2024-11-13 14:20:08,678 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/data/815c55c08/e06cb6537d29474d96ae9650b7d07fd4/FLAGbb0b012f3 [2024-11-13 14:20:08,698 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/data/815c55c08/e06cb6537d29474d96ae9650b7d07fd4 [2024-11-13 14:20:08,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:20:08,707 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:20:08,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:20:08,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:20:08,717 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:20:08,718 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:20:08" (1/1) ... [2024-11-13 14:20:08,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22984f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:08, skipping insertion in model container [2024-11-13 14:20:08,723 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:20:08" (1/1) ... [2024-11-13 14:20:08,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:20:09,560 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 14:20:09,620 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 14:20:09,631 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 14:20:09,639 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 14:20:09,659 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 14:20:09,702 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 14:20:09,706 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 14:20:09,709 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 14:20:09,717 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 14:20:09,770 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 14:20:09,771 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 14:20:09,777 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 14:20:09,778 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 14:20:09,817 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 14:20:09,817 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 14:20:09,820 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 14:20:09,820 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 14:20:09,837 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 14:20:09,838 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 14:20:09,840 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 14:20:09,841 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 14:20:09,858 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 14:20:09,858 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 14:20:09,861 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 14:20:09,861 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 14:20:09,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:20:09,903 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:20:10,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:20:10,178 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:20:10,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:10 WrapperNode [2024-11-13 14:20:10,181 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:20:10,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:20:10,185 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:20:10,186 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:20:10,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:10" (1/1) ... [2024-11-13 14:20:10,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:10" (1/1) ... [2024-11-13 14:20:10,443 INFO L138 Inliner]: procedures = 177, calls = 507, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3362 [2024-11-13 14:20:10,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:20:10,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:20:10,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:20:10,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:20:10,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:10" (1/1) ... [2024-11-13 14:20:10,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:10" (1/1) ... [2024-11-13 14:20:10,495 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:10" (1/1) ... [2024-11-13 14:20:10,788 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [2, 106, 372]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 86 writes are split as follows [0, 4, 82]. [2024-11-13 14:20:10,792 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:10" (1/1) ... [2024-11-13 14:20:10,792 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:10" (1/1) ... [2024-11-13 14:20:10,912 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:10" (1/1) ... [2024-11-13 14:20:10,975 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:10" (1/1) ... [2024-11-13 14:20:10,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:10" (1/1) ... [2024-11-13 14:20:11,003 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:10" (1/1) ... [2024-11-13 14:20:11,034 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:20:11,036 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:20:11,037 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:20:11,037 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:20:11,038 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:10" (1/1) ... [2024-11-13 14:20:11,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:20:11,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:20:11,090 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:20:11,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:20:11,133 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-11-13 14:20:11,133 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-11-13 14:20:11,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 14:20:11,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 14:20:11,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 14:20:11,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-13 14:20:11,135 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-13 14:20:11,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 14:20:11,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 14:20:11,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 14:20:11,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-13 14:20:11,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-13 14:20:11,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-13 14:20:11,138 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-13 14:20:11,138 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-13 14:20:11,138 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-13 14:20:11,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 14:20:11,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:20:11,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 14:20:11,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 14:20:11,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 14:20:11,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 14:20:11,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 14:20:11,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 14:20:11,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 14:20:11,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 14:20:11,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:20:11,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 14:20:11,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 14:20:11,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:20:11,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:20:11,616 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:20:11,618 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:20:11,702 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-13 14:20:11,749 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-13 14:20:11,789 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-13 14:20:18,841 INFO L? ?]: Removed 2487 outVars from TransFormulas that were not future-live. [2024-11-13 14:20:18,842 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:20:18,931 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:20:18,931 INFO L316 CfgBuilder]: Removed 151 assume(true) statements. [2024-11-13 14:20:18,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:20:18 BoogieIcfgContainer [2024-11-13 14:20:18,932 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:20:18,935 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:20:18,935 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:20:18,941 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:20:18,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:20:08" (1/3) ... [2024-11-13 14:20:18,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8e5394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:20:18, skipping insertion in model container [2024-11-13 14:20:18,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:10" (2/3) ... [2024-11-13 14:20:18,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8e5394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:20:18, skipping insertion in model container [2024-11-13 14:20:18,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:20:18" (3/3) ... [2024-11-13 14:20:18,945 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test10-1.i [2024-11-13 14:20:18,965 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:20:18,967 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test10-1.i that has 6 procedures, 2660 locations, 1 initial locations, 84 loop locations, and 986 error locations. [2024-11-13 14:20:19,093 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:20:19,118 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;@5fa93ecf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:20:19,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 986 error locations. [2024-11-13 14:20:19,134 INFO L276 IsEmpty]: Start isEmpty. Operand has 2650 states, 1652 states have (on average 1.9776029055690072) internal successors, (3267), 2636 states have internal predecessors, (3267), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 14:20:19,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 14:20:19,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:19,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-13 14:20:19,143 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:20:19,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:19,151 INFO L85 PathProgramCache]: Analyzing trace with hash 84472, now seen corresponding path program 1 times [2024-11-13 14:20:19,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:19,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798513903] [2024-11-13 14:20:19,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:19,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:19,475 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 14:20:19,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:19,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798513903] [2024-11-13 14:20:19,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798513903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:19,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:19,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:20:19,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989060852] [2024-11-13 14:20:19,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:19,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:20:19,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:19,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:20:19,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:20:19,547 INFO L87 Difference]: Start difference. First operand has 2650 states, 1652 states have (on average 1.9776029055690072) internal successors, (3267), 2636 states have internal predecessors, (3267), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:22,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:22,446 INFO L93 Difference]: Finished difference Result 3236 states and 3807 transitions. [2024-11-13 14:20:22,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:20:22,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-13 14:20:22,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:22,484 INFO L225 Difference]: With dead ends: 3236 [2024-11-13 14:20:22,484 INFO L226 Difference]: Without dead ends: 3234 [2024-11-13 14:20:22,486 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 14:20:22,490 INFO L432 NwaCegarLoop]: 2197 mSDtfsCounter, 2869 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2879 SdHoareTripleChecker+Valid, 2734 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:22,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2879 Valid, 2734 Invalid, 1304 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-13 14:20:22,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3234 states. [2024-11-13 14:20:22,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3234 to 2887. [2024-11-13 14:20:22,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2887 states, 1917 states have (on average 1.8669796557120502) internal successors, (3579), 2871 states have internal predecessors, (3579), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 14:20:22,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2887 states to 2887 states and 3611 transitions. [2024-11-13 14:20:22,772 INFO L78 Accepts]: Start accepts. Automaton has 2887 states and 3611 transitions. Word has length 3 [2024-11-13 14:20:22,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:22,772 INFO L471 AbstractCegarLoop]: Abstraction has 2887 states and 3611 transitions. [2024-11-13 14:20:22,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:22,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2887 states and 3611 transitions. [2024-11-13 14:20:22,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 14:20:22,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:22,773 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-13 14:20:22,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:20:22,774 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:20:22,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:22,775 INFO L85 PathProgramCache]: Analyzing trace with hash 84473, now seen corresponding path program 1 times [2024-11-13 14:20:22,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:22,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134339467] [2024-11-13 14:20:22,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:22,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:22,961 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 14:20:22,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:22,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134339467] [2024-11-13 14:20:22,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134339467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:22,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:22,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:20:22,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690723286] [2024-11-13 14:20:22,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:22,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:20:22,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:22,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:20:22,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:20:22,967 INFO L87 Difference]: Start difference. First operand 2887 states and 3611 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:26,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:26,362 INFO L93 Difference]: Finished difference Result 4956 states and 6133 transitions. [2024-11-13 14:20:26,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:20:26,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-13 14:20:26,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:26,387 INFO L225 Difference]: With dead ends: 4956 [2024-11-13 14:20:26,388 INFO L226 Difference]: Without dead ends: 4956 [2024-11-13 14:20:26,389 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 14:20:26,390 INFO L432 NwaCegarLoop]: 2399 mSDtfsCounter, 2502 mSDsluCounter, 2108 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2509 SdHoareTripleChecker+Valid, 4507 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:26,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2509 Valid, 4507 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-13 14:20:26,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4956 states. [2024-11-13 14:20:26,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4956 to 4280. [2024-11-13 14:20:26,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4280 states, 3308 states have (on average 1.835247883917775) internal successors, (6071), 4257 states have internal predecessors, (6071), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-13 14:20:26,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 6117 transitions. [2024-11-13 14:20:26,542 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 6117 transitions. Word has length 3 [2024-11-13 14:20:26,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:26,543 INFO L471 AbstractCegarLoop]: Abstraction has 4280 states and 6117 transitions. [2024-11-13 14:20:26,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:26,545 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 6117 transitions. [2024-11-13 14:20:26,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 14:20:26,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:26,545 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:20:26,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:20:26,546 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:20:26,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:26,547 INFO L85 PathProgramCache]: Analyzing trace with hash 327722514, now seen corresponding path program 1 times [2024-11-13 14:20:26,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:26,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550001035] [2024-11-13 14:20:26,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:26,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:26,736 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 14:20:26,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:26,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550001035] [2024-11-13 14:20:26,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550001035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:26,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:26,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:20:26,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241987899] [2024-11-13 14:20:26,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:26,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:20:26,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:26,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:20:26,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:20:26,738 INFO L87 Difference]: Start difference. First operand 4280 states and 6117 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 14:20:29,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:29,070 INFO L93 Difference]: Finished difference Result 5364 states and 7438 transitions. [2024-11-13 14:20:29,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:20:29,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-13 14:20:29,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:29,094 INFO L225 Difference]: With dead ends: 5364 [2024-11-13 14:20:29,094 INFO L226 Difference]: Without dead ends: 5364 [2024-11-13 14:20:29,095 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 14:20:29,096 INFO L432 NwaCegarLoop]: 3528 mSDtfsCounter, 2840 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2850 SdHoareTripleChecker+Valid, 4697 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:29,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2850 Valid, 4697 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-13 14:20:29,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5364 states. [2024-11-13 14:20:29,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5364 to 4188. [2024-11-13 14:20:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4188 states, 3308 states have (on average 1.7868802902055623) internal successors, (5911), 4165 states have internal predecessors, (5911), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-13 14:20:29,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4188 states to 4188 states and 5957 transitions. [2024-11-13 14:20:29,250 INFO L78 Accepts]: Start accepts. Automaton has 4188 states and 5957 transitions. Word has length 8 [2024-11-13 14:20:29,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:29,250 INFO L471 AbstractCegarLoop]: Abstraction has 4188 states and 5957 transitions. [2024-11-13 14:20:29,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 14:20:29,251 INFO L276 IsEmpty]: Start isEmpty. Operand 4188 states and 5957 transitions. [2024-11-13 14:20:29,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 14:20:29,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:29,252 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:20:29,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:20:29,252 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:20:29,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:29,255 INFO L85 PathProgramCache]: Analyzing trace with hash 327722515, now seen corresponding path program 1 times [2024-11-13 14:20:29,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:29,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870104297] [2024-11-13 14:20:29,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:29,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:29,501 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 14:20:29,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:29,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870104297] [2024-11-13 14:20:29,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870104297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:29,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:29,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:20:29,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952776246] [2024-11-13 14:20:29,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:29,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:20:29,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:29,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:20:29,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:20:29,503 INFO L87 Difference]: Start difference. First operand 4188 states and 5957 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 14:20:31,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:31,980 INFO L93 Difference]: Finished difference Result 6923 states and 9906 transitions. [2024-11-13 14:20:31,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:20:31,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-13 14:20:31,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:32,013 INFO L225 Difference]: With dead ends: 6923 [2024-11-13 14:20:32,013 INFO L226 Difference]: Without dead ends: 6923 [2024-11-13 14:20:32,014 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 14:20:32,016 INFO L432 NwaCegarLoop]: 3887 mSDtfsCounter, 2319 mSDsluCounter, 1778 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2323 SdHoareTripleChecker+Valid, 5665 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:32,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2323 Valid, 5665 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-13 14:20:32,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6923 states. [2024-11-13 14:20:32,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6923 to 4720. [2024-11-13 14:20:32,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4720 states, 3850 states have (on average 1.7805194805194806) internal successors, (6855), 4697 states have internal predecessors, (6855), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-13 14:20:32,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4720 states to 4720 states and 6901 transitions. [2024-11-13 14:20:32,155 INFO L78 Accepts]: Start accepts. Automaton has 4720 states and 6901 transitions. Word has length 8 [2024-11-13 14:20:32,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:32,155 INFO L471 AbstractCegarLoop]: Abstraction has 4720 states and 6901 transitions. [2024-11-13 14:20:32,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 14:20:32,156 INFO L276 IsEmpty]: Start isEmpty. Operand 4720 states and 6901 transitions. [2024-11-13 14:20:32,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 14:20:32,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:32,156 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:20:32,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:20:32,157 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr638REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:20:32,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:32,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1052829337, now seen corresponding path program 1 times [2024-11-13 14:20:32,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:32,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326043052] [2024-11-13 14:20:32,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:32,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:32,318 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 14:20:32,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:32,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326043052] [2024-11-13 14:20:32,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326043052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:32,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:32,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:20:32,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242642327] [2024-11-13 14:20:32,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:32,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:20:32,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:32,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:20:32,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:20:32,321 INFO L87 Difference]: Start difference. First operand 4720 states and 6901 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:32,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:32,750 INFO L93 Difference]: Finished difference Result 6557 states and 9343 transitions. [2024-11-13 14:20:32,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:20:32,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-13 14:20:32,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:32,774 INFO L225 Difference]: With dead ends: 6557 [2024-11-13 14:20:32,774 INFO L226 Difference]: Without dead ends: 6557 [2024-11-13 14:20:32,774 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 14:20:32,775 INFO L432 NwaCegarLoop]: 3442 mSDtfsCounter, 1449 mSDsluCounter, 6290 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1455 SdHoareTripleChecker+Valid, 9732 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:32,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1455 Valid, 9732 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:20:32,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6557 states. [2024-11-13 14:20:32,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6557 to 4722. [2024-11-13 14:20:32,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4722 states, 3852 states have (on average 1.7801142263759087) internal successors, (6857), 4699 states have internal predecessors, (6857), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-13 14:20:32,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4722 states to 4722 states and 6903 transitions. [2024-11-13 14:20:32,899 INFO L78 Accepts]: Start accepts. Automaton has 4722 states and 6903 transitions. Word has length 11 [2024-11-13 14:20:32,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:32,900 INFO L471 AbstractCegarLoop]: Abstraction has 4722 states and 6903 transitions. [2024-11-13 14:20:32,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:32,901 INFO L276 IsEmpty]: Start isEmpty. Operand 4722 states and 6903 transitions. [2024-11-13 14:20:32,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 14:20:32,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:32,902 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] [2024-11-13 14:20:32,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:20:32,902 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:20:32,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:32,903 INFO L85 PathProgramCache]: Analyzing trace with hash -286362881, now seen corresponding path program 1 times [2024-11-13 14:20:32,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:32,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453633950] [2024-11-13 14:20:32,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:32,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:33,052 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 14:20:33,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:33,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453633950] [2024-11-13 14:20:33,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453633950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:33,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:33,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:20:33,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143565757] [2024-11-13 14:20:33,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:33,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:20:33,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:33,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:20:33,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:20:33,053 INFO L87 Difference]: Start difference. First operand 4722 states and 6903 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:35,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:35,332 INFO L93 Difference]: Finished difference Result 4797 states and 7009 transitions. [2024-11-13 14:20:35,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:20:35,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-13 14:20:35,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:35,349 INFO L225 Difference]: With dead ends: 4797 [2024-11-13 14:20:35,350 INFO L226 Difference]: Without dead ends: 4797 [2024-11-13 14:20:35,350 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 14:20:35,351 INFO L432 NwaCegarLoop]: 2025 mSDtfsCounter, 3103 mSDsluCounter, 1900 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3113 SdHoareTripleChecker+Valid, 3925 SdHoareTripleChecker+Invalid, 2041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:35,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3113 Valid, 3925 Invalid, 2041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2009 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-13 14:20:35,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4797 states. [2024-11-13 14:20:35,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4797 to 4699. [2024-11-13 14:20:35,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4699 states, 3852 states have (on average 1.7681723779854621) internal successors, (6811), 4676 states have internal predecessors, (6811), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-13 14:20:35,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4699 states to 4699 states and 6857 transitions. [2024-11-13 14:20:35,478 INFO L78 Accepts]: Start accepts. Automaton has 4699 states and 6857 transitions. Word has length 20 [2024-11-13 14:20:35,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:35,479 INFO L471 AbstractCegarLoop]: Abstraction has 4699 states and 6857 transitions. [2024-11-13 14:20:35,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:35,479 INFO L276 IsEmpty]: Start isEmpty. Operand 4699 states and 6857 transitions. [2024-11-13 14:20:35,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 14:20:35,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:35,481 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] [2024-11-13 14:20:35,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 14:20:35,482 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:20:35,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:35,482 INFO L85 PathProgramCache]: Analyzing trace with hash -286362880, now seen corresponding path program 1 times [2024-11-13 14:20:35,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:35,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828339541] [2024-11-13 14:20:35,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:35,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:35,643 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 14:20:35,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:35,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828339541] [2024-11-13 14:20:35,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828339541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:35,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:35,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:20:35,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559947830] [2024-11-13 14:20:35,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:35,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:20:35,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:35,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:20:35,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:20:35,647 INFO L87 Difference]: Start difference. First operand 4699 states and 6857 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:35,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:35,721 INFO L93 Difference]: Finished difference Result 4561 states and 6651 transitions. [2024-11-13 14:20:35,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:20:35,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-13 14:20:35,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:35,750 INFO L225 Difference]: With dead ends: 4561 [2024-11-13 14:20:35,751 INFO L226 Difference]: Without dead ends: 4561 [2024-11-13 14:20:35,751 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 14:20:35,752 INFO L432 NwaCegarLoop]: 2856 mSDtfsCounter, 61 mSDsluCounter, 2803 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 5659 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 14:20:35,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 5659 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:20:35,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4561 states. [2024-11-13 14:20:35,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4561 to 4561. [2024-11-13 14:20:35,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4561 states, 3726 states have (on average 1.7726784755770264) internal successors, (6605), 4538 states have internal predecessors, (6605), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-13 14:20:35,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4561 states to 4561 states and 6651 transitions. [2024-11-13 14:20:35,894 INFO L78 Accepts]: Start accepts. Automaton has 4561 states and 6651 transitions. Word has length 20 [2024-11-13 14:20:35,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:35,895 INFO L471 AbstractCegarLoop]: Abstraction has 4561 states and 6651 transitions. [2024-11-13 14:20:35,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:35,896 INFO L276 IsEmpty]: Start isEmpty. Operand 4561 states and 6651 transitions. [2024-11-13 14:20:35,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 14:20:35,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:35,897 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] [2024-11-13 14:20:35,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 14:20:35,897 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr324REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:20:35,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:35,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1356964703, now seen corresponding path program 1 times [2024-11-13 14:20:35,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:35,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700831468] [2024-11-13 14:20:35,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:35,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:36,084 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 14:20:36,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:36,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700831468] [2024-11-13 14:20:36,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700831468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:36,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:36,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:20:36,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538843123] [2024-11-13 14:20:36,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:36,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:20:36,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:36,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:20:36,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:20:36,088 INFO L87 Difference]: Start difference. First operand 4561 states and 6651 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:36,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:36,450 INFO L93 Difference]: Finished difference Result 6298 states and 8964 transitions. [2024-11-13 14:20:36,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:20:36,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-13 14:20:36,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:36,476 INFO L225 Difference]: With dead ends: 6298 [2024-11-13 14:20:36,476 INFO L226 Difference]: Without dead ends: 6298 [2024-11-13 14:20:36,476 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 14:20:36,477 INFO L432 NwaCegarLoop]: 3138 mSDtfsCounter, 1312 mSDsluCounter, 5861 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1318 SdHoareTripleChecker+Valid, 8999 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:36,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1318 Valid, 8999 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:20:36,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6298 states. [2024-11-13 14:20:36,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6298 to 4571. [2024-11-13 14:20:36,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4571 states, 3736 states have (on average 1.770610278372591) internal successors, (6615), 4548 states have internal predecessors, (6615), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-13 14:20:36,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4571 states to 4571 states and 6661 transitions. [2024-11-13 14:20:36,578 INFO L78 Accepts]: Start accepts. Automaton has 4571 states and 6661 transitions. Word has length 20 [2024-11-13 14:20:36,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:36,579 INFO L471 AbstractCegarLoop]: Abstraction has 4571 states and 6661 transitions. [2024-11-13 14:20:36,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:36,579 INFO L276 IsEmpty]: Start isEmpty. Operand 4571 states and 6661 transitions. [2024-11-13 14:20:36,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 14:20:36,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:36,580 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] [2024-11-13 14:20:36,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 14:20:36,580 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:20:36,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:36,580 INFO L85 PathProgramCache]: Analyzing trace with hash -316663813, now seen corresponding path program 1 times [2024-11-13 14:20:36,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:36,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952106909] [2024-11-13 14:20:36,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:36,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:36,688 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 14:20:36,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:36,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952106909] [2024-11-13 14:20:36,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952106909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:36,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:36,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:20:36,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021985855] [2024-11-13 14:20:36,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:36,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:20:36,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:36,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:20:36,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:20:36,691 INFO L87 Difference]: Start difference. First operand 4571 states and 6661 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:36,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:36,854 INFO L93 Difference]: Finished difference Result 4542 states and 6611 transitions. [2024-11-13 14:20:36,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:20:36,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-13 14:20:36,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:36,870 INFO L225 Difference]: With dead ends: 4542 [2024-11-13 14:20:36,870 INFO L226 Difference]: Without dead ends: 4542 [2024-11-13 14:20:36,870 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 14:20:36,871 INFO L432 NwaCegarLoop]: 2821 mSDtfsCounter, 41 mSDsluCounter, 5614 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 8435 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.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:36,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 8435 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:20:36,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4542 states. [2024-11-13 14:20:36,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4542 to 4536. [2024-11-13 14:20:36,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4536 states, 3708 states have (on average 1.7688781014023733) internal successors, (6559), 4513 states have internal predecessors, (6559), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-13 14:20:36,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4536 states to 4536 states and 6605 transitions. [2024-11-13 14:20:36,985 INFO L78 Accepts]: Start accepts. Automaton has 4536 states and 6605 transitions. Word has length 22 [2024-11-13 14:20:36,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:36,986 INFO L471 AbstractCegarLoop]: Abstraction has 4536 states and 6605 transitions. [2024-11-13 14:20:36,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:36,986 INFO L276 IsEmpty]: Start isEmpty. Operand 4536 states and 6605 transitions. [2024-11-13 14:20:36,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 14:20:36,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:36,988 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:20:36,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 14:20:36,990 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:20:36,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:36,991 INFO L85 PathProgramCache]: Analyzing trace with hash -910003095, now seen corresponding path program 1 times [2024-11-13 14:20:36,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:36,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562966532] [2024-11-13 14:20:36,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:36,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:37,366 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 14:20:37,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:37,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562966532] [2024-11-13 14:20:37,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562966532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:37,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:37,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:20:37,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780663664] [2024-11-13 14:20:37,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:37,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:20:37,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:37,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:20:37,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:20:37,367 INFO L87 Difference]: Start difference. First operand 4536 states and 6605 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:40,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:40,309 INFO L93 Difference]: Finished difference Result 6833 states and 9754 transitions. [2024-11-13 14:20:40,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:20:40,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-13 14:20:40,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:40,329 INFO L225 Difference]: With dead ends: 6833 [2024-11-13 14:20:40,330 INFO L226 Difference]: Without dead ends: 6833 [2024-11-13 14:20:40,330 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 14:20:40,330 INFO L432 NwaCegarLoop]: 2288 mSDtfsCounter, 2318 mSDsluCounter, 3649 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2322 SdHoareTripleChecker+Valid, 5937 SdHoareTripleChecker+Invalid, 2383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:40,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2322 Valid, 5937 Invalid, 2383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-13 14:20:40,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6833 states. [2024-11-13 14:20:40,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6833 to 4532. [2024-11-13 14:20:40,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4532 states, 3708 states have (on average 1.766720604099245) internal successors, (6551), 4509 states have internal predecessors, (6551), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-13 14:20:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4532 states to 4532 states and 6597 transitions. [2024-11-13 14:20:40,420 INFO L78 Accepts]: Start accepts. Automaton has 4532 states and 6597 transitions. Word has length 36 [2024-11-13 14:20:40,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:40,421 INFO L471 AbstractCegarLoop]: Abstraction has 4532 states and 6597 transitions. [2024-11-13 14:20:40,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:40,421 INFO L276 IsEmpty]: Start isEmpty. Operand 4532 states and 6597 transitions. [2024-11-13 14:20:40,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-13 14:20:40,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:40,423 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] [2024-11-13 14:20:40,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 14:20:40,423 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr119REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:20:40,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:40,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2023542917, now seen corresponding path program 1 times [2024-11-13 14:20:40,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:40,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021666680] [2024-11-13 14:20:40,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:40,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:40,638 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 14:20:40,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:40,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021666680] [2024-11-13 14:20:40,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021666680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:40,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:40,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:20:40,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253362078] [2024-11-13 14:20:40,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:40,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:20:40,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:40,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:20:40,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:20:40,640 INFO L87 Difference]: Start difference. First operand 4532 states and 6597 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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 14:20:40,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:40,737 INFO L93 Difference]: Finished difference Result 4532 states and 6589 transitions. [2024-11-13 14:20:40,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:20:40,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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 70 [2024-11-13 14:20:40,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:40,750 INFO L225 Difference]: With dead ends: 4532 [2024-11-13 14:20:40,751 INFO L226 Difference]: Without dead ends: 4532 [2024-11-13 14:20:40,751 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 14:20:40,752 INFO L432 NwaCegarLoop]: 2816 mSDtfsCounter, 21 mSDsluCounter, 5601 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8417 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 14:20:40,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8417 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:20:40,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4532 states. [2024-11-13 14:20:40,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4532 to 4532. [2024-11-13 14:20:40,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4532 states, 3708 states have (on average 1.7645631067961165) internal successors, (6543), 4509 states have internal predecessors, (6543), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-13 14:20:40,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4532 states to 4532 states and 6589 transitions. [2024-11-13 14:20:40,873 INFO L78 Accepts]: Start accepts. Automaton has 4532 states and 6589 transitions. Word has length 70 [2024-11-13 14:20:40,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:40,873 INFO L471 AbstractCegarLoop]: Abstraction has 4532 states and 6589 transitions. [2024-11-13 14:20:40,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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 14:20:40,874 INFO L276 IsEmpty]: Start isEmpty. Operand 4532 states and 6589 transitions. [2024-11-13 14:20:40,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 14:20:40,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:40,875 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] [2024-11-13 14:20:40,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 14:20:40,876 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr119REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:20:40,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:40,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1526786503, now seen corresponding path program 1 times [2024-11-13 14:20:40,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:40,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356202859] [2024-11-13 14:20:40,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:40,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:41,104 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 14:20:41,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:41,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356202859] [2024-11-13 14:20:41,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356202859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:41,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:41,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:20:41,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089195152] [2024-11-13 14:20:41,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:41,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:20:41,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:41,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:20:41,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:20:41,107 INFO L87 Difference]: Start difference. First operand 4532 states and 6589 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 14:20:41,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:41,261 INFO L93 Difference]: Finished difference Result 6036 states and 8768 transitions. [2024-11-13 14:20:41,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:20:41,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2024-11-13 14:20:41,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:41,280 INFO L225 Difference]: With dead ends: 6036 [2024-11-13 14:20:41,280 INFO L226 Difference]: Without dead ends: 6036 [2024-11-13 14:20:41,284 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 14:20:41,284 INFO L432 NwaCegarLoop]: 2831 mSDtfsCounter, 1083 mSDsluCounter, 2769 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 5600 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:41,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 5600 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:20:41,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2024-11-13 14:20:41,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 5385. [2024-11-13 14:20:41,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5385 states, 4557 states have (on average 1.7469826640333552) internal successors, (7961), 5358 states have internal predecessors, (7961), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 14:20:41,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5385 states to 5385 states and 8015 transitions. [2024-11-13 14:20:41,383 INFO L78 Accepts]: Start accepts. Automaton has 5385 states and 8015 transitions. Word has length 78 [2024-11-13 14:20:41,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:41,383 INFO L471 AbstractCegarLoop]: Abstraction has 5385 states and 8015 transitions. [2024-11-13 14:20:41,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 14:20:41,384 INFO L276 IsEmpty]: Start isEmpty. Operand 5385 states and 8015 transitions. [2024-11-13 14:20:41,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-13 14:20:41,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:41,385 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] [2024-11-13 14:20:41,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 14:20:41,385 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:20:41,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:41,388 INFO L85 PathProgramCache]: Analyzing trace with hash 685950740, now seen corresponding path program 1 times [2024-11-13 14:20:41,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:41,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466582182] [2024-11-13 14:20:41,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:41,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:42,259 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 14:20:42,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:42,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466582182] [2024-11-13 14:20:42,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466582182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:42,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:42,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:20:42,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787373397] [2024-11-13 14:20:42,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:42,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:20:42,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:42,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:20:42,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:20:42,263 INFO L87 Difference]: Start difference. First operand 5385 states and 8015 transitions. Second operand has 6 states, 5 states have (on average 16.2) internal successors, (81), 6 states have internal predecessors, (81), 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 14:20:45,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:45,793 INFO L93 Difference]: Finished difference Result 5301 states and 7873 transitions. [2024-11-13 14:20:45,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:20:45,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.2) internal successors, (81), 6 states have internal predecessors, (81), 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 81 [2024-11-13 14:20:45,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:45,808 INFO L225 Difference]: With dead ends: 5301 [2024-11-13 14:20:45,808 INFO L226 Difference]: Without dead ends: 5301 [2024-11-13 14:20:45,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:20:45,811 INFO L432 NwaCegarLoop]: 1549 mSDtfsCounter, 5247 mSDsluCounter, 3020 mSDsCounter, 0 mSdLazyCounter, 3671 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5257 SdHoareTripleChecker+Valid, 4569 SdHoareTripleChecker+Invalid, 3779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 3671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:45,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5257 Valid, 4569 Invalid, 3779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 3671 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-13 14:20:45,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5301 states. [2024-11-13 14:20:45,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5301 to 4759. [2024-11-13 14:20:45,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4759 states, 4015 states have (on average 1.7073474470734744) internal successors, (6855), 4732 states have internal predecessors, (6855), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 14:20:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4759 states to 4759 states and 6909 transitions. [2024-11-13 14:20:45,895 INFO L78 Accepts]: Start accepts. Automaton has 4759 states and 6909 transitions. Word has length 81 [2024-11-13 14:20:45,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:45,896 INFO L471 AbstractCegarLoop]: Abstraction has 4759 states and 6909 transitions. [2024-11-13 14:20:45,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.2) internal successors, (81), 6 states have internal predecessors, (81), 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 14:20:45,897 INFO L276 IsEmpty]: Start isEmpty. Operand 4759 states and 6909 transitions. [2024-11-13 14:20:45,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 14:20:45,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:45,898 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 14:20:45,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 14:20:45,898 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:20:45,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:45,899 INFO L85 PathProgramCache]: Analyzing trace with hash -306097638, now seen corresponding path program 1 times [2024-11-13 14:20:45,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:45,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985654521] [2024-11-13 14:20:45,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:45,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:46,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 14:20:46,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:46,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985654521] [2024-11-13 14:20:46,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985654521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:46,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:46,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:20:46,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558561163] [2024-11-13 14:20:46,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:46,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:20:46,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:46,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:20:46,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:20:46,403 INFO L87 Difference]: Start difference. First operand 4759 states and 6909 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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 14:20:48,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:48,842 INFO L93 Difference]: Finished difference Result 4758 states and 6907 transitions. [2024-11-13 14:20:48,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:20:48,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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 86 [2024-11-13 14:20:48,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:48,855 INFO L225 Difference]: With dead ends: 4758 [2024-11-13 14:20:48,856 INFO L226 Difference]: Without dead ends: 4758 [2024-11-13 14:20:48,856 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 14:20:48,857 INFO L432 NwaCegarLoop]: 2743 mSDtfsCounter, 2 mSDsluCounter, 5744 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8487 SdHoareTripleChecker+Invalid, 2493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:48,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8487 Invalid, 2493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-13 14:20:48,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4758 states. [2024-11-13 14:20:48,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4758 to 4758. [2024-11-13 14:20:48,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4758 states, 4015 states have (on average 1.7068493150684931) internal successors, (6853), 4731 states have internal predecessors, (6853), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 14:20:48,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4758 states to 4758 states and 6907 transitions. [2024-11-13 14:20:48,979 INFO L78 Accepts]: Start accepts. Automaton has 4758 states and 6907 transitions. Word has length 86 [2024-11-13 14:20:48,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:48,980 INFO L471 AbstractCegarLoop]: Abstraction has 4758 states and 6907 transitions. [2024-11-13 14:20:48,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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 14:20:48,980 INFO L276 IsEmpty]: Start isEmpty. Operand 4758 states and 6907 transitions. [2024-11-13 14:20:48,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 14:20:48,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:48,981 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 14:20:48,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 14:20:48,982 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:20:48,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:48,983 INFO L85 PathProgramCache]: Analyzing trace with hash -306097637, now seen corresponding path program 1 times [2024-11-13 14:20:48,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:48,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606647100] [2024-11-13 14:20:48,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:48,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:49,804 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 14:20:49,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:49,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606647100] [2024-11-13 14:20:49,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606647100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:49,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:49,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:20:49,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915612284] [2024-11-13 14:20:49,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:49,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:20:49,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:49,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:20:49,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:20:49,806 INFO L87 Difference]: Start difference. First operand 4758 states and 6907 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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 14:20:52,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:52,446 INFO L93 Difference]: Finished difference Result 4757 states and 6905 transitions. [2024-11-13 14:20:52,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:20:52,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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 86 [2024-11-13 14:20:52,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:52,455 INFO L225 Difference]: With dead ends: 4757 [2024-11-13 14:20:52,455 INFO L226 Difference]: Without dead ends: 4757 [2024-11-13 14:20:52,455 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 14:20:52,456 INFO L432 NwaCegarLoop]: 2743 mSDtfsCounter, 1 mSDsluCounter, 5718 mSDsCounter, 0 mSdLazyCounter, 2515 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 8461 SdHoareTripleChecker+Invalid, 2516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:52,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 8461 Invalid, 2516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2515 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-13 14:20:52,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4757 states. [2024-11-13 14:20:52,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4757 to 4757. [2024-11-13 14:20:52,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4757 states, 4013 states have (on average 1.7072015948168453) internal successors, (6851), 4730 states have internal predecessors, (6851), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 14:20:52,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4757 states to 4757 states and 6905 transitions. [2024-11-13 14:20:52,529 INFO L78 Accepts]: Start accepts. Automaton has 4757 states and 6905 transitions. Word has length 86 [2024-11-13 14:20:52,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:52,529 INFO L471 AbstractCegarLoop]: Abstraction has 4757 states and 6905 transitions. [2024-11-13 14:20:52,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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 14:20:52,529 INFO L276 IsEmpty]: Start isEmpty. Operand 4757 states and 6905 transitions. [2024-11-13 14:20:52,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 14:20:52,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:52,531 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 14:20:52,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 14:20:52,531 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:20:52,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:52,532 INFO L85 PathProgramCache]: Analyzing trace with hash 2134025825, now seen corresponding path program 1 times [2024-11-13 14:20:52,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:52,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829996805] [2024-11-13 14:20:52,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:52,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:52,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:20:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:52,954 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 14:20:52,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:52,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829996805] [2024-11-13 14:20:52,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829996805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:52,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:52,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:20:52,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008952121] [2024-11-13 14:20:52,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:52,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:20:52,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:52,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:20:52,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:20:52,956 INFO L87 Difference]: Start difference. First operand 4757 states and 6905 transitions. Second operand has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 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 14:20:56,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:56,337 INFO L93 Difference]: Finished difference Result 4775 states and 6938 transitions. [2024-11-13 14:20:56,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:20:56,338 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 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 14:20:56,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:56,350 INFO L225 Difference]: With dead ends: 4775 [2024-11-13 14:20:56,350 INFO L226 Difference]: Without dead ends: 4775 [2024-11-13 14:20:56,350 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 14:20:56,353 INFO L432 NwaCegarLoop]: 2707 mSDtfsCounter, 31 mSDsluCounter, 10436 mSDsCounter, 0 mSdLazyCounter, 3293 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 13143 SdHoareTripleChecker+Invalid, 3304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:56,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 13143 Invalid, 3304 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [11 Valid, 3293 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-13 14:20:56,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4775 states. [2024-11-13 14:20:56,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4775 to 4766. [2024-11-13 14:20:56,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4766 states, 4021 states have (on average 1.7065406615269834) internal successors, (6862), 4737 states have internal predecessors, (6862), 27 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (39), 26 states have call predecessors, (39), 27 states have call successors, (39) [2024-11-13 14:20:56,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4766 states to 4766 states and 6928 transitions. [2024-11-13 14:20:56,481 INFO L78 Accepts]: Start accepts. Automaton has 4766 states and 6928 transitions. Word has length 94 [2024-11-13 14:20:56,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:56,481 INFO L471 AbstractCegarLoop]: Abstraction has 4766 states and 6928 transitions. [2024-11-13 14:20:56,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 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 14:20:56,482 INFO L276 IsEmpty]: Start isEmpty. Operand 4766 states and 6928 transitions. [2024-11-13 14:20:56,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 14:20:56,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:56,483 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 14:20:56,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 14:20:56,483 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:20:56,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:56,485 INFO L85 PathProgramCache]: Analyzing trace with hash 2134025826, now seen corresponding path program 1 times [2024-11-13 14:20:56,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:56,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382896652] [2024-11-13 14:20:56,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:56,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:57,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:20:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:57,327 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 14:20:57,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:57,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382896652] [2024-11-13 14:20:57,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382896652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:57,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:57,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:20:57,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844794481] [2024-11-13 14:20:57,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:57,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:20:57,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:57,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:20:57,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:20:57,331 INFO L87 Difference]: Start difference. First operand 4766 states and 6928 transitions. Second operand has 7 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 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 14:21:00,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:21:00,447 INFO L93 Difference]: Finished difference Result 4766 states and 6926 transitions. [2024-11-13 14:21:00,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:21:00,447 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 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 14:21:00,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:21:00,456 INFO L225 Difference]: With dead ends: 4766 [2024-11-13 14:21:00,456 INFO L226 Difference]: Without dead ends: 4766 [2024-11-13 14:21:00,456 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 14:21:00,457 INFO L432 NwaCegarLoop]: 2714 mSDtfsCounter, 26 mSDsluCounter, 10434 mSDsCounter, 0 mSdLazyCounter, 3248 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 13148 SdHoareTripleChecker+Invalid, 3257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 3248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:21:00,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 13148 Invalid, 3257 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9 Valid, 3248 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-13 14:21:00,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4766 states. [2024-11-13 14:21:00,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4766 to 4766. [2024-11-13 14:21:00,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4766 states, 4021 states have (on average 1.706043272817707) internal successors, (6860), 4737 states have internal predecessors, (6860), 27 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (39), 26 states have call predecessors, (39), 27 states have call successors, (39) [2024-11-13 14:21:00,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4766 states to 4766 states and 6926 transitions. [2024-11-13 14:21:00,578 INFO L78 Accepts]: Start accepts. Automaton has 4766 states and 6926 transitions. Word has length 94 [2024-11-13 14:21:00,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:21:00,578 INFO L471 AbstractCegarLoop]: Abstraction has 4766 states and 6926 transitions. [2024-11-13 14:21:00,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 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 14:21:00,579 INFO L276 IsEmpty]: Start isEmpty. Operand 4766 states and 6926 transitions. [2024-11-13 14:21:00,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 14:21:00,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:21:00,580 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 14:21:00,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 14:21:00,580 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:21:00,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:21:00,581 INFO L85 PathProgramCache]: Analyzing trace with hash -682394148, now seen corresponding path program 1 times [2024-11-13 14:21:00,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:21:00,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695932117] [2024-11-13 14:21:00,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:00,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:21:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:01,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:21:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:01,354 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 14:21:01,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:21:01,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695932117] [2024-11-13 14:21:01,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695932117] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:21:01,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129521447] [2024-11-13 14:21:01,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:01,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:21:01,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:21:01,358 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:21:01,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:21:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:01,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-13 14:21:01,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:21:02,033 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:21:02,034 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 14:21:02,062 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 14:21:02,199 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:21:02,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 42 treesize of output 41 [2024-11-13 14:21:02,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 31 treesize of output 13 [2024-11-13 14:21:02,263 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 14:21:02,263 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:21:02,348 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-13 14:21:02,349 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 14:21:02,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129521447] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:21:02,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:21:02,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2024-11-13 14:21:02,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518768854] [2024-11-13 14:21:02,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:21:02,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 14:21:02,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:21:02,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 14:21:02,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=196, Unknown=6, NotChecked=0, Total=240 [2024-11-13 14:21:02,428 INFO L87 Difference]: Start difference. First operand 4766 states and 6926 transitions. Second operand has 15 states, 13 states have (on average 8.384615384615385) internal successors, (109), 13 states have internal predecessors, (109), 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 14:21:09,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:21:09,330 INFO L93 Difference]: Finished difference Result 4765 states and 6924 transitions. [2024-11-13 14:21:09,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 14:21:09,331 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 8.384615384615385) internal successors, (109), 13 states have internal predecessors, (109), 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 95 [2024-11-13 14:21:09,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:21:09,339 INFO L225 Difference]: With dead ends: 4765 [2024-11-13 14:21:09,340 INFO L226 Difference]: Without dead ends: 4765 [2024-11-13 14:21:09,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=453, Unknown=6, NotChecked=0, Total=552 [2024-11-13 14:21:09,341 INFO L432 NwaCegarLoop]: 1892 mSDtfsCounter, 2685 mSDsluCounter, 18707 mSDsCounter, 0 mSdLazyCounter, 9540 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2703 SdHoareTripleChecker+Valid, 20599 SdHoareTripleChecker+Invalid, 9565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 9540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:21:09,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2703 Valid, 20599 Invalid, 9565 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 9540 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-11-13 14:21:09,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4765 states. [2024-11-13 14:21:09,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4765 to 4765. [2024-11-13 14:21:09,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4765 states, 4021 states have (on average 1.7055458841084308) internal successors, (6858), 4736 states have internal predecessors, (6858), 27 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (39), 26 states have call predecessors, (39), 27 states have call successors, (39) [2024-11-13 14:21:09,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4765 states to 4765 states and 6924 transitions. [2024-11-13 14:21:09,423 INFO L78 Accepts]: Start accepts. Automaton has 4765 states and 6924 transitions. Word has length 95 [2024-11-13 14:21:09,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:21:09,423 INFO L471 AbstractCegarLoop]: Abstraction has 4765 states and 6924 transitions. [2024-11-13 14:21:09,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 8.384615384615385) internal successors, (109), 13 states have internal predecessors, (109), 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 14:21:09,424 INFO L276 IsEmpty]: Start isEmpty. Operand 4765 states and 6924 transitions. [2024-11-13 14:21:09,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 14:21:09,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:21:09,426 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 14:21:09,454 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:21:09,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-13 14:21:09,627 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:21:09,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:21:09,627 INFO L85 PathProgramCache]: Analyzing trace with hash -682394147, now seen corresponding path program 1 times [2024-11-13 14:21:09,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:21:09,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970328939] [2024-11-13 14:21:09,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:09,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:21:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:10,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:21:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:10,744 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 14:21:10,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:21:10,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970328939] [2024-11-13 14:21:10,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970328939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:21:10,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441423588] [2024-11-13 14:21:10,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:10,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:21:10,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:21:10,747 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:21:10,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:21:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:11,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 14:21:11,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:21:11,368 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:21:11,368 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 14:21:11,383 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 14:21:11,409 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 14:21:11,415 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 14:21:11,528 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 14:21:11,538 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 14:21:11,719 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:21:11,721 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 14:21:11,734 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 14:21:11,785 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 14:21:11,792 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 14:21:11,799 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 14:21:11,799 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:21:12,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441423588] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:21:12,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:21:12,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2024-11-13 14:21:12,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848971962] [2024-11-13 14:21:12,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:21:12,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 14:21:12,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:21:12,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 14:21:12,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=277, Unknown=9, NotChecked=0, Total=342 [2024-11-13 14:21:12,031 INFO L87 Difference]: Start difference. First operand 4765 states and 6924 transitions. Second operand has 16 states, 13 states have (on average 8.76923076923077) internal successors, (114), 15 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:21:18,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:21:18,574 INFO L93 Difference]: Finished difference Result 4772 states and 6930 transitions. [2024-11-13 14:21:18,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 14:21:18,575 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 8.76923076923077) internal successors, (114), 15 states have internal predecessors, (114), 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 14:21:18,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:21:18,581 INFO L225 Difference]: With dead ends: 4772 [2024-11-13 14:21:18,581 INFO L226 Difference]: Without dead ends: 4772 [2024-11-13 14:21:18,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=451, Unknown=9, NotChecked=0, Total=552 [2024-11-13 14:21:18,582 INFO L432 NwaCegarLoop]: 1897 mSDtfsCounter, 2685 mSDsluCounter, 11635 mSDsCounter, 0 mSdLazyCounter, 8444 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2703 SdHoareTripleChecker+Valid, 13532 SdHoareTripleChecker+Invalid, 8489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 8444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:21:18,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2703 Valid, 13532 Invalid, 8489 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [45 Valid, 8444 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-13 14:21:18,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4772 states. [2024-11-13 14:21:18,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4772 to 4760. [2024-11-13 14:21:18,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4760 states, 4017 states have (on average 1.7057505601194922) internal successors, (6852), 4732 states have internal predecessors, (6852), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 14:21:18,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4760 states to 4760 states and 6906 transitions. [2024-11-13 14:21:18,657 INFO L78 Accepts]: Start accepts. Automaton has 4760 states and 6906 transitions. Word has length 95 [2024-11-13 14:21:18,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:21:18,657 INFO L471 AbstractCegarLoop]: Abstraction has 4760 states and 6906 transitions. [2024-11-13 14:21:18,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 8.76923076923077) internal successors, (114), 15 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:21:18,658 INFO L276 IsEmpty]: Start isEmpty. Operand 4760 states and 6906 transitions. [2024-11-13 14:21:18,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 14:21:18,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:21:18,659 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] [2024-11-13 14:21:18,685 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 14:21:18,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:21:18,860 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:21:18,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:21:18,860 INFO L85 PathProgramCache]: Analyzing trace with hash 658097563, now seen corresponding path program 1 times [2024-11-13 14:21:18,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:21:18,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960043894] [2024-11-13 14:21:18,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:18,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:21:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:19,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:21:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:19,904 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 14:21:19,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:21:19,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960043894] [2024-11-13 14:21:19,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960043894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:21:19,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:21:19,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 14:21:19,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026226482] [2024-11-13 14:21:19,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:21:19,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 14:21:19,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:21:19,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 14:21:19,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:21:19,906 INFO L87 Difference]: Start difference. First operand 4760 states and 6906 transitions. Second operand has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 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 14:21:25,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:21:25,478 INFO L93 Difference]: Finished difference Result 4779 states and 6938 transitions. [2024-11-13 14:21:25,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 14:21:25,479 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 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 97 [2024-11-13 14:21:25,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:21:25,493 INFO L225 Difference]: With dead ends: 4779 [2024-11-13 14:21:25,493 INFO L226 Difference]: Without dead ends: 4779 [2024-11-13 14:21:25,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-13 14:21:25,494 INFO L432 NwaCegarLoop]: 1891 mSDtfsCounter, 2687 mSDsluCounter, 14954 mSDsCounter, 0 mSdLazyCounter, 7854 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2705 SdHoareTripleChecker+Valid, 16845 SdHoareTripleChecker+Invalid, 7877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 7854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:21:25,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2705 Valid, 16845 Invalid, 7877 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 7854 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-13 14:21:25,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4779 states. [2024-11-13 14:21:25,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4779 to 4775. [2024-11-13 14:21:25,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4775 states, 4031 states have (on average 1.7040436616224262) internal successors, (6869), 4745 states have internal predecessors, (6869), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-13 14:21:25,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4775 states to 4775 states and 6925 transitions. [2024-11-13 14:21:25,564 INFO L78 Accepts]: Start accepts. Automaton has 4775 states and 6925 transitions. Word has length 97 [2024-11-13 14:21:25,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:21:25,565 INFO L471 AbstractCegarLoop]: Abstraction has 4775 states and 6925 transitions. [2024-11-13 14:21:25,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 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 14:21:25,565 INFO L276 IsEmpty]: Start isEmpty. Operand 4775 states and 6925 transitions. [2024-11-13 14:21:25,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 14:21:25,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:21:25,567 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] [2024-11-13 14:21:25,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 14:21:25,567 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:21:25,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:21:25,568 INFO L85 PathProgramCache]: Analyzing trace with hash 658097564, now seen corresponding path program 1 times [2024-11-13 14:21:25,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:21:25,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803991880] [2024-11-13 14:21:25,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:25,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:21:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:26,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:21:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:26,652 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 14:21:26,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:21:26,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803991880] [2024-11-13 14:21:26,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803991880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:21:26,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:21:26,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 14:21:26,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272365506] [2024-11-13 14:21:26,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:21:26,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 14:21:26,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:21:26,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 14:21:26,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:21:26,654 INFO L87 Difference]: Start difference. First operand 4775 states and 6925 transitions. Second operand has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 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 14:21:32,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:21:32,947 INFO L93 Difference]: Finished difference Result 4778 states and 6936 transitions. [2024-11-13 14:21:32,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 14:21:32,948 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 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 97 [2024-11-13 14:21:32,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:21:32,957 INFO L225 Difference]: With dead ends: 4778 [2024-11-13 14:21:32,957 INFO L226 Difference]: Without dead ends: 4778 [2024-11-13 14:21:32,957 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 14:21:32,958 INFO L432 NwaCegarLoop]: 1898 mSDtfsCounter, 2683 mSDsluCounter, 9760 mSDsCounter, 0 mSdLazyCounter, 7541 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2701 SdHoareTripleChecker+Valid, 11658 SdHoareTripleChecker+Invalid, 7580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 7541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:21:32,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2701 Valid, 11658 Invalid, 7580 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [39 Valid, 7541 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-13 14:21:32,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4778 states. [2024-11-13 14:21:33,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4778 to 4775. [2024-11-13 14:21:33,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4775 states, 4031 states have (on average 1.7035475068221284) internal successors, (6867), 4745 states have internal predecessors, (6867), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-13 14:21:33,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4775 states to 4775 states and 6923 transitions. [2024-11-13 14:21:33,034 INFO L78 Accepts]: Start accepts. Automaton has 4775 states and 6923 transitions. Word has length 97 [2024-11-13 14:21:33,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:21:33,035 INFO L471 AbstractCegarLoop]: Abstraction has 4775 states and 6923 transitions. [2024-11-13 14:21:33,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 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 14:21:33,035 INFO L276 IsEmpty]: Start isEmpty. Operand 4775 states and 6923 transitions. [2024-11-13 14:21:33,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 14:21:33,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:21:33,036 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 14:21:33,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 14:21:33,037 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:21:33,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:21:33,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1123190720, now seen corresponding path program 1 times [2024-11-13 14:21:33,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:21:33,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022164754] [2024-11-13 14:21:33,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:33,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:21:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:33,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:21:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:33,834 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 14:21:33,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:21:33,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022164754] [2024-11-13 14:21:33,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022164754] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:21:33,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879106957] [2024-11-13 14:21:33,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:33,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:21:33,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:21:33,837 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:21:33,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 14:21:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:34,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-13 14:21:34,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:21:34,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:21:34,475 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:21:34,475 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 14:21:34,487 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 14:21:34,580 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:21:34,580 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 14:21:34,646 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:21:34,646 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 14:21:34,664 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 14:21:34,668 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 14:21:34,668 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:21:34,684 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1104 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1104) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-13 14:21:34,693 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1104 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1104) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-13 14:21:34,752 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-13 14:21:34,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-13 14:21:34,762 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1104 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1107))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1104)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem55#1.base|)) is different from false [2024-11-13 14:21:34,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879106957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:21:34,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:21:34,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 16 [2024-11-13 14:21:34,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689087962] [2024-11-13 14:21:34,765 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:21:34,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 14:21:34,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:21:34,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 14:21:34,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=231, Unknown=3, NotChecked=96, Total=380 [2024-11-13 14:21:34,767 INFO L87 Difference]: Start difference. First operand 4775 states and 6923 transitions. Second operand has 17 states, 15 states have (on average 9.666666666666666) internal successors, (145), 15 states have internal predecessors, (145), 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 14:21:42,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:21:42,147 INFO L93 Difference]: Finished difference Result 4777 states and 6934 transitions. [2024-11-13 14:21:42,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 14:21:42,148 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 9.666666666666666) internal successors, (145), 15 states have internal predecessors, (145), 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 98 [2024-11-13 14:21:42,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:21:42,158 INFO L225 Difference]: With dead ends: 4777 [2024-11-13 14:21:42,158 INFO L226 Difference]: Without dead ends: 4777 [2024-11-13 14:21:42,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=503, Unknown=3, NotChecked=144, Total=756 [2024-11-13 14:21:42,161 INFO L432 NwaCegarLoop]: 1891 mSDtfsCounter, 2647 mSDsluCounter, 22396 mSDsCounter, 0 mSdLazyCounter, 11263 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2665 SdHoareTripleChecker+Valid, 24287 SdHoareTripleChecker+Invalid, 11286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 11263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:21:42,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2665 Valid, 24287 Invalid, 11286 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 11263 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2024-11-13 14:21:42,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4777 states. [2024-11-13 14:21:42,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4777 to 4774. [2024-11-13 14:21:42,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4774 states, 4031 states have (on average 1.7030513520218309) internal successors, (6865), 4744 states have internal predecessors, (6865), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-13 14:21:42,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4774 states to 4774 states and 6921 transitions. [2024-11-13 14:21:42,240 INFO L78 Accepts]: Start accepts. Automaton has 4774 states and 6921 transitions. Word has length 98 [2024-11-13 14:21:42,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:21:42,241 INFO L471 AbstractCegarLoop]: Abstraction has 4774 states and 6921 transitions. [2024-11-13 14:21:42,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 9.666666666666666) internal successors, (145), 15 states have internal predecessors, (145), 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 14:21:42,241 INFO L276 IsEmpty]: Start isEmpty. Operand 4774 states and 6921 transitions. [2024-11-13 14:21:42,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 14:21:42,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:21:42,242 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 14:21:42,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-13 14:21:42,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:21:42,447 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:21:42,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:21:42,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1123190719, now seen corresponding path program 1 times [2024-11-13 14:21:42,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:21:42,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339340686] [2024-11-13 14:21:42,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:42,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:21:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:43,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:21:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:43,607 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 14:21:43,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:21:43,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339340686] [2024-11-13 14:21:43,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339340686] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:21:43,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562199927] [2024-11-13 14:21:43,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:43,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:21:43,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:21:43,611 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:21:43,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 14:21:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:44,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-13 14:21:44,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:21:44,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:21:44,274 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:21:44,274 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 14:21:44,284 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 14:21:44,325 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 14:21:44,334 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 14:21:44,460 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 14:21:44,466 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 14:21:44,626 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:21:44,626 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 14:21:44,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:21:44,743 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:21:44,743 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 14:21:44,748 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 14:21:44,771 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 14:21:44,776 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 14:21:44,799 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 14:21:44,799 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:21:44,895 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1266 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1266) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1267) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1266 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1266) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))))) is different from false [2024-11-13 14:21:45,069 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1273))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1272) .cse0 v_ArrVal_1266) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1267) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1272) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1266) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-13 14:21:45,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562199927] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:21:45,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:21:45,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-11-13 14:21:45,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614336978] [2024-11-13 14:21:45,072 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:21:45,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-13 14:21:45,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:21:45,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-13 14:21:45,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=465, Unknown=12, NotChecked=90, Total=650 [2024-11-13 14:21:45,073 INFO L87 Difference]: Start difference. First operand 4774 states and 6921 transitions. Second operand has 21 states, 18 states have (on average 8.722222222222221) internal successors, (157), 20 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:21:53,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:21:53,878 INFO L93 Difference]: Finished difference Result 4776 states and 6932 transitions. [2024-11-13 14:21:53,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 14:21:53,878 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.722222222222221) internal successors, (157), 20 states have internal predecessors, (157), 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 98 [2024-11-13 14:21:53,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:21:53,887 INFO L225 Difference]: With dead ends: 4776 [2024-11-13 14:21:53,887 INFO L226 Difference]: Without dead ends: 4776 [2024-11-13 14:21:53,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=137, Invalid=729, Unknown=12, NotChecked=114, Total=992 [2024-11-13 14:21:53,889 INFO L432 NwaCegarLoop]: 1896 mSDtfsCounter, 2690 mSDsluCounter, 14612 mSDsCounter, 0 mSdLazyCounter, 10954 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2708 SdHoareTripleChecker+Valid, 16508 SdHoareTripleChecker+Invalid, 11014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 10954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:21:53,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2708 Valid, 16508 Invalid, 11014 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 10954 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2024-11-13 14:21:53,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4776 states. [2024-11-13 14:21:53,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4776 to 4758. [2024-11-13 14:21:53,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4758 states, 4017 states have (on average 1.704754792133433) internal successors, (6848), 4730 states have internal predecessors, (6848), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 14:21:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4758 states to 4758 states and 6902 transitions. [2024-11-13 14:21:53,960 INFO L78 Accepts]: Start accepts. Automaton has 4758 states and 6902 transitions. Word has length 98 [2024-11-13 14:21:53,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:21:53,961 INFO L471 AbstractCegarLoop]: Abstraction has 4758 states and 6902 transitions. [2024-11-13 14:21:53,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.722222222222221) internal successors, (157), 20 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:21:53,961 INFO L276 IsEmpty]: Start isEmpty. Operand 4758 states and 6902 transitions. [2024-11-13 14:21:53,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-13 14:21:53,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:21:53,963 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] [2024-11-13 14:21:53,989 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-13 14:21:54,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:21:54,164 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:21:54,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:21:54,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1140539576, now seen corresponding path program 1 times [2024-11-13 14:21:54,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:21:54,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335123761] [2024-11-13 14:21:54,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:54,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:21:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:54,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:21:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:54,979 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 14:21:54,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:21:54,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335123761] [2024-11-13 14:21:54,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335123761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:21:54,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:21:54,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 14:21:54,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237455809] [2024-11-13 14:21:54,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:21:54,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 14:21:54,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:21:54,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 14:21:54,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-13 14:21:54,981 INFO L87 Difference]: Start difference. First operand 4758 states and 6902 transitions. Second operand has 15 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 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 14:22:01,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:22:01,581 INFO L93 Difference]: Finished difference Result 4783 states and 6940 transitions. [2024-11-13 14:22:01,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 14:22:01,582 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 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 100 [2024-11-13 14:22:01,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:22:01,587 INFO L225 Difference]: With dead ends: 4783 [2024-11-13 14:22:01,587 INFO L226 Difference]: Without dead ends: 4783 [2024-11-13 14:22:01,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-13 14:22:01,588 INFO L432 NwaCegarLoop]: 1890 mSDtfsCounter, 2690 mSDsluCounter, 18649 mSDsCounter, 0 mSdLazyCounter, 9558 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2708 SdHoareTripleChecker+Valid, 20539 SdHoareTripleChecker+Invalid, 9582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 9558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:22:01,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2708 Valid, 20539 Invalid, 9582 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 9558 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-13 14:22:01,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4783 states. [2024-11-13 14:22:01,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4783 to 4779. [2024-11-13 14:22:01,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4779 states, 4037 states have (on average 1.7020064404260589) internal successors, (6871), 4749 states have internal predecessors, (6871), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-13 14:22:01,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4779 states to 4779 states and 6927 transitions. [2024-11-13 14:22:01,649 INFO L78 Accepts]: Start accepts. Automaton has 4779 states and 6927 transitions. Word has length 100 [2024-11-13 14:22:01,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:22:01,649 INFO L471 AbstractCegarLoop]: Abstraction has 4779 states and 6927 transitions. [2024-11-13 14:22:01,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 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 14:22:01,649 INFO L276 IsEmpty]: Start isEmpty. Operand 4779 states and 6927 transitions. [2024-11-13 14:22:01,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-13 14:22:01,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:01,650 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] [2024-11-13 14:22:01,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-13 14:22:01,651 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:22:01,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:01,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1140539575, now seen corresponding path program 1 times [2024-11-13 14:22:01,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:22:01,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774844321] [2024-11-13 14:22:01,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:01,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:22:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:02,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:22:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:02,803 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 14:22:02,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:22:02,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774844321] [2024-11-13 14:22:02,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774844321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:22:02,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:22:02,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 14:22:02,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886821680] [2024-11-13 14:22:02,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:22:02,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 14:22:02,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:22:02,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 14:22:02,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-13 14:22:02,806 INFO L87 Difference]: Start difference. First operand 4779 states and 6927 transitions. Second operand has 13 states, 12 states have (on average 8.166666666666666) internal successors, (98), 12 states have internal predecessors, (98), 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 14:22:10,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:22:10,361 INFO L93 Difference]: Finished difference Result 4782 states and 6938 transitions. [2024-11-13 14:22:10,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:22:10,362 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.166666666666666) internal successors, (98), 12 states have internal predecessors, (98), 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 100 [2024-11-13 14:22:10,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:22:10,366 INFO L225 Difference]: With dead ends: 4782 [2024-11-13 14:22:10,366 INFO L226 Difference]: Without dead ends: 4782 [2024-11-13 14:22:10,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-13 14:22:10,367 INFO L432 NwaCegarLoop]: 1897 mSDtfsCounter, 2684 mSDsluCounter, 13140 mSDsCounter, 0 mSdLazyCounter, 9607 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2702 SdHoareTripleChecker+Valid, 15037 SdHoareTripleChecker+Invalid, 9629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 9607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:22:10,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2702 Valid, 15037 Invalid, 9629 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 9607 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-13 14:22:10,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4782 states. [2024-11-13 14:22:10,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4782 to 4779. [2024-11-13 14:22:10,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4779 states, 4037 states have (on average 1.7015110230369086) internal successors, (6869), 4749 states have internal predecessors, (6869), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-13 14:22:10,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4779 states to 4779 states and 6925 transitions. [2024-11-13 14:22:10,433 INFO L78 Accepts]: Start accepts. Automaton has 4779 states and 6925 transitions. Word has length 100 [2024-11-13 14:22:10,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:22:10,433 INFO L471 AbstractCegarLoop]: Abstraction has 4779 states and 6925 transitions. [2024-11-13 14:22:10,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.166666666666666) internal successors, (98), 12 states have internal predecessors, (98), 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 14:22:10,433 INFO L276 IsEmpty]: Start isEmpty. Operand 4779 states and 6925 transitions. [2024-11-13 14:22:10,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 14:22:10,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:10,435 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 14:22:10,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 14:22:10,436 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:22:10,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:10,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1116130947, now seen corresponding path program 1 times [2024-11-13 14:22:10,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:22:10,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50834484] [2024-11-13 14:22:10,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:10,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:22:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:11,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:22:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:11,284 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 14:22:11,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:22:11,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50834484] [2024-11-13 14:22:11,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50834484] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:22:11,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196072462] [2024-11-13 14:22:11,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:11,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:22:11,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:22:11,287 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:22:11,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 14:22:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:11,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 14:22:11,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:22:11,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:22:11,947 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:22:11,947 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 14:22:11,958 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 14:22:12,060 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:22:12,061 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 14:22:12,130 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:22:12,131 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 14:22:12,210 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:22:12,211 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 14:22:12,227 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 14:22:12,232 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 14:22:12,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:22:12,253 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1585 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_1585) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-13 14:22:16,611 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-13 14:22:16,612 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 14:22:16,624 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1588 (Array Int Int)) (v_ArrVal_1585 (Array Int Int)) (v_ArrVal_1584 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1588))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1584)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1585)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem55#1.base|)) is different from false [2024-11-13 14:22:16,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196072462] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:22:16,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:22:16,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 18 [2024-11-13 14:22:16,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491305677] [2024-11-13 14:22:16,628 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:22:16,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 14:22:16,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:22:16,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 14:22:16,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=366, Unknown=29, NotChecked=82, Total=552 [2024-11-13 14:22:16,629 INFO L87 Difference]: Start difference. First operand 4779 states and 6925 transitions. Second operand has 19 states, 17 states have (on average 8.823529411764707) internal successors, (150), 17 states have internal predecessors, (150), 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 14:22:25,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:22:25,373 INFO L93 Difference]: Finished difference Result 4781 states and 6936 transitions. [2024-11-13 14:22:25,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 14:22:25,373 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.823529411764707) internal successors, (150), 17 states have internal predecessors, (150), 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 101 [2024-11-13 14:22:25,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:22:25,378 INFO L225 Difference]: With dead ends: 4781 [2024-11-13 14:22:25,378 INFO L226 Difference]: Without dead ends: 4781 [2024-11-13 14:22:25,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=152, Invalid=753, Unknown=33, NotChecked=118, Total=1056 [2024-11-13 14:22:25,379 INFO L432 NwaCegarLoop]: 1890 mSDtfsCounter, 2666 mSDsluCounter, 16791 mSDsCounter, 0 mSdLazyCounter, 8730 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2684 SdHoareTripleChecker+Valid, 18681 SdHoareTripleChecker+Invalid, 8770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 8730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:22:25,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2684 Valid, 18681 Invalid, 8770 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [40 Valid, 8730 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2024-11-13 14:22:25,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4781 states. [2024-11-13 14:22:25,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4781 to 4778. [2024-11-13 14:22:25,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4778 states, 4037 states have (on average 1.7010156056477583) internal successors, (6867), 4748 states have internal predecessors, (6867), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-13 14:22:25,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4778 states to 4778 states and 6923 transitions. [2024-11-13 14:22:25,447 INFO L78 Accepts]: Start accepts. Automaton has 4778 states and 6923 transitions. Word has length 101 [2024-11-13 14:22:25,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:22:25,448 INFO L471 AbstractCegarLoop]: Abstraction has 4778 states and 6923 transitions. [2024-11-13 14:22:25,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.823529411764707) internal successors, (150), 17 states have internal predecessors, (150), 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 14:22:25,448 INFO L276 IsEmpty]: Start isEmpty. Operand 4778 states and 6923 transitions. [2024-11-13 14:22:25,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 14:22:25,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:25,450 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 14:22:25,476 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 14:22:25,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:22:25,654 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:22:25,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:25,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1116130948, now seen corresponding path program 1 times [2024-11-13 14:22:25,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:22:25,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448815755] [2024-11-13 14:22:25,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:25,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:22:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:26,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:22:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:27,065 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 14:22:27,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:22:27,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448815755] [2024-11-13 14:22:27,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448815755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:22:27,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375819214] [2024-11-13 14:22:27,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:27,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:22:27,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:22:27,069 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:22:27,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 14:22:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:27,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-13 14:22:27,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:22:27,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:22:28,075 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:22:28,076 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 14:22:28,132 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 14:22:28,143 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 14:22:28,364 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:22:28,364 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 14:22:28,369 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 14:22:28,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:22:28,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 41 [2024-11-13 14:22:28,493 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 39 treesize of output 20 [2024-11-13 14:22:28,824 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-13 14:22:28,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 66 [2024-11-13 14:22:28,841 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 39 treesize of output 20 [2024-11-13 14:22:28,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 14:22:28,940 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 14:22:28,947 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 14:22:28,995 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 14:22:28,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:22:29,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:22:29,347 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 112 treesize of output 116 [2024-11-13 14:22:29,527 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base|) (+ 16 |c_ULTIMATE.start_main_#t~mem57#1.offset|) |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (or (forall ((v_ArrVal_1761 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem57#1.base| (select (select (store .cse0 .cse1 v_ArrVal_1761) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1758 (Array Int Int))) (< (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0)) (forall ((v_ArrVal_1758 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1758))) (or (< (+ (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0) (forall ((v_prenex_6 (Array Int Int))) (<= 0 (+ (select (select (store .cse3 .cse1 v_prenex_6) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))))) (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1760 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1758))) (or (< (+ (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0) (< (select (select (store .cse4 .cse1 v_ArrVal_1760) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ 9 |c_ULTIMATE.start_main_#t~mem57#1.offset|))))) (forall ((v_ArrVal_1758 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1758))) (or (< (+ (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0) (< 0 (+ (select (select (store .cse5 .cse1 v_prenex_6) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 9)))))))) is different from false [2024-11-13 14:22:29,708 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse3 (select |c_#memory_$Pointer$#2.base| .cse2))) (and (forall ((|v_ULTIMATE.start_main_#t~mem57#1.offset_17| Int)) (or (< |v_ULTIMATE.start_main_#t~mem57#1.offset_17| .cse0) (forall ((v_ArrVal_1758 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_1758))) (or (< 0 (+ 9 (select (select (store .cse1 (select (select (store |c_#memory_$Pointer$#2.base| .cse2 (store .cse3 (+ 16 |v_ULTIMATE.start_main_#t~mem57#1.offset_17|) |c_ULTIMATE.start_main_~user~0#1.base|)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_6) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) 0)))))) (forall ((|v_ULTIMATE.start_main_#t~mem57#1.offset_17| Int)) (or (< |v_ULTIMATE.start_main_#t~mem57#1.offset_17| .cse0) (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1760 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_1758))) (or (< (select (select (store .cse5 (select (select (store |c_#memory_$Pointer$#2.base| .cse2 (store .cse3 (+ 16 |v_ULTIMATE.start_main_#t~mem57#1.offset_17|) |c_ULTIMATE.start_main_~user~0#1.base|)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_1760) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (+ 9 |v_ULTIMATE.start_main_#t~mem57#1.offset_17|)) (< (+ (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) 0)))))) (or (forall ((|v_ULTIMATE.start_main_#t~mem57#1.offset_17| Int) (v_ArrVal_1761 (Array Int Int))) (or (< |v_ULTIMATE.start_main_#t~mem57#1.offset_17| .cse0) (= .cse2 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| .cse2 (store .cse3 (+ 16 |v_ULTIMATE.start_main_#t~mem57#1.offset_17|) |c_ULTIMATE.start_main_~user~0#1.base|)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_1761)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (forall ((v_ArrVal_1758 (Array Int Int))) (< (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_1758) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) 0))) (forall ((|v_ULTIMATE.start_main_#t~mem57#1.offset_17| Int) (v_ArrVal_1761 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#2.base| .cse2 (store .cse3 (+ 16 |v_ULTIMATE.start_main_#t~mem57#1.offset_17|) |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (forall ((v_ArrVal_1758 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_1758))) (or (forall ((v_prenex_6 (Array Int Int))) (<= 0 (+ (select (select (store .cse7 .cse8 v_prenex_6) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 8))) (< (+ (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) 0)))) (< |v_ULTIMATE.start_main_#t~mem57#1.offset_17| .cse0) (= .cse2 (select (select (store .cse9 .cse8 v_ArrVal_1761) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) is different from false [2024-11-13 14:22:30,082 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1767 (Array Int Int)) (v_ArrVal_1766 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem57#1.offset_17| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1766))) (or (forall ((v_ArrVal_1758 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1767))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse4 .cse3 v_ArrVal_1758))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (< 0 (+ (select (select (store .cse0 (select (select (store .cse2 .cse3 (store (select .cse2 .cse3) (+ 16 |v_ULTIMATE.start_main_#t~mem57#1.offset_17|) |c_ULTIMATE.start_main_~user~0#1.base|)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_6) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 9))))))) (< |v_ULTIMATE.start_main_#t~mem57#1.offset_17| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (forall ((v_ArrVal_1767 (Array Int Int)) (v_ArrVal_1766 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1767))) (let ((.cse5 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1766)) (.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (forall ((|v_ULTIMATE.start_main_#t~mem57#1.offset_17| Int) (v_ArrVal_1761 (Array Int Int))) (or (< |v_ULTIMATE.start_main_#t~mem57#1.offset_17| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= .cse6 (select (select (let ((.cse7 (store .cse8 .cse6 (store (select .cse8 .cse6) (+ 16 |v_ULTIMATE.start_main_#t~mem57#1.offset_17|) |c_ULTIMATE.start_main_~user~0#1.base|)))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1761)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1758 (Array Int Int))) (< (+ (select (select (store .cse5 .cse6 v_ArrVal_1758) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0)))))) (forall ((v_ArrVal_1767 (Array Int Int)) (v_ArrVal_1766 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem57#1.offset_17| Int)) (let ((.cse12 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1766))) (or (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1760 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1767))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse9 (store .cse12 .cse11 v_ArrVal_1758))) (or (< (+ (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (< (select (select (store .cse9 (select (select (store .cse10 .cse11 (store (select .cse10 .cse11) (+ 16 |v_ULTIMATE.start_main_#t~mem57#1.offset_17|) |c_ULTIMATE.start_main_~user~0#1.base|)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ 9 |v_ULTIMATE.start_main_#t~mem57#1.offset_17|))))))) (< |v_ULTIMATE.start_main_#t~mem57#1.offset_17| (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (forall ((v_ArrVal_1767 (Array Int Int)) (v_ArrVal_1766 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem57#1.offset_17| Int) (v_ArrVal_1761 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1767))) (let ((.cse16 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse17 (store .cse18 .cse16 (store (select .cse18 .cse16) (+ 16 |v_ULTIMATE.start_main_#t~mem57#1.offset_17|) |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse15 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1766)) (.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (forall ((v_ArrVal_1758 (Array Int Int))) (let ((.cse13 (store .cse15 .cse16 v_ArrVal_1758))) (or (< (+ (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_prenex_6 (Array Int Int))) (<= 0 (+ (select (select (store .cse13 .cse14 v_prenex_6) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))) (< |v_ULTIMATE.start_main_#t~mem57#1.offset_17| (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= .cse16 (select (select (store .cse17 .cse14 v_ArrVal_1761) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))) is different from false [2024-11-13 14:22:30,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375819214] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:22:30,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:22:30,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2024-11-13 14:22:30,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853130723] [2024-11-13 14:22:30,094 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:22:30,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-13 14:22:30,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:22:30,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-13 14:22:30,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=667, Unknown=3, NotChecked=162, Total=930 [2024-11-13 14:22:30,097 INFO L87 Difference]: Start difference. First operand 4778 states and 6923 transitions. Second operand has 24 states, 21 states have (on average 9.047619047619047) internal successors, (190), 23 states have internal predecessors, (190), 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 14:22:48,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:22:48,434 INFO L93 Difference]: Finished difference Result 6627 states and 9252 transitions. [2024-11-13 14:22:48,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 14:22:48,435 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 9.047619047619047) internal successors, (190), 23 states have internal predecessors, (190), 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 101 [2024-11-13 14:22:48,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:22:48,442 INFO L225 Difference]: With dead ends: 6627 [2024-11-13 14:22:48,442 INFO L226 Difference]: Without dead ends: 6627 [2024-11-13 14:22:48,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=190, Invalid=1079, Unknown=3, NotChecked=210, Total=1482 [2024-11-13 14:22:48,443 INFO L432 NwaCegarLoop]: 1904 mSDtfsCounter, 7279 mSDsluCounter, 21550 mSDsCounter, 0 mSdLazyCounter, 14498 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7307 SdHoareTripleChecker+Valid, 23454 SdHoareTripleChecker+Invalid, 14608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 14498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:22:48,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7307 Valid, 23454 Invalid, 14608 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [110 Valid, 14498 Invalid, 0 Unknown, 0 Unchecked, 17.4s Time] [2024-11-13 14:22:48,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6627 states. [2024-11-13 14:22:48,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6627 to 4756. [2024-11-13 14:22:48,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4756 states, 4017 states have (on average 1.7037590241473737) internal successors, (6844), 4728 states have internal predecessors, (6844), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 14:22:48,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4756 states to 4756 states and 6898 transitions. [2024-11-13 14:22:48,518 INFO L78 Accepts]: Start accepts. Automaton has 4756 states and 6898 transitions. Word has length 101 [2024-11-13 14:22:48,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:22:48,519 INFO L471 AbstractCegarLoop]: Abstraction has 4756 states and 6898 transitions. [2024-11-13 14:22:48,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 9.047619047619047) internal successors, (190), 23 states have internal predecessors, (190), 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 14:22:48,519 INFO L276 IsEmpty]: Start isEmpty. Operand 4756 states and 6898 transitions. [2024-11-13 14:22:48,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 14:22:48,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:48,520 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] [2024-11-13 14:22:48,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-13 14:22:48,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-13 14:22:48,721 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:22:48,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:48,721 INFO L85 PathProgramCache]: Analyzing trace with hash -327555678, now seen corresponding path program 1 times [2024-11-13 14:22:48,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:22:48,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120983283] [2024-11-13 14:22:48,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:48,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:22:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:49,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:22:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:22:49,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:22:49,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120983283] [2024-11-13 14:22:49,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120983283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:22:49,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:22:49,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 14:22:49,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885860427] [2024-11-13 14:22:49,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:22:49,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 14:22:49,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:22:49,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 14:22:49,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:22:49,572 INFO L87 Difference]: Start difference. First operand 4756 states and 6898 transitions. Second operand has 14 states, 13 states have (on average 7.769230769230769) internal successors, (101), 13 states have internal predecessors, (101), 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 14:22:58,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:22:58,032 INFO L93 Difference]: Finished difference Result 4787 states and 6942 transitions. [2024-11-13 14:22:58,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 14:22:58,032 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.769230769230769) internal successors, (101), 13 states have internal predecessors, (101), 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 103 [2024-11-13 14:22:58,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:22:58,040 INFO L225 Difference]: With dead ends: 4787 [2024-11-13 14:22:58,040 INFO L226 Difference]: Without dead ends: 4787 [2024-11-13 14:22:58,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2024-11-13 14:22:58,041 INFO L432 NwaCegarLoop]: 1895 mSDtfsCounter, 2692 mSDsluCounter, 18683 mSDsCounter, 0 mSdLazyCounter, 9461 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2710 SdHoareTripleChecker+Valid, 20578 SdHoareTripleChecker+Invalid, 9485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 9461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:22:58,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2710 Valid, 20578 Invalid, 9485 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 9461 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2024-11-13 14:22:58,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4787 states. [2024-11-13 14:22:58,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4787 to 4783. [2024-11-13 14:22:58,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4783 states, 4043 states have (on average 1.6999752658916647) internal successors, (6873), 4753 states have internal predecessors, (6873), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-13 14:22:58,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4783 states to 4783 states and 6929 transitions. [2024-11-13 14:22:58,108 INFO L78 Accepts]: Start accepts. Automaton has 4783 states and 6929 transitions. Word has length 103 [2024-11-13 14:22:58,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:22:58,109 INFO L471 AbstractCegarLoop]: Abstraction has 4783 states and 6929 transitions. [2024-11-13 14:22:58,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.769230769230769) internal successors, (101), 13 states have internal predecessors, (101), 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 14:22:58,109 INFO L276 IsEmpty]: Start isEmpty. Operand 4783 states and 6929 transitions. [2024-11-13 14:22:58,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 14:22:58,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:58,111 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] [2024-11-13 14:22:58,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-13 14:22:58,111 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:22:58,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:58,112 INFO L85 PathProgramCache]: Analyzing trace with hash -327555677, now seen corresponding path program 1 times [2024-11-13 14:22:58,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:22:58,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925844548] [2024-11-13 14:22:58,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:58,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:22:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:59,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:22:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:59,377 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 14:22:59,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:22:59,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925844548] [2024-11-13 14:22:59,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925844548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:22:59,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:22:59,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 14:22:59,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185458993] [2024-11-13 14:22:59,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:22:59,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 14:22:59,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:22:59,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 14:22:59,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:22:59,378 INFO L87 Difference]: Start difference. First operand 4783 states and 6929 transitions. Second operand has 14 states, 13 states have (on average 7.769230769230769) internal successors, (101), 13 states have internal predecessors, (101), 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 14:23:09,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:23:09,354 INFO L93 Difference]: Finished difference Result 4786 states and 6940 transitions. [2024-11-13 14:23:09,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 14:23:09,355 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.769230769230769) internal successors, (101), 13 states have internal predecessors, (101), 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 103 [2024-11-13 14:23:09,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:23:09,359 INFO L225 Difference]: With dead ends: 4786 [2024-11-13 14:23:09,359 INFO L226 Difference]: Without dead ends: 4786 [2024-11-13 14:23:09,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-13 14:23:09,360 INFO L432 NwaCegarLoop]: 1896 mSDtfsCounter, 2702 mSDsluCounter, 11270 mSDsCounter, 0 mSdLazyCounter, 8774 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2720 SdHoareTripleChecker+Valid, 13166 SdHoareTripleChecker+Invalid, 8813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 8774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:23:09,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2720 Valid, 13166 Invalid, 8813 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [39 Valid, 8774 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2024-11-13 14:23:09,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4786 states. [2024-11-13 14:23:09,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4786 to 4783. [2024-11-13 14:23:09,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4783 states, 4043 states have (on average 1.6994805837249567) internal successors, (6871), 4753 states have internal predecessors, (6871), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-13 14:23:09,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4783 states to 4783 states and 6927 transitions. [2024-11-13 14:23:09,406 INFO L78 Accepts]: Start accepts. Automaton has 4783 states and 6927 transitions. Word has length 103 [2024-11-13 14:23:09,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:23:09,406 INFO L471 AbstractCegarLoop]: Abstraction has 4783 states and 6927 transitions. [2024-11-13 14:23:09,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.769230769230769) internal successors, (101), 13 states have internal predecessors, (101), 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 14:23:09,406 INFO L276 IsEmpty]: Start isEmpty. Operand 4783 states and 6927 transitions. [2024-11-13 14:23:09,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 14:23:09,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:23:09,407 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 14:23:09,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-13 14:23:09,407 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:23:09,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:23:09,408 INFO L85 PathProgramCache]: Analyzing trace with hash -979089273, now seen corresponding path program 1 times [2024-11-13 14:23:09,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:23:09,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729009735] [2024-11-13 14:23:09,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:23:09,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:23:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:10,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:23:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:10,377 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 14:23:10,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:23:10,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729009735] [2024-11-13 14:23:10,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729009735] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:23:10,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512158174] [2024-11-13 14:23:10,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:23:10,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:23:10,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:23:10,380 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:23:10,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 14:23:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:10,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-13 14:23:10,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:23:10,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:23:11,070 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:23:11,070 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 14:23:11,084 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 14:23:11,232 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:23:11,232 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 14:23:11,345 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:23:11,345 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 14:23:11,456 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:23:11,456 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 14:23:11,544 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:23:11,544 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 14:23:11,567 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 14:23:11,572 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 14:23:11,572 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:23:11,587 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2104 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_2104) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-13 14:23:11,594 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2104 (Array Int Int))) (= 1 (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2104) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2024-11-13 14:23:11,736 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2104 (Array Int Int)) (v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2102 (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$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2102))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2103)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2104)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 14:23:11,881 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-13 14:23:11,882 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 14:23:11,893 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2107 (Array Int Int)) (v_ArrVal_2104 (Array Int Int)) (v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2102 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2107))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2102)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2103)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2104)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem55#1.base|)) is different from false [2024-11-13 14:23:11,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512158174] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:23:11,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:23:11,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 20 [2024-11-13 14:23:11,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448371495] [2024-11-13 14:23:11,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:23:11,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-13 14:23:11,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:23:11,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-13 14:23:11,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=443, Unknown=31, NotChecked=188, Total=756 [2024-11-13 14:23:11,897 INFO L87 Difference]: Start difference. First operand 4783 states and 6927 transitions. Second operand has 21 states, 19 states have (on average 8.157894736842104) internal successors, (155), 19 states have internal predecessors, (155), 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 14:23:20,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:23:20,905 INFO L93 Difference]: Finished difference Result 4785 states and 6938 transitions. [2024-11-13 14:23:20,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 14:23:20,906 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 8.157894736842104) internal successors, (155), 19 states have internal predecessors, (155), 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 104 [2024-11-13 14:23:20,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:23:20,914 INFO L225 Difference]: With dead ends: 4785 [2024-11-13 14:23:20,914 INFO L226 Difference]: Without dead ends: 4785 [2024-11-13 14:23:20,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=183, Invalid=920, Unknown=35, NotChecked=268, Total=1406 [2024-11-13 14:23:20,915 INFO L432 NwaCegarLoop]: 1889 mSDtfsCounter, 2645 mSDsluCounter, 16814 mSDsCounter, 0 mSdLazyCounter, 8681 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2663 SdHoareTripleChecker+Valid, 18703 SdHoareTripleChecker+Invalid, 8704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 8681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:23:20,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2663 Valid, 18703 Invalid, 8704 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 8681 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2024-11-13 14:23:20,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4785 states. [2024-11-13 14:23:20,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4785 to 4782. [2024-11-13 14:23:20,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4782 states, 4043 states have (on average 1.698985901558249) internal successors, (6869), 4752 states have internal predecessors, (6869), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-13 14:23:20,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4782 states to 4782 states and 6925 transitions. [2024-11-13 14:23:20,982 INFO L78 Accepts]: Start accepts. Automaton has 4782 states and 6925 transitions. Word has length 104 [2024-11-13 14:23:20,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:23:20,983 INFO L471 AbstractCegarLoop]: Abstraction has 4782 states and 6925 transitions. [2024-11-13 14:23:20,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 8.157894736842104) internal successors, (155), 19 states have internal predecessors, (155), 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 14:23:20,983 INFO L276 IsEmpty]: Start isEmpty. Operand 4782 states and 6925 transitions. [2024-11-13 14:23:20,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 14:23:20,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:23:20,985 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 14:23:21,011 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 14:23:21,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:23:21,185 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:23:21,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:23:21,186 INFO L85 PathProgramCache]: Analyzing trace with hash -979089272, now seen corresponding path program 1 times [2024-11-13 14:23:21,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:23:21,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280881479] [2024-11-13 14:23:21,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:23:21,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:23:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:22,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:23:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:22,714 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 14:23:22,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:23:22,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280881479] [2024-11-13 14:23:22,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280881479] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:23:22,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094786237] [2024-11-13 14:23:22,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:23:22,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:23:22,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:23:22,716 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:23:22,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 14:23:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:23,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-13 14:23:23,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:23:23,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 14:23:23,399 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:23:23,399 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 14:23:23,415 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 14:23:23,422 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 14:23:23,436 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 14:23:23,564 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 14:23:23,571 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 14:23:23,825 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:23:23,825 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 14:23:23,832 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 14:23:23,982 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:23:23,982 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 14:23:23,998 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 14:23:24,119 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:23:24,120 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 14:23:24,134 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 14:23:24,222 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:23:24,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 62 treesize of output 57 [2024-11-13 14:23:24,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:23:24,253 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 14:23:24,258 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 14:23:24,264 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 14:23:24,264 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:23:24,373 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2295 (Array Int Int)) (v_ArrVal_2294 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_2295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_2294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2295 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_2295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))))) is different from false [2024-11-13 14:23:24,497 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2292 (Array Int Int)) (v_ArrVal_2295 (Array Int Int)) (v_ArrVal_2293 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2292) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2292 (Array Int Int)) (v_ArrVal_2295 (Array Int Int)) (v_ArrVal_2294 (Array Int Int)) (v_ArrVal_2293 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2293))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2292) .cse1 v_ArrVal_2295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-13 14:23:24,521 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2292 (Array Int Int)) (v_ArrVal_2295 (Array Int Int)) (v_ArrVal_2293 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2292) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_2292 (Array Int Int)) (v_ArrVal_2295 (Array Int Int)) (v_ArrVal_2294 (Array Int Int)) (v_ArrVal_2293 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2293))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2292) .cse2 v_ArrVal_2295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-13 14:23:24,565 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2292 (Array Int Int)) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2290 (Array Int Int)) (v_ArrVal_2295 (Array Int Int)) (v_ArrVal_2293 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2291))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2290) .cse0 v_ArrVal_2292) (select (select (store .cse1 .cse0 v_ArrVal_2293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2295))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_2292 (Array Int Int)) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2290 (Array Int Int)) (v_ArrVal_2295 (Array Int Int)) (v_ArrVal_2294 (Array Int Int)) (v_ArrVal_2293 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2291))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2293))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2290) .cse3 v_ArrVal_2292) .cse4 v_ArrVal_2295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-13 14:23:24,617 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2292 (Array Int Int)) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2290 (Array Int Int)) (v_ArrVal_2295 (Array Int Int)) (v_ArrVal_2293 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2291))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2290) .cse1 v_ArrVal_2292) (select (select (store .cse2 .cse1 v_ArrVal_2293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2295))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_2292 (Array Int Int)) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2290 (Array Int Int)) (v_ArrVal_2295 (Array Int Int)) (v_ArrVal_2294 (Array Int Int)) (v_ArrVal_2293 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2291))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2293))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2290) .cse4 v_ArrVal_2292) .cse5 v_ArrVal_2295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2024-11-13 14:23:24,732 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2292 (Array Int Int)) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2290 (Array Int Int)) (v_ArrVal_2301 (Array Int Int)) (v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2295 (Array Int Int)) (v_ArrVal_2294 (Array Int Int)) (v_ArrVal_2293 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2301))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2291))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2293))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2300) .cse0 v_ArrVal_2290) .cse1 v_ArrVal_2292) .cse2 v_ArrVal_2295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_2292 (Array Int Int)) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2290 (Array Int Int)) (v_ArrVal_2301 (Array Int Int)) (v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2295 (Array Int Int)) (v_ArrVal_2293 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2301))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2291))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2300) .cse7 v_ArrVal_2290) .cse8 v_ArrVal_2292) (select (select (store .cse9 .cse8 v_ArrVal_2293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2295))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))) is different from false [2024-11-13 14:23:24,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094786237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:23:24,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:23:24,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 21 [2024-11-13 14:23:24,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671746926] [2024-11-13 14:23:24,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:23:24,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 14:23:24,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:23:24,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 14:23:24,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=499, Unknown=18, NotChecked=306, Total=930 [2024-11-13 14:23:24,738 INFO L87 Difference]: Start difference. First operand 4782 states and 6925 transitions. Second operand has 22 states, 19 states have (on average 8.421052631578947) internal successors, (160), 21 states have internal predecessors, (160), 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 14:23:42,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:23:42,565 INFO L93 Difference]: Finished difference Result 4784 states and 6936 transitions. [2024-11-13 14:23:42,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 14:23:42,566 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.421052631578947) internal successors, (160), 21 states have internal predecessors, (160), 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 104 [2024-11-13 14:23:42,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:23:42,570 INFO L225 Difference]: With dead ends: 4784 [2024-11-13 14:23:42,570 INFO L226 Difference]: Without dead ends: 4784 [2024-11-13 14:23:42,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=175, Invalid=886, Unknown=19, NotChecked=402, Total=1482 [2024-11-13 14:23:42,571 INFO L432 NwaCegarLoop]: 1894 mSDtfsCounter, 2665 mSDsluCounter, 19141 mSDsCounter, 0 mSdLazyCounter, 14536 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2683 SdHoareTripleChecker+Valid, 21035 SdHoareTripleChecker+Invalid, 14579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 14536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:23:42,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2683 Valid, 21035 Invalid, 14579 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [43 Valid, 14536 Invalid, 0 Unknown, 0 Unchecked, 17.2s Time] [2024-11-13 14:23:42,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4784 states. [2024-11-13 14:23:42,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4784 to 4754. [2024-11-13 14:23:42,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4754 states, 4017 states have (on average 1.7027632561613144) internal successors, (6840), 4726 states have internal predecessors, (6840), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 14:23:42,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4754 states to 4754 states and 6894 transitions. [2024-11-13 14:23:42,612 INFO L78 Accepts]: Start accepts. Automaton has 4754 states and 6894 transitions. Word has length 104 [2024-11-13 14:23:42,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:23:42,613 INFO L471 AbstractCegarLoop]: Abstraction has 4754 states and 6894 transitions. [2024-11-13 14:23:42,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.421052631578947) internal successors, (160), 21 states have internal predecessors, (160), 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 14:23:42,613 INFO L276 IsEmpty]: Start isEmpty. Operand 4754 states and 6894 transitions. [2024-11-13 14:23:42,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 14:23:42,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:23:42,614 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 14:23:42,633 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 14:23:42,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:23:42,814 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:23:42,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:23:42,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1389591452, now seen corresponding path program 1 times [2024-11-13 14:23:42,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:23:42,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360196499] [2024-11-13 14:23:42,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:23:42,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:23:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:43,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:23:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:43,891 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 14:23:43,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:23:43,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360196499] [2024-11-13 14:23:43,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360196499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:23:43,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:23:43,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-13 14:23:43,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845428848] [2024-11-13 14:23:43,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:23:43,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 14:23:43,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:23:43,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 14:23:43,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-13 14:23:43,895 INFO L87 Difference]: Start difference. First operand 4754 states and 6894 transitions. Second operand has 17 states, 15 states have (on average 7.0) internal successors, (105), 16 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 14:23:51,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:23:51,935 INFO L93 Difference]: Finished difference Result 4793 states and 6946 transitions. [2024-11-13 14:23:51,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 14:23:51,936 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 7.0) internal successors, (105), 16 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 14:23:51,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:23:51,940 INFO L225 Difference]: With dead ends: 4793 [2024-11-13 14:23:51,940 INFO L226 Difference]: Without dead ends: 4793 [2024-11-13 14:23:51,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2024-11-13 14:23:51,941 INFO L432 NwaCegarLoop]: 1888 mSDtfsCounter, 2695 mSDsluCounter, 14945 mSDsCounter, 0 mSdLazyCounter, 7870 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2713 SdHoareTripleChecker+Valid, 16833 SdHoareTripleChecker+Invalid, 7897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 7870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:23:51,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2713 Valid, 16833 Invalid, 7897 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 7870 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2024-11-13 14:23:51,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4793 states. [2024-11-13 14:23:51,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4793 to 4789. [2024-11-13 14:23:51,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4789 states, 4051 states have (on average 1.6976055294988892) internal successors, (6877), 4759 states have internal predecessors, (6877), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-13 14:23:51,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4789 states to 4789 states and 6933 transitions. [2024-11-13 14:23:51,987 INFO L78 Accepts]: Start accepts. Automaton has 4789 states and 6933 transitions. Word has length 107 [2024-11-13 14:23:51,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:23:51,987 INFO L471 AbstractCegarLoop]: Abstraction has 4789 states and 6933 transitions. [2024-11-13 14:23:51,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 7.0) internal successors, (105), 16 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 14:23:51,988 INFO L276 IsEmpty]: Start isEmpty. Operand 4789 states and 6933 transitions. [2024-11-13 14:23:51,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 14:23:51,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:23:51,988 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:23:51,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-13 14:23:51,989 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:23:51,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:23:51,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1389591451, now seen corresponding path program 1 times [2024-11-13 14:23:51,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:23:51,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485140473] [2024-11-13 14:23:51,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:23:51,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:23:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:53,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:23:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:53,664 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 14:23:53,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:23:53,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485140473] [2024-11-13 14:23:53,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485140473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:23:53,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:23:53,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-13 14:23:53,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838965856] [2024-11-13 14:23:53,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:23:53,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 14:23:53,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:23:53,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 14:23:53,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-13 14:23:53,666 INFO L87 Difference]: Start difference. First operand 4789 states and 6933 transitions. Second operand has 18 states, 16 states have (on average 6.5625) internal successors, (105), 17 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 14:24:05,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:24:05,895 INFO L93 Difference]: Finished difference Result 4792 states and 6944 transitions. [2024-11-13 14:24:05,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 14:24:05,896 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.5625) internal successors, (105), 17 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 14:24:05,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:24:05,901 INFO L225 Difference]: With dead ends: 4792 [2024-11-13 14:24:05,901 INFO L226 Difference]: Without dead ends: 4792 [2024-11-13 14:24:05,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2024-11-13 14:24:05,902 INFO L432 NwaCegarLoop]: 1889 mSDtfsCounter, 2686 mSDsluCounter, 14608 mSDsCounter, 0 mSdLazyCounter, 10957 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2704 SdHoareTripleChecker+Valid, 16497 SdHoareTripleChecker+Invalid, 10983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 10957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:24:05,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2704 Valid, 16497 Invalid, 10983 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 10957 Invalid, 0 Unknown, 0 Unchecked, 11.6s Time] [2024-11-13 14:24:05,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4792 states. [2024-11-13 14:24:05,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4792 to 4789. [2024-11-13 14:24:05,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4789 states, 4051 states have (on average 1.6971118242409282) internal successors, (6875), 4759 states have internal predecessors, (6875), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-13 14:24:05,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4789 states to 4789 states and 6931 transitions. [2024-11-13 14:24:05,959 INFO L78 Accepts]: Start accepts. Automaton has 4789 states and 6931 transitions. Word has length 107 [2024-11-13 14:24:05,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:24:05,960 INFO L471 AbstractCegarLoop]: Abstraction has 4789 states and 6931 transitions. [2024-11-13 14:24:05,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.5625) internal successors, (105), 17 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 14:24:05,960 INFO L276 IsEmpty]: Start isEmpty. Operand 4789 states and 6931 transitions. [2024-11-13 14:24:05,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 14:24:05,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:24:05,961 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 14:24:05,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-13 14:24:05,961 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:24:05,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:24:05,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1391520969, now seen corresponding path program 1 times [2024-11-13 14:24:05,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:24:05,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749984817] [2024-11-13 14:24:05,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:24:05,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:24:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:24:06,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:24:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:24:06,974 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 14:24:06,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:24:06,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749984817] [2024-11-13 14:24:06,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749984817] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:24:06,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887523647] [2024-11-13 14:24:06,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:24:06,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:24:06,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:24:06,976 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:24:06,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 14:24:07,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:24:07,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-13 14:24:07,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:24:07,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:24:07,670 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:24:07,670 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 14:24:07,720 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 14:24:07,926 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:24:07,926 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 14:24:08,033 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:24:08,033 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 14:24:08,142 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:24:08,143 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 14:24:08,225 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:24:08,225 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 14:24:08,306 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:24:08,306 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 14:24:08,327 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 14:24:08,358 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-13 14:24:08,358 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 14:24:08,362 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 14:24:08,362 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:24:09,583 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-13 14:24:09,584 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 14:24:09,619 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2669 (Array Int Int)) (v_ArrVal_2668 (Array Int Int)) (v_ArrVal_2675 (Array Int Int)) (v_ArrVal_2671 (Array Int Int)) (v_ArrVal_2670 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem55#1.base| (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$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2675))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2668)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2669)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2670)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2671)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-13 14:24:09,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887523647] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:24:09,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:24:09,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 24 [2024-11-13 14:24:09,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484555612] [2024-11-13 14:24:09,623 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:24:09,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-13 14:24:09,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:24:09,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-13 14:24:09,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=986, Unknown=44, NotChecked=66, Total=1260 [2024-11-13 14:24:09,625 INFO L87 Difference]: Start difference. First operand 4789 states and 6931 transitions. Second operand has 25 states, 22 states have (on average 7.590909090909091) internal successors, (167), 23 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:24:22,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:24:22,588 INFO L93 Difference]: Finished difference Result 4791 states and 6942 transitions. [2024-11-13 14:24:22,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 14:24:22,589 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.590909090909091) internal successors, (167), 23 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2024-11-13 14:24:22,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:24:22,594 INFO L225 Difference]: With dead ends: 4791 [2024-11-13 14:24:22,594 INFO L226 Difference]: Without dead ends: 4791 [2024-11-13 14:24:22,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=274, Invalid=1578, Unknown=44, NotChecked=84, Total=1980 [2024-11-13 14:24:22,595 INFO L432 NwaCegarLoop]: 1887 mSDtfsCounter, 2647 mSDsluCounter, 26093 mSDsCounter, 0 mSdLazyCounter, 13025 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2665 SdHoareTripleChecker+Valid, 27980 SdHoareTripleChecker+Invalid, 13054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 13025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:24:22,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2665 Valid, 27980 Invalid, 13054 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 13025 Invalid, 0 Unknown, 0 Unchecked, 12.3s Time] [2024-11-13 14:24:22,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4791 states. [2024-11-13 14:24:22,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4791 to 4788. [2024-11-13 14:24:22,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4788 states, 4051 states have (on average 1.6966181189829672) internal successors, (6873), 4758 states have internal predecessors, (6873), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-13 14:24:22,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4788 states to 4788 states and 6929 transitions. [2024-11-13 14:24:22,680 INFO L78 Accepts]: Start accepts. Automaton has 4788 states and 6929 transitions. Word has length 108 [2024-11-13 14:24:22,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:24:22,680 INFO L471 AbstractCegarLoop]: Abstraction has 4788 states and 6929 transitions. [2024-11-13 14:24:22,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.590909090909091) internal successors, (167), 23 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:24:22,680 INFO L276 IsEmpty]: Start isEmpty. Operand 4788 states and 6929 transitions. [2024-11-13 14:24:22,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 14:24:22,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:24:22,681 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 14:24:22,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-13 14:24:22,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:24:22,881 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:24:22,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:24:22,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1391520970, now seen corresponding path program 1 times [2024-11-13 14:24:22,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:24:22,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213695063] [2024-11-13 14:24:22,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:24:22,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:24:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:24:24,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:24:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:24:24,799 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 14:24:24,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:24:24,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213695063] [2024-11-13 14:24:24,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213695063] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:24:24,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590919197] [2024-11-13 14:24:24,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:24:24,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:24:24,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:24:24,801 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:24:24,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 14:24:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:24:25,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-13 14:24:25,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:24:25,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:24:25,494 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:24:25,494 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 14:24:25,503 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 14:24:25,553 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 14:24:25,568 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 14:24:25,710 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 14:24:25,719 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 14:24:25,998 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:24:25,998 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 14:24:26,012 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 14:24:26,235 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:24:26,235 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 14:24:26,245 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 14:24:26,401 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:24:26,401 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 14:24:26,416 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 14:24:26,572 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:24:26,573 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 14:24:26,595 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 14:24:26,776 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:24:26,776 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 14:24:26,792 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 14:24:26,832 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 14:24:26,843 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 14:24:26,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:24:26,985 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-13 14:24:26,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2024-11-13 14:24:27,009 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:24:27,009 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 14:24:27,066 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 14:24:27,066 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:24:27,734 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc62#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_7|) 0))) (forall ((v_ArrVal_2879 (Array Int Int)) (v_ArrVal_2878 (Array Int Int)) (v_ArrVal_2881 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_2879) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_2878) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 1)))) (forall ((v_ArrVal_2879 (Array Int Int)) (v_ArrVal_2878 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_7| Int) (v_ArrVal_2881 (Array Int Int)) (v_ArrVal_2880 (Array Int Int))) (or (forall ((v_ArrVal_2882 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_2878))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_2879) .cse1 v_ArrVal_2881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_7| v_ArrVal_2882) (select (select (store .cse2 .cse1 v_ArrVal_2880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_7|) 0)))))) is different from false [2024-11-13 14:24:28,004 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc62#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_7|) 0))) (forall ((v_ArrVal_2879 (Array Int Int)) (v_ArrVal_2878 (Array Int Int)) (v_ArrVal_2877 (Array Int Int)) (v_ArrVal_2876 (Array Int Int)) (v_ArrVal_2881 (Array Int Int))) (< 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2877))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2876) .cse0 v_ArrVal_2879) (select (select (store .cse1 .cse0 v_ArrVal_2878) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2881))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1)))) (forall ((v_ArrVal_2879 (Array Int Int)) (v_ArrVal_2878 (Array Int Int)) (v_ArrVal_2877 (Array Int Int)) (v_ArrVal_2876 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_7| Int) (v_ArrVal_2881 (Array Int Int)) (v_ArrVal_2880 (Array Int Int))) (or (forall ((v_ArrVal_2882 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2877))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2878))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2876) .cse3 v_ArrVal_2879) .cse4 v_ArrVal_2881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_7| v_ArrVal_2882) (select (select (store .cse5 .cse4 v_ArrVal_2880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_7|) 0)))))) is different from false [2024-11-13 14:24:28,048 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc62#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_7|) 0))) (forall ((v_ArrVal_2879 (Array Int Int)) (v_ArrVal_2878 (Array Int Int)) (v_ArrVal_2877 (Array Int Int)) (v_ArrVal_2876 (Array Int Int)) (v_ArrVal_2881 (Array Int Int))) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2877))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2876) .cse1 v_ArrVal_2879) (select (select (store .cse2 .cse1 v_ArrVal_2878) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2881))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_2879 (Array Int Int)) (v_ArrVal_2878 (Array Int Int)) (v_ArrVal_2877 (Array Int Int)) (v_ArrVal_2876 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_7| Int) (v_ArrVal_2881 (Array Int Int)) (v_ArrVal_2880 (Array Int Int))) (or (forall ((v_ArrVal_2882 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2877))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2878))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2876) .cse4 v_ArrVal_2879) .cse5 v_ArrVal_2881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_7| v_ArrVal_2882) (select (select (store .cse6 .cse5 v_ArrVal_2880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_7|) 0))))))) is different from false [2024-11-13 14:24:28,546 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((v_ArrVal_2879 (Array Int Int)) (v_ArrVal_2878 (Array Int Int)) (v_ArrVal_2877 (Array Int Int)) (v_ArrVal_2876 (Array Int Int)) (v_ArrVal_2875 (Array Int Int)) (v_ArrVal_2874 (Array Int Int)) (v_ArrVal_2881 (Array Int Int))) (< 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2875))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2877))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2874) .cse1 v_ArrVal_2876) .cse2 v_ArrVal_2879) (select (select (store .cse3 .cse2 v_ArrVal_2878) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2881))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc62#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_7|) 0)))) (forall ((v_ArrVal_2879 (Array Int Int)) (v_ArrVal_2878 (Array Int Int)) (v_ArrVal_2877 (Array Int Int)) (v_ArrVal_2876 (Array Int Int)) (v_ArrVal_2875 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_7| Int) (v_ArrVal_2874 (Array Int Int)) (v_ArrVal_2881 (Array Int Int)) (v_ArrVal_2880 (Array Int Int))) (or (forall ((v_ArrVal_2882 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2875))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_2877))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2878))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2874) .cse6 v_ArrVal_2876) .cse7 v_ArrVal_2879) .cse8 v_ArrVal_2881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_7| v_ArrVal_2882) (select (select (store .cse9 .cse8 v_ArrVal_2880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_7|) 0))))))) is different from false [2024-11-13 14:24:28,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:24:28,721 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 14:24:29,228 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_36 (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_37 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_prenex_30))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_prenex_34))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_prenex_31))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_prenex_32) .cse0 v_prenex_36) .cse1 v_prenex_33) .cse2 v_prenex_28) (select (select (store .cse3 .cse2 v_prenex_29) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_37))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((v_ArrVal_2879 (Array Int Int)) (v_ArrVal_2878 (Array Int Int)) (v_ArrVal_2888 (Array Int Int)) (v_ArrVal_2877 (Array Int Int)) (v_ArrVal_2887 (Array Int Int)) (v_ArrVal_2876 (Array Int Int)) (v_ArrVal_2875 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_7| Int) (v_ArrVal_2874 (Array Int Int)) (v_ArrVal_2882 Int) (v_ArrVal_2881 (Array Int Int)) (v_ArrVal_2880 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc62#1.base_7| |c_ULTIMATE.start_main_#t~mem55#1.base|) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2888))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2875))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2877))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2878))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2887) .cse7 v_ArrVal_2874) .cse8 v_ArrVal_2876) .cse9 v_ArrVal_2879) .cse10 v_ArrVal_2881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 3) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_7| v_ArrVal_2882) (select (select (store .cse11 .cse10 v_ArrVal_2880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false [2024-11-13 14:24:29,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590919197] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:24:29,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:24:29,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2024-11-13 14:24:29,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832246620] [2024-11-13 14:24:29,233 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:24:29,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-13 14:24:29,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:24:29,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-13 14:24:29,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1312, Unknown=18, NotChecked=390, Total=1892 [2024-11-13 14:24:29,235 INFO L87 Difference]: Start difference. First operand 4788 states and 6929 transitions. Second operand has 32 states, 29 states have (on average 6.103448275862069) internal successors, (177), 30 states have internal predecessors, (177), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:24:44,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:24:44,460 INFO L93 Difference]: Finished difference Result 4790 states and 6940 transitions. [2024-11-13 14:24:44,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 14:24:44,464 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 6.103448275862069) internal successors, (177), 30 states have internal predecessors, (177), 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 108 [2024-11-13 14:24:44,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:24:44,470 INFO L225 Difference]: With dead ends: 4790 [2024-11-13 14:24:44,470 INFO L226 Difference]: Without dead ends: 4790 [2024-11-13 14:24:44,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=318, Invalid=2336, Unknown=18, NotChecked=520, Total=3192 [2024-11-13 14:24:44,472 INFO L432 NwaCegarLoop]: 1887 mSDtfsCounter, 2656 mSDsluCounter, 16478 mSDsCounter, 0 mSdLazyCounter, 11833 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2674 SdHoareTripleChecker+Valid, 18365 SdHoareTripleChecker+Invalid, 11868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 11833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:24:44,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2674 Valid, 18365 Invalid, 11868 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [35 Valid, 11833 Invalid, 0 Unknown, 0 Unchecked, 14.0s Time] [2024-11-13 14:24:44,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4790 states. [2024-11-13 14:24:44,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4790 to 4752. [2024-11-13 14:24:44,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4752 states, 4017 states have (on average 1.7017674881752551) internal successors, (6836), 4724 states have internal predecessors, (6836), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 14:24:44,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4752 states to 4752 states and 6890 transitions. [2024-11-13 14:24:44,562 INFO L78 Accepts]: Start accepts. Automaton has 4752 states and 6890 transitions. Word has length 108 [2024-11-13 14:24:44,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:24:44,562 INFO L471 AbstractCegarLoop]: Abstraction has 4752 states and 6890 transitions. [2024-11-13 14:24:44,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 6.103448275862069) internal successors, (177), 30 states have internal predecessors, (177), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:24:44,563 INFO L276 IsEmpty]: Start isEmpty. Operand 4752 states and 6890 transitions. [2024-11-13 14:24:44,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 14:24:44,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:24:44,564 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, 1] [2024-11-13 14:24:44,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 14:24:44,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:24:44,765 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:24:44,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:24:44,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1871508789, now seen corresponding path program 1 times [2024-11-13 14:24:44,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:24:44,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228912194] [2024-11-13 14:24:44,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:24:44,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:24:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:24:45,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:24:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:24:45,349 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 14:24:45,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:24:45,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228912194] [2024-11-13 14:24:45,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228912194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:24:45,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:24:45,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:24:45,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929633065] [2024-11-13 14:24:45,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:24:45,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:24:45,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:24:45,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:24:45,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:24:45,351 INFO L87 Difference]: Start difference. First operand 4752 states and 6890 transitions. Second operand has 7 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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 14:24:48,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:24:48,333 INFO L93 Difference]: Finished difference Result 4757 states and 6906 transitions. [2024-11-13 14:24:48,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:24:48,334 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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 110 [2024-11-13 14:24:48,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:24:48,339 INFO L225 Difference]: With dead ends: 4757 [2024-11-13 14:24:48,339 INFO L226 Difference]: Without dead ends: 4757 [2024-11-13 14:24:48,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:24:48,339 INFO L432 NwaCegarLoop]: 2705 mSDtfsCounter, 27 mSDsluCounter, 8543 mSDsCounter, 0 mSdLazyCounter, 2384 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 11248 SdHoareTripleChecker+Invalid, 2393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:24:48,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 11248 Invalid, 2393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2384 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-13 14:24:48,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4757 states. [2024-11-13 14:24:48,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4757 to 4751. [2024-11-13 14:24:48,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4751 states, 4017 states have (on average 1.7012696041822255) internal successors, (6834), 4723 states have internal predecessors, (6834), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 14:24:48,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4751 states to 4751 states and 6888 transitions. [2024-11-13 14:24:48,389 INFO L78 Accepts]: Start accepts. Automaton has 4751 states and 6888 transitions. Word has length 110 [2024-11-13 14:24:48,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:24:48,389 INFO L471 AbstractCegarLoop]: Abstraction has 4751 states and 6888 transitions. [2024-11-13 14:24:48,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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 14:24:48,389 INFO L276 IsEmpty]: Start isEmpty. Operand 4751 states and 6888 transitions. [2024-11-13 14:24:48,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 14:24:48,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:24:48,390 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, 1] [2024-11-13 14:24:48,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-13 14:24:48,390 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:24:48,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:24:48,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1871508790, now seen corresponding path program 1 times [2024-11-13 14:24:48,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:24:48,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076433616] [2024-11-13 14:24:48,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:24:48,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:24:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:24:50,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:24:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:24:51,019 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 14:24:51,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:24:51,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076433616] [2024-11-13 14:24:51,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076433616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:24:51,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:24:51,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-13 14:24:51,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21438228] [2024-11-13 14:24:51,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:24:51,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 14:24:51,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:24:51,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 14:24:51,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2024-11-13 14:24:51,023 INFO L87 Difference]: Start difference. First operand 4751 states and 6888 transitions. Second operand has 19 states, 17 states have (on average 6.352941176470588) internal successors, (108), 18 states have internal predecessors, (108), 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 14:25:05,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:25:05,726 INFO L93 Difference]: Finished difference Result 4795 states and 6944 transitions. [2024-11-13 14:25:05,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 14:25:05,726 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.352941176470588) internal successors, (108), 18 states have internal predecessors, (108), 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 110 [2024-11-13 14:25:05,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:25:05,730 INFO L225 Difference]: With dead ends: 4795 [2024-11-13 14:25:05,730 INFO L226 Difference]: Without dead ends: 4795 [2024-11-13 14:25:05,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2024-11-13 14:25:05,731 INFO L432 NwaCegarLoop]: 1887 mSDtfsCounter, 2671 mSDsluCounter, 18341 mSDsCounter, 0 mSdLazyCounter, 12624 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2689 SdHoareTripleChecker+Valid, 20228 SdHoareTripleChecker+Invalid, 12651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 12624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:25:05,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2689 Valid, 20228 Invalid, 12651 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 12624 Invalid, 0 Unknown, 0 Unchecked, 14.0s Time] [2024-11-13 14:25:05,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4795 states. [2024-11-13 14:25:05,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4795 to 4792. [2024-11-13 14:25:05,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4792 states, 4057 states have (on average 1.6946019226029085) internal successors, (6875), 4762 states have internal predecessors, (6875), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-13 14:25:05,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4792 states to 4792 states and 6931 transitions. [2024-11-13 14:25:05,774 INFO L78 Accepts]: Start accepts. Automaton has 4792 states and 6931 transitions. Word has length 110 [2024-11-13 14:25:05,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:25:05,774 INFO L471 AbstractCegarLoop]: Abstraction has 4792 states and 6931 transitions. [2024-11-13 14:25:05,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.352941176470588) internal successors, (108), 18 states have internal predecessors, (108), 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 14:25:05,774 INFO L276 IsEmpty]: Start isEmpty. Operand 4792 states and 6931 transitions. [2024-11-13 14:25:05,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 14:25:05,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:25:05,775 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, 1, 1] [2024-11-13 14:25:05,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-13 14:25:05,775 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:25:05,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:25:05,776 INFO L85 PathProgramCache]: Analyzing trace with hash -222464335, now seen corresponding path program 1 times [2024-11-13 14:25:05,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:25:05,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108128658] [2024-11-13 14:25:05,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:25:05,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:25:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:25:07,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:25:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:25:07,554 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 14:25:07,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:25:07,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108128658] [2024-11-13 14:25:07,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108128658] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:25:07,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093174268] [2024-11-13 14:25:07,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:25:07,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:25:07,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:25:07,556 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:25:07,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 14:25:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:25:08,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-13 14:25:08,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:25:08,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:25:08,242 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:25:08,242 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 14:25:08,252 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 14:25:08,265 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 14:25:08,278 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 14:25:08,365 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 14:25:08,371 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 14:25:08,698 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:25:08,698 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 14:25:08,705 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 14:25:08,897 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:25:08,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 14:25:08,903 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 14:25:09,022 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:25:09,022 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 14:25:09,037 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 14:25:09,154 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:25:09,154 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 14:25:09,160 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 14:25:09,284 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:25:09,284 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 14:25:09,298 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 14:25:09,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:25:09,374 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 14:25:09,394 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:25:09,394 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 14:25:09,432 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:25:09,433 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 14:25:09,440 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 14:25:09,500 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 14:25:09,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 14:25:09,518 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 14:25:09,519 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:25:09,747 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3292 (Array Int Int)) (v_ArrVal_3293 (Array Int Int))) (<= (+ 44 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem61#1.base| v_ArrVal_3292) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem61#1.base| v_ArrVal_3293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3292 (Array Int Int))) (<= 0 (+ 40 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem61#1.base| v_ArrVal_3292) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-13 14:25:11,482 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc62#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_9|) 0))) (forall ((v_ArrVal_3285 (Array Int Int)) (v_ArrVal_3286 (Array Int Int)) (v_ArrVal_3287 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3290 (Array Int Int)) (v_ArrVal_3292 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3285))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3288))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3286) .cse1 v_ArrVal_3287) .cse2 v_ArrVal_3289) (select (select (store .cse3 .cse2 v_ArrVal_3290) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3292))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))) (forall ((v_ArrVal_3285 (Array Int Int)) (v_ArrVal_3286 (Array Int Int)) (v_ArrVal_3287 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_9| Int) (v_ArrVal_3290 (Array Int Int))) (or (forall ((v_ArrVal_3291 Int) (v_ArrVal_3292 (Array Int Int)) (v_ArrVal_3293 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3285))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_3288))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_3290))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ 44 (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3286) .cse6 v_ArrVal_3287) .cse7 v_ArrVal_3289) .cse8 v_ArrVal_3292) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_9| v_ArrVal_3291) (select (select (store .cse9 .cse8 v_ArrVal_3293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_9|) 0))))))) is different from false [2024-11-13 14:25:43,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:25:43,853 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 14:25:48,847 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc62#1.base_9| Int) (v_ArrVal_3290 (Array Int Int)) (v_ArrVal_3292 (Array Int Int)) (v_ArrVal_3293 (Array Int Int)) (v_ArrVal_3283 (Array Int Int)) (v_ArrVal_3284 (Array Int Int)) (v_ArrVal_3285 (Array Int Int)) (v_ArrVal_3286 (Array Int Int)) (v_ArrVal_3291 Int) (v_ArrVal_3298 (Array Int Int)) (v_ArrVal_3287 (Array Int Int)) (v_ArrVal_3299 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3289 (Array Int Int))) (or (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3299))) (let ((.cse0 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse9 (store .cse10 .cse0 v_ArrVal_3283))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_3285))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_3288))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_3290))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< (+ (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3298) .cse0 v_ArrVal_3284) .cse1 v_ArrVal_3286) .cse2 v_ArrVal_3287) .cse3 v_ArrVal_3289) .cse4 v_ArrVal_3292) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_9| v_ArrVal_3291) (select (select (store .cse6 .cse4 v_ArrVal_3293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))))))) (= |v_ULTIMATE.start_main_#t~malloc62#1.base_9| |c_ULTIMATE.start_main_#t~mem55#1.base|))) (forall ((v_prenex_43 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_46 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_prenex_38 (Array Int Int)) (v_prenex_49 (Array Int Int)) (v_prenex_48 (Array Int Int))) (< 0 (+ 41 (select (select (let ((.cse18 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_prenex_44))) (let ((.cse11 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse11 v_prenex_38))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse12 v_prenex_40))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse13 v_prenex_45))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_prenex_42) .cse11 v_prenex_39) .cse12 v_prenex_41) .cse13 v_prenex_43) .cse14 v_prenex_46) (select (select (store .cse15 .cse14 v_prenex_48) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_49))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))) is different from false [2024-11-13 14:25:48,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093174268] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:25:48,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:25:48,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 26 [2024-11-13 14:25:48,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070130239] [2024-11-13 14:25:48,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:25:48,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-13 14:25:48,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:25:48,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-13 14:25:48,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1166, Unknown=62, NotChecked=222, Total=1640 [2024-11-13 14:25:48,880 INFO L87 Difference]: Start difference. First operand 4792 states and 6931 transitions. Second operand has 27 states, 25 states have (on average 6.76) internal successors, (169), 25 states have internal predecessors, (169), 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 14:27:00,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:27:00,010 INFO L93 Difference]: Finished difference Result 4794 states and 6942 transitions. [2024-11-13 14:27:00,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 14:27:00,011 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 6.76) internal successors, (169), 25 states have internal predecessors, (169), 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 111 [2024-11-13 14:27:00,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:27:00,016 INFO L225 Difference]: With dead ends: 4794 [2024-11-13 14:27:00,016 INFO L226 Difference]: Without dead ends: 4794 [2024-11-13 14:27:00,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 111 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 41.5s TimeCoverageRelationStatistics Valid=349, Invalid=2253, Unknown=62, NotChecked=306, Total=2970 [2024-11-13 14:27:00,017 INFO L432 NwaCegarLoop]: 1886 mSDtfsCounter, 2646 mSDsluCounter, 16495 mSDsCounter, 0 mSdLazyCounter, 11858 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2664 SdHoareTripleChecker+Valid, 18381 SdHoareTripleChecker+Invalid, 11885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 11858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 67.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:27:00,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2664 Valid, 18381 Invalid, 11885 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 11858 Invalid, 0 Unknown, 0 Unchecked, 67.9s Time] [2024-11-13 14:27:00,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4794 states. [2024-11-13 14:27:00,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4794 to 4750. [2024-11-13 14:27:00,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4750 states, 4017 states have (on average 1.7007717201891959) internal successors, (6832), 4722 states have internal predecessors, (6832), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 14:27:00,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4750 states to 4750 states and 6886 transitions. [2024-11-13 14:27:00,066 INFO L78 Accepts]: Start accepts. Automaton has 4750 states and 6886 transitions. Word has length 111 [2024-11-13 14:27:00,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:27:00,066 INFO L471 AbstractCegarLoop]: Abstraction has 4750 states and 6886 transitions. [2024-11-13 14:27:00,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 6.76) internal successors, (169), 25 states have internal predecessors, (169), 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 14:27:00,066 INFO L276 IsEmpty]: Start isEmpty. Operand 4750 states and 6886 transitions. [2024-11-13 14:27:00,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 14:27:00,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:27:00,067 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, 1, 1, 1, 1] [2024-11-13 14:27:00,084 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 14:27:00,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-13 14:27:00,267 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:27:00,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:27:00,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1148559851, now seen corresponding path program 1 times [2024-11-13 14:27:00,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:27:00,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559702441] [2024-11-13 14:27:00,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:27:00,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:27:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:02,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:27:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:02,688 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 14:27:02,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:27:02,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559702441] [2024-11-13 14:27:02,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559702441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:27:02,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:27:02,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-13 14:27:02,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710527778] [2024-11-13 14:27:02,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:27:02,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 14:27:02,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:27:02,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 14:27:02,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-13 14:27:02,690 INFO L87 Difference]: Start difference. First operand 4750 states and 6886 transitions. Second operand has 18 states, 17 states have (on average 6.529411764705882) internal successors, (111), 17 states have internal predecessors, (111), 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 14:27:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:27:58,804 INFO L93 Difference]: Finished difference Result 4835 states and 6998 transitions. [2024-11-13 14:27:58,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 14:27:58,805 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.529411764705882) internal successors, (111), 17 states have internal predecessors, (111), 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 113 [2024-11-13 14:27:58,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:27:58,810 INFO L225 Difference]: With dead ends: 4835 [2024-11-13 14:27:58,810 INFO L226 Difference]: Without dead ends: 4835 [2024-11-13 14:27:58,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2024-11-13 14:27:58,810 INFO L432 NwaCegarLoop]: 1899 mSDtfsCounter, 2799 mSDsluCounter, 18747 mSDsCounter, 0 mSdLazyCounter, 9632 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2817 SdHoareTripleChecker+Valid, 20646 SdHoareTripleChecker+Invalid, 9688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 9632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:27:58,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2817 Valid, 20646 Invalid, 9688 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [56 Valid, 9632 Invalid, 0 Unknown, 0 Unchecked, 54.6s Time] [2024-11-13 14:27:58,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4835 states. [2024-11-13 14:27:58,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4835 to 4797. [2024-11-13 14:27:58,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4797 states, 4063 states have (on average 1.6935761752399705) internal successors, (6881), 4767 states have internal predecessors, (6881), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-13 14:27:58,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4797 states to 4797 states and 6937 transitions. [2024-11-13 14:27:58,858 INFO L78 Accepts]: Start accepts. Automaton has 4797 states and 6937 transitions. Word has length 113 [2024-11-13 14:27:58,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:27:58,859 INFO L471 AbstractCegarLoop]: Abstraction has 4797 states and 6937 transitions. [2024-11-13 14:27:58,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.529411764705882) internal successors, (111), 17 states have internal predecessors, (111), 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 14:27:58,859 INFO L276 IsEmpty]: Start isEmpty. Operand 4797 states and 6937 transitions. [2024-11-13 14:27:58,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 14:27:58,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:27:58,859 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, 1, 1, 1, 1] [2024-11-13 14:27:58,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-13 14:27:58,860 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:27:58,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:27:58,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1148559852, now seen corresponding path program 1 times [2024-11-13 14:27:58,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:27:58,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953623312] [2024-11-13 14:27:58,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:27:58,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:27:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:28:02,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:28:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:28:02,485 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 14:28:02,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:28:02,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953623312] [2024-11-13 14:28:02,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953623312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:28:02,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:28:02,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 14:28:02,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447843274] [2024-11-13 14:28:02,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:28:02,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 14:28:02,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:28:02,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 14:28:02,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-13 14:28:02,486 INFO L87 Difference]: Start difference. First operand 4797 states and 6937 transitions. Second operand has 13 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 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 14:28:56,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:28:56,362 INFO L93 Difference]: Finished difference Result 4821 states and 6974 transitions. [2024-11-13 14:28:56,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 14:28:56,363 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 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 113 [2024-11-13 14:28:56,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:28:56,367 INFO L225 Difference]: With dead ends: 4821 [2024-11-13 14:28:56,367 INFO L226 Difference]: Without dead ends: 4821 [2024-11-13 14:28:56,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2024-11-13 14:28:56,368 INFO L432 NwaCegarLoop]: 1885 mSDtfsCounter, 7998 mSDsluCounter, 13493 mSDsCounter, 0 mSdLazyCounter, 9261 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8014 SdHoareTripleChecker+Valid, 15378 SdHoareTripleChecker+Invalid, 9325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 9261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:28:56,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8014 Valid, 15378 Invalid, 9325 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [64 Valid, 9261 Invalid, 0 Unknown, 0 Unchecked, 52.8s Time] [2024-11-13 14:28:56,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4821 states. [2024-11-13 14:28:56,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4821 to 4796. [2024-11-13 14:28:56,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4796 states, 4063 states have (on average 1.692591681023874) internal successors, (6877), 4766 states have internal predecessors, (6877), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-13 14:28:56,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4796 states to 4796 states and 6933 transitions. [2024-11-13 14:28:56,425 INFO L78 Accepts]: Start accepts. Automaton has 4796 states and 6933 transitions. Word has length 113 [2024-11-13 14:28:56,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:28:56,425 INFO L471 AbstractCegarLoop]: Abstraction has 4796 states and 6933 transitions. [2024-11-13 14:28:56,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 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 14:28:56,425 INFO L276 IsEmpty]: Start isEmpty. Operand 4796 states and 6933 transitions. [2024-11-13 14:28:56,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-13 14:28:56,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:28:56,426 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, 1, 1, 1, 1, 1] [2024-11-13 14:28:56,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-13 14:28:56,426 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:28:56,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:28:56,426 INFO L85 PathProgramCache]: Analyzing trace with hash -299799920, now seen corresponding path program 1 times [2024-11-13 14:28:56,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:28:56,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747509060] [2024-11-13 14:28:56,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:28:56,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:28:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:28:58,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:28:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:28:59,100 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 14:28:59,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:28:59,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747509060] [2024-11-13 14:28:59,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747509060] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:28:59,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245655394] [2024-11-13 14:28:59,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:28:59,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:28:59,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:28:59,103 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:28:59,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 14:28:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:28:59,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-13 14:28:59,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:28:59,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:29:00,641 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:29:00,641 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 14:29:00,676 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 14:29:00,932 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:29:00,932 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 14:29:01,242 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:29:01,242 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 14:29:01,563 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:29:01,564 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 14:29:01,880 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:29:01,881 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 14:29:02,200 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:29:02,201 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 14:29:02,453 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:29:02,454 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 14:29:02,821 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:29:02,822 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 14:29:02,880 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 14:29:02,892 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 14:29:02,892 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:29:03,518 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-13 14:29:03,519 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 14:29:03,542 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3718 (Array Int Int)) (v_ArrVal_3719 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem61#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem61#1.base| v_ArrVal_3718))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3719)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-13 14:29:03,582 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3718 (Array Int Int)) (v_ArrVal_3719 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3718))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3719)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-13 14:29:03,624 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3717 (Array Int Int)) (v_ArrVal_3718 (Array Int Int)) (v_ArrVal_3719 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3717)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3718))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3719)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) is different from false [2024-11-13 14:29:03,653 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3717 (Array Int Int)) (v_ArrVal_3718 (Array Int Int)) (v_ArrVal_3719 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3717))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3718))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3719)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-13 14:29:04,069 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3717 (Array Int Int)) (v_ArrVal_3718 (Array Int Int)) (v_ArrVal_3719 (Array Int Int)) (v_ArrVal_3716 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3716))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3717)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3718))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3719)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-13 14:29:05,070 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3717 (Array Int Int)) (v_ArrVal_3718 (Array Int Int)) (v_ArrVal_3719 (Array Int Int)) (v_ArrVal_3714 (Array Int Int)) (v_ArrVal_3715 (Array Int Int)) (v_ArrVal_3716 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3714))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3715)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3716)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3717)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3718))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3719)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-13 14:29:06,124 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3717 (Array Int Int)) (v_ArrVal_3718 (Array Int Int)) (v_ArrVal_3719 (Array Int Int)) (v_ArrVal_3722 (Array Int Int)) (v_ArrVal_3714 (Array Int Int)) (v_ArrVal_3715 (Array Int Int)) (v_ArrVal_3716 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3722))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3714)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3715)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3716)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3717)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3718))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3719)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-13 14:29:06,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245655394] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:29:06,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:29:06,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 24 [2024-11-13 14:29:06,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648325726] [2024-11-13 14:29:06,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:29:06,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-13 14:29:06,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:29:06,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-13 14:29:06,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=776, Unknown=49, NotChecked=448, Total=1406 [2024-11-13 14:29:06,132 INFO L87 Difference]: Start difference. First operand 4796 states and 6933 transitions. Second operand has 25 states, 23 states have (on average 7.3478260869565215) internal successors, (169), 24 states have internal predecessors, (169), 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 14:30:34,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:30:34,092 INFO L93 Difference]: Finished difference Result 4820 states and 6972 transitions. [2024-11-13 14:30:34,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 14:30:34,093 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 7.3478260869565215) internal successors, (169), 24 states have internal predecessors, (169), 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 114 [2024-11-13 14:30:34,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:30:34,098 INFO L225 Difference]: With dead ends: 4820 [2024-11-13 14:30:34,098 INFO L226 Difference]: Without dead ends: 4820 [2024-11-13 14:30:34,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=249, Invalid=1451, Unknown=50, NotChecked=602, Total=2352 [2024-11-13 14:30:34,099 INFO L432 NwaCegarLoop]: 1891 mSDtfsCounter, 2676 mSDsluCounter, 31699 mSDsCounter, 0 mSdLazyCounter, 15348 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 83.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2692 SdHoareTripleChecker+Valid, 33590 SdHoareTripleChecker+Invalid, 15379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 15348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 85.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:30:34,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2692 Valid, 33590 Invalid, 15379 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [31 Valid, 15348 Invalid, 0 Unknown, 0 Unchecked, 85.9s Time] [2024-11-13 14:30:34,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4820 states. [2024-11-13 14:30:34,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4820 to 4748. [2024-11-13 14:30:34,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4748 states, 4017 states have (on average 1.6997759522031366) internal successors, (6828), 4720 states have internal predecessors, (6828), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 14:30:34,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4748 states to 4748 states and 6882 transitions. [2024-11-13 14:30:34,142 INFO L78 Accepts]: Start accepts. Automaton has 4748 states and 6882 transitions. Word has length 114 [2024-11-13 14:30:34,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:30:34,143 INFO L471 AbstractCegarLoop]: Abstraction has 4748 states and 6882 transitions. [2024-11-13 14:30:34,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 7.3478260869565215) internal successors, (169), 24 states have internal predecessors, (169), 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 14:30:34,143 INFO L276 IsEmpty]: Start isEmpty. Operand 4748 states and 6882 transitions. [2024-11-13 14:30:34,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 14:30:34,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:30:34,144 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:30:34,161 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 14:30:34,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:30:34,344 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:30:34,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:30:34,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1257210103, now seen corresponding path program 1 times [2024-11-13 14:30:34,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:30:34,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444456497] [2024-11-13 14:30:34,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:30:34,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:30:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:34,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:30:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:34,668 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 14:30:34,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:30:34,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444456497] [2024-11-13 14:30:34,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444456497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:30:34,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:30:34,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:30:34,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70007345] [2024-11-13 14:30:34,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:30:34,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:30:34,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:30:34,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:30:34,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:30:34,670 INFO L87 Difference]: Start difference. First operand 4748 states and 6882 transitions. Second operand has 6 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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 14:30:48,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:30:48,591 INFO L93 Difference]: Finished difference Result 4775 states and 6926 transitions. [2024-11-13 14:30:48,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:30:48,591 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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 116 [2024-11-13 14:30:48,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:30:48,596 INFO L225 Difference]: With dead ends: 4775 [2024-11-13 14:30:48,596 INFO L226 Difference]: Without dead ends: 4775 [2024-11-13 14:30:48,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:30:48,597 INFO L432 NwaCegarLoop]: 2692 mSDtfsCounter, 43 mSDsluCounter, 8516 mSDsCounter, 0 mSdLazyCounter, 2401 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 11208 SdHoareTripleChecker+Invalid, 2411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:30:48,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 11208 Invalid, 2411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2401 Invalid, 0 Unknown, 0 Unchecked, 13.8s Time] [2024-11-13 14:30:48,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4775 states. [2024-11-13 14:30:48,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4775 to 4747. [2024-11-13 14:30:48,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4747 states, 4017 states have (on average 1.699278068210107) internal successors, (6826), 4719 states have internal predecessors, (6826), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 14:30:48,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4747 states to 4747 states and 6880 transitions. [2024-11-13 14:30:48,639 INFO L78 Accepts]: Start accepts. Automaton has 4747 states and 6880 transitions. Word has length 116 [2024-11-13 14:30:48,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:30:48,640 INFO L471 AbstractCegarLoop]: Abstraction has 4747 states and 6880 transitions. [2024-11-13 14:30:48,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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 14:30:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand 4747 states and 6880 transitions. [2024-11-13 14:30:48,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 14:30:48,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:30:48,640 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:30:48,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-13 14:30:48,641 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:30:48,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:30:48,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1257210102, now seen corresponding path program 1 times [2024-11-13 14:30:48,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:30:48,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247873679] [2024-11-13 14:30:48,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:30:48,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:30:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:51,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:30:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:51,741 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 14:30:51,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:30:51,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247873679] [2024-11-13 14:30:51,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247873679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:30:51,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:30:51,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-13 14:30:51,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857890334] [2024-11-13 14:30:51,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:30:51,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 14:30:51,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:30:51,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 14:30:51,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-13 14:30:51,743 INFO L87 Difference]: Start difference. First operand 4747 states and 6880 transitions. Second operand has 19 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 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 14:32:02,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:32:02,451 INFO L93 Difference]: Finished difference Result 4829 states and 6986 transitions. [2024-11-13 14:32:02,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 14:32:02,451 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 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 116 [2024-11-13 14:32:02,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:32:02,457 INFO L225 Difference]: With dead ends: 4829 [2024-11-13 14:32:02,457 INFO L226 Difference]: Without dead ends: 4829 [2024-11-13 14:32:02,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2024-11-13 14:32:02,458 INFO L432 NwaCegarLoop]: 1887 mSDtfsCounter, 2775 mSDsluCounter, 21700 mSDsCounter, 0 mSdLazyCounter, 11943 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 67.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2793 SdHoareTripleChecker+Valid, 23587 SdHoareTripleChecker+Invalid, 11990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 11943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:32:02,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2793 Valid, 23587 Invalid, 11990 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [47 Valid, 11943 Invalid, 0 Unknown, 0 Unchecked, 68.9s Time] [2024-11-13 14:32:02,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4829 states. [2024-11-13 14:32:02,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4829 to 4800. [2024-11-13 14:32:02,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4800 states, 4069 states have (on average 1.6905873679036618) internal successors, (6879), 4770 states have internal predecessors, (6879), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-13 14:32:02,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4800 states to 4800 states and 6935 transitions. [2024-11-13 14:32:02,497 INFO L78 Accepts]: Start accepts. Automaton has 4800 states and 6935 transitions. Word has length 116 [2024-11-13 14:32:02,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:32:02,497 INFO L471 AbstractCegarLoop]: Abstraction has 4800 states and 6935 transitions. [2024-11-13 14:32:02,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 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 14:32:02,498 INFO L276 IsEmpty]: Start isEmpty. Operand 4800 states and 6935 transitions. [2024-11-13 14:32:02,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 14:32:02,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:32:02,499 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:32:02,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-13 14:32:02,499 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:32:02,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:32:02,499 INFO L85 PathProgramCache]: Analyzing trace with hash -2101692347, now seen corresponding path program 1 times [2024-11-13 14:32:02,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:32:02,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198818684] [2024-11-13 14:32:02,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:32:02,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:32:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:32:06,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:32:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:32:06,570 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 14:32:06,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:32:06,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198818684] [2024-11-13 14:32:06,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198818684] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:32:06,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105391401] [2024-11-13 14:32:06,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:32:06,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:32:06,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:32:06,573 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:32:06,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 14:32:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:32:07,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 14:32:07,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:32:07,533 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 29 treesize of output 17 [2024-11-13 14:32:07,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-13 14:32:07,759 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 14:32:07,759 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:32:07,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105391401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:32:07,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:32:07,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [20] total 23 [2024-11-13 14:32:07,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264183098] [2024-11-13 14:32:07,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:32:07,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:32:07,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:32:07,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:32:07,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2024-11-13 14:32:07,760 INFO L87 Difference]: Start difference. First operand 4800 states and 6935 transitions. Second operand has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 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 14:32:19,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:32:19,831 INFO L93 Difference]: Finished difference Result 4799 states and 6933 transitions. [2024-11-13 14:32:19,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:32:19,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 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 117 [2024-11-13 14:32:19,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:32:19,837 INFO L225 Difference]: With dead ends: 4799 [2024-11-13 14:32:19,837 INFO L226 Difference]: Without dead ends: 4799 [2024-11-13 14:32:19,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2024-11-13 14:32:19,837 INFO L432 NwaCegarLoop]: 2726 mSDtfsCounter, 4 mSDsluCounter, 6269 mSDsCounter, 0 mSdLazyCounter, 1917 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 8995 SdHoareTripleChecker+Invalid, 1917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:32:19,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 8995 Invalid, 1917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1917 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2024-11-13 14:32:19,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4799 states. [2024-11-13 14:32:19,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4799 to 4746. [2024-11-13 14:32:19,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4746 states, 4017 states have (on average 1.6987801842170773) internal successors, (6824), 4718 states have internal predecessors, (6824), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 14:32:19,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4746 states to 4746 states and 6878 transitions. [2024-11-13 14:32:19,898 INFO L78 Accepts]: Start accepts. Automaton has 4746 states and 6878 transitions. Word has length 117 [2024-11-13 14:32:19,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:32:19,898 INFO L471 AbstractCegarLoop]: Abstraction has 4746 states and 6878 transitions. [2024-11-13 14:32:19,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 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 14:32:19,899 INFO L276 IsEmpty]: Start isEmpty. Operand 4746 states and 6878 transitions. [2024-11-13 14:32:19,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 14:32:19,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:32:19,899 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:32:19,921 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 14:32:20,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1c71ae-56d0-40bc-987c-10a664142f0f/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2024-11-13 14:32:20,100 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:32:20,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:32:20,100 INFO L85 PathProgramCache]: Analyzing trace with hash -318806801, now seen corresponding path program 1 times [2024-11-13 14:32:20,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:32:20,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093699095] [2024-11-13 14:32:20,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:32:20,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:32:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:32:23,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:32:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:32:23,900 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 14:32:23,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:32:23,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093699095] [2024-11-13 14:32:23,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093699095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:32:23,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:32:23,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-13 14:32:23,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571661891] [2024-11-13 14:32:23,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:32:23,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 14:32:23,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:32:23,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 14:32:23,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-13 14:32:23,902 INFO L87 Difference]: Start difference. First operand 4746 states and 6878 transitions. Second operand has 20 states, 19 states have (on average 6.052631578947368) internal successors, (115), 19 states have internal predecessors, (115), 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 14:33:33,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:33:33,450 INFO L93 Difference]: Finished difference Result 4829 states and 6984 transitions. [2024-11-13 14:33:33,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 14:33:33,450 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.052631578947368) internal successors, (115), 19 states have internal predecessors, (115), 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 117 [2024-11-13 14:33:33,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:33:33,457 INFO L225 Difference]: With dead ends: 4829 [2024-11-13 14:33:33,457 INFO L226 Difference]: Without dead ends: 4829 [2024-11-13 14:33:33,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2024-11-13 14:33:33,459 INFO L432 NwaCegarLoop]: 1889 mSDtfsCounter, 2774 mSDsluCounter, 24247 mSDsCounter, 0 mSdLazyCounter, 12082 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 65.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2792 SdHoareTripleChecker+Valid, 26136 SdHoareTripleChecker+Invalid, 12132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 12082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 67.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:33:33,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2792 Valid, 26136 Invalid, 12132 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 12082 Invalid, 0 Unknown, 0 Unchecked, 67.4s Time] [2024-11-13 14:33:33,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4829 states. [2024-11-13 14:33:33,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4829 to 4801. [2024-11-13 14:33:33,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4801 states, 4071 states have (on average 1.6897568165070007) internal successors, (6879), 4771 states have internal predecessors, (6879), 29 states have call successors, (29), 4 states have call predecessors, (29), 5 states have return successors, (31), 26 states have call predecessors, (31), 29 states have call successors, (31) [2024-11-13 14:33:33,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4801 states to 4801 states and 6939 transitions. [2024-11-13 14:33:33,520 INFO L78 Accepts]: Start accepts. Automaton has 4801 states and 6939 transitions. Word has length 117 [2024-11-13 14:33:33,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:33:33,521 INFO L471 AbstractCegarLoop]: Abstraction has 4801 states and 6939 transitions. [2024-11-13 14:33:33,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.052631578947368) internal successors, (115), 19 states have internal predecessors, (115), 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 14:33:33,521 INFO L276 IsEmpty]: Start isEmpty. Operand 4801 states and 6939 transitions. [2024-11-13 14:33:33,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 14:33:33,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:33:33,522 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:33:33,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-13 14:33:33,522 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr118REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-13 14:33:33,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:33,523 INFO L85 PathProgramCache]: Analyzing trace with hash -318806800, now seen corresponding path program 1 times [2024-11-13 14:33:33,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:33,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695447061] [2024-11-13 14:33:33,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:33,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:37,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:33:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:37,631 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 14:33:37,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:37,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695447061] [2024-11-13 14:33:37,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695447061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:37,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:37,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-13 14:33:37,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039040648] [2024-11-13 14:33:37,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:37,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 14:33:37,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:37,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 14:33:37,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-13 14:33:37,633 INFO L87 Difference]: Start difference. First operand 4801 states and 6939 transitions. Second operand has 20 states, 19 states have (on average 6.052631578947368) internal successors, (115), 19 states have internal predecessors, (115), 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)