./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85fe539c4a9811cd5d49f239f4680cc0b3752a2958e9f287c34e302b923af4f9 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:32:44,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:32:44,936 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 04:32:44,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:32:44,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:32:44,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:32:44,972 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:32:44,972 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:32:44,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:32:44,973 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:32:44,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:32:44,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:32:44,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:32:44,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:32:44,973 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:32:44,974 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:32:44,974 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:32:44,974 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:32:44,974 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:32:44,974 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:32:44,975 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 04:32:44,975 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 04:32:44,975 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 04:32:44,975 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:32:44,975 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 04:32:44,975 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 04:32:44,975 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:32:44,976 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:32:44,976 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:32:44,976 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:32:44,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:32:44,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:32:44,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:32:44,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:32:44,977 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:32:44,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:32:44,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:32:44,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:32:44,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:32:44,977 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:32:44,977 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:32:44,978 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 04:32:44,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 04:32:44,978 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:32:44,978 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:32:44,978 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:32:44,978 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:32:44,978 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_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 85fe539c4a9811cd5d49f239f4680cc0b3752a2958e9f287c34e302b923af4f9 [2024-11-28 04:32:45,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:32:45,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:32:45,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:32:45,255 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:32:45,256 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:32:45,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i [2024-11-28 04:32:48,300 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/data/d836b188a/e26966d56d304fa682eeb8320d83277a/FLAG3258a054a [2024-11-28 04:32:48,746 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:32:48,749 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i [2024-11-28 04:32:48,778 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/data/d836b188a/e26966d56d304fa682eeb8320d83277a/FLAG3258a054a [2024-11-28 04:32:48,864 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/data/d836b188a/e26966d56d304fa682eeb8320d83277a [2024-11-28 04:32:48,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:32:48,870 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:32:48,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:32:48,872 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:32:48,877 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:32:48,878 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:32:48" (1/1) ... [2024-11-28 04:32:48,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@248644ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:32:48, skipping insertion in model container [2024-11-28 04:32:48,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:32:48" (1/1) ... [2024-11-28 04:32:48,947 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:32:49,390 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:32:49,424 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:32:49,428 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:32:49,432 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:32:49,440 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:32:49,480 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:32:49,483 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:32:49,489 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:32:49,497 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:32:49,528 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:32:49,529 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:32:49,532 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:32:49,536 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:32:49,574 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:32:49,574 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:32:49,577 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:32:49,577 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:32:49,597 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:32:49,597 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:32:49,604 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:32:49,604 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:32:49,631 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:32:49,633 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:32:49,636 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:32:49,636 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:32:49,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:32:49,677 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:32:49,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:32:49,909 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:32:49,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:32:49 WrapperNode [2024-11-28 04:32:49,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:32:49,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:32:49,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:32:49,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:32:49,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:32:49" (1/1) ... [2024-11-28 04:32:49,955 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:32:49" (1/1) ... [2024-11-28 04:32:50,086 INFO L138 Inliner]: procedures = 177, calls = 507, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3362 [2024-11-28 04:32:50,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:32:50,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:32:50,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:32:50,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:32:50,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:32:49" (1/1) ... [2024-11-28 04:32:50,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:32:49" (1/1) ... [2024-11-28 04:32:50,112 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:32:49" (1/1) ... [2024-11-28 04:32:50,272 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-28 04:32:50,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:32:49" (1/1) ... [2024-11-28 04:32:50,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:32:49" (1/1) ... [2024-11-28 04:32:50,360 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:32:49" (1/1) ... [2024-11-28 04:32:50,364 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:32:49" (1/1) ... [2024-11-28 04:32:50,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:32:49" (1/1) ... [2024-11-28 04:32:50,399 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:32:49" (1/1) ... [2024-11-28 04:32:50,413 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:32:49" (1/1) ... [2024-11-28 04:32:50,444 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:32:50,447 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:32:50,447 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:32:50,447 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:32:50,448 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:32:49" (1/1) ... [2024-11-28 04:32:50,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:32:50,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:32:50,493 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:32:50,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:32:50,581 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-11-28 04:32:50,581 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-11-28 04:32:50,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 04:32:50,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 04:32:50,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 04:32:50,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-28 04:32:50,583 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-28 04:32:50,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 04:32:50,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 04:32:50,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 04:32:50,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-28 04:32:50,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-28 04:32:50,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-28 04:32:50,584 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-28 04:32:50,584 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-28 04:32:50,584 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-28 04:32:50,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 04:32:50,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:32:50,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 04:32:50,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 04:32:50,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 04:32:50,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 04:32:50,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 04:32:50,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 04:32:50,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 04:32:50,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 04:32:50,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 04:32:50,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 04:32:50,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 04:32:50,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:32:50,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:32:50,959 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:32:50,962 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:32:51,044 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 04:32:51,079 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 04:32:51,101 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 04:32:56,634 INFO L? ?]: Removed 2487 outVars from TransFormulas that were not future-live. [2024-11-28 04:32:56,635 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:32:56,705 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:32:56,705 INFO L312 CfgBuilder]: Removed 85 assume(true) statements. [2024-11-28 04:32:56,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:32:56 BoogieIcfgContainer [2024-11-28 04:32:56,706 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:32:56,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:32:56,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:32:56,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:32:56,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:32:48" (1/3) ... [2024-11-28 04:32:56,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e33377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:32:56, skipping insertion in model container [2024-11-28 04:32:56,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:32:49" (2/3) ... [2024-11-28 04:32:56,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e33377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:32:56, skipping insertion in model container [2024-11-28 04:32:56,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:32:56" (3/3) ... [2024-11-28 04:32:56,718 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test10-1.i [2024-11-28 04:32:56,736 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:32:56,738 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test10-1.i that has 6 procedures, 2661 locations, 1 initial locations, 84 loop locations, and 986 error locations. [2024-11-28 04:32:56,843 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:32:56,854 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;@6cf94cfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:32:56,855 INFO L334 AbstractCegarLoop]: Starting to check reachability of 986 error locations. [2024-11-28 04:32:56,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 2651 states, 1653 states have (on average 1.9770114942528736) internal successors, (3268), 2637 states have internal predecessors, (3268), 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-28 04:32:56,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 04:32:56,875 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:32:56,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 04:32:56,876 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-28 04:32:56,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:32:56,883 INFO L85 PathProgramCache]: Analyzing trace with hash 84472, now seen corresponding path program 1 times [2024-11-28 04:32:56,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:32:56,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973696518] [2024-11-28 04:32:56,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:32:56,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:32:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:32:57,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:32:57,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:32:57,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973696518] [2024-11-28 04:32:57,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973696518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:32:57,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:32:57,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:32:57,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819756115] [2024-11-28 04:32:57,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:32:57,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:32:57,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:32:57,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:32:57,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:32:57,184 INFO L87 Difference]: Start difference. First operand has 2651 states, 1653 states have (on average 1.9770114942528736) internal successors, (3268), 2637 states have internal predecessors, (3268), 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-28 04:32:59,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:32:59,403 INFO L93 Difference]: Finished difference Result 3237 states and 3808 transitions. [2024-11-28 04:32:59,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:32:59,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-28 04:32:59,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:32:59,435 INFO L225 Difference]: With dead ends: 3237 [2024-11-28 04:32:59,435 INFO L226 Difference]: Without dead ends: 3235 [2024-11-28 04:32:59,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:32:59,443 INFO L435 NwaCegarLoop]: 2198 mSDtfsCounter, 2870 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2880 SdHoareTripleChecker+Valid, 2735 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-28 04:32:59,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2880 Valid, 2735 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-28 04:32:59,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3235 states. [2024-11-28 04:32:59,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3235 to 2888. [2024-11-28 04:32:59,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2888 states, 1918 states have (on average 1.8665276329509906) internal successors, (3580), 2872 states have internal predecessors, (3580), 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-28 04:32:59,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 3612 transitions. [2024-11-28 04:32:59,644 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 3612 transitions. Word has length 3 [2024-11-28 04:32:59,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:32:59,644 INFO L471 AbstractCegarLoop]: Abstraction has 2888 states and 3612 transitions. [2024-11-28 04:32:59,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:32:59,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 3612 transitions. [2024-11-28 04:32:59,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 04:32:59,645 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:32:59,645 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 04:32:59,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 04:32:59,646 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-28 04:32:59,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:32:59,647 INFO L85 PathProgramCache]: Analyzing trace with hash 84473, now seen corresponding path program 1 times [2024-11-28 04:32:59,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:32:59,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906223314] [2024-11-28 04:32:59,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:32:59,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:32:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:32:59,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:32:59,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:32:59,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906223314] [2024-11-28 04:32:59,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906223314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:32:59,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:32:59,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:32:59,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933598474] [2024-11-28 04:32:59,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:32:59,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:32:59,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:32:59,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:32:59,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:32:59,777 INFO L87 Difference]: Start difference. First operand 2888 states and 3612 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:33:02,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:33:02,407 INFO L93 Difference]: Finished difference Result 4958 states and 6135 transitions. [2024-11-28 04:33:02,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:33:02,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-28 04:33:02,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:33:02,427 INFO L225 Difference]: With dead ends: 4958 [2024-11-28 04:33:02,427 INFO L226 Difference]: Without dead ends: 4958 [2024-11-28 04:33:02,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:33:02,428 INFO L435 NwaCegarLoop]: 2400 mSDtfsCounter, 2503 mSDsluCounter, 2109 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2510 SdHoareTripleChecker+Valid, 4509 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:33:02,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2510 Valid, 4509 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-28 04:33:02,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2024-11-28 04:33:02,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 4282. [2024-11-28 04:33:02,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4282 states, 3310 states have (on average 1.8347432024169184) internal successors, (6073), 4259 states have internal predecessors, (6073), 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-28 04:33:02,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4282 states to 4282 states and 6119 transitions. [2024-11-28 04:33:02,569 INFO L78 Accepts]: Start accepts. Automaton has 4282 states and 6119 transitions. Word has length 3 [2024-11-28 04:33:02,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:33:02,569 INFO L471 AbstractCegarLoop]: Abstraction has 4282 states and 6119 transitions. [2024-11-28 04:33:02,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:33:02,569 INFO L276 IsEmpty]: Start isEmpty. Operand 4282 states and 6119 transitions. [2024-11-28 04:33:02,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 04:33:02,570 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:33:02,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:33:02,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 04:33:02,570 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-28 04:33:02,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:33:02,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1567526949, now seen corresponding path program 1 times [2024-11-28 04:33:02,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:33:02,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380089580] [2024-11-28 04:33:02,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:33:02,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:33:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:33:02,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:33:02,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:33:02,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380089580] [2024-11-28 04:33:02,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380089580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:33:02,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:33:02,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:33:02,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20482664] [2024-11-28 04:33:02,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:33:02,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:33:02,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:33:02,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:33:02,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:33:02,734 INFO L87 Difference]: Start difference. First operand 4282 states and 6119 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:33:04,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:33:04,568 INFO L93 Difference]: Finished difference Result 5367 states and 7441 transitions. [2024-11-28 04:33:04,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:33:04,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-11-28 04:33:04,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:33:04,587 INFO L225 Difference]: With dead ends: 5367 [2024-11-28 04:33:04,587 INFO L226 Difference]: Without dead ends: 5367 [2024-11-28 04:33:04,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:33:04,589 INFO L435 NwaCegarLoop]: 3530 mSDtfsCounter, 2841 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2851 SdHoareTripleChecker+Valid, 4700 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:33:04,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2851 Valid, 4700 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-28 04:33:04,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5367 states. [2024-11-28 04:33:04,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5367 to 4190. [2024-11-28 04:33:04,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4190 states, 3310 states have (on average 1.786404833836858) internal successors, (5913), 4167 states have internal predecessors, (5913), 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-28 04:33:04,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 5959 transitions. [2024-11-28 04:33:04,687 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 5959 transitions. Word has length 9 [2024-11-28 04:33:04,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:33:04,687 INFO L471 AbstractCegarLoop]: Abstraction has 4190 states and 5959 transitions. [2024-11-28 04:33:04,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:33:04,687 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 5959 transitions. [2024-11-28 04:33:04,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 04:33:04,688 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:33:04,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:33:04,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 04:33:04,688 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-28 04:33:04,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:33:04,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1567526950, now seen corresponding path program 1 times [2024-11-28 04:33:04,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:33:04,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793951506] [2024-11-28 04:33:04,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:33:04,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:33:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:33:04,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:33:04,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:33:04,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793951506] [2024-11-28 04:33:04,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793951506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:33:04,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:33:04,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:33:04,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88336773] [2024-11-28 04:33:04,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:33:04,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:33:04,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:33:04,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:33:04,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:33:04,860 INFO L87 Difference]: Start difference. First operand 4190 states and 5959 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:33:06,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:33:06,836 INFO L93 Difference]: Finished difference Result 6927 states and 9910 transitions. [2024-11-28 04:33:06,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:33:06,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-11-28 04:33:06,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:33:06,856 INFO L225 Difference]: With dead ends: 6927 [2024-11-28 04:33:06,856 INFO L226 Difference]: Without dead ends: 6927 [2024-11-28 04:33:06,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:33:06,857 INFO L435 NwaCegarLoop]: 3886 mSDtfsCounter, 2320 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2324 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, 1.9s IncrementalHoareTripleChecker+Time [2024-11-28 04:33:06,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2324 Valid, 5665 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-28 04:33:06,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6927 states. [2024-11-28 04:33:06,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6927 to 4722. [2024-11-28 04:33:06,979 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-28 04:33:06,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4722 states to 4722 states and 6903 transitions. [2024-11-28 04:33:06,991 INFO L78 Accepts]: Start accepts. Automaton has 4722 states and 6903 transitions. Word has length 9 [2024-11-28 04:33:06,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:33:06,991 INFO L471 AbstractCegarLoop]: Abstraction has 4722 states and 6903 transitions. [2024-11-28 04:33:06,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:33:06,992 INFO L276 IsEmpty]: Start isEmpty. Operand 4722 states and 6903 transitions. [2024-11-28 04:33:06,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 04:33:06,992 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:33:06,992 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:33:06,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 04:33:06,992 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-28 04:33:06,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:33:06,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1797781972, now seen corresponding path program 1 times [2024-11-28 04:33:06,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:33:06,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414202826] [2024-11-28 04:33:06,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:33:06,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:33:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:33:07,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:33:07,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:33:07,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414202826] [2024-11-28 04:33:07,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414202826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:33:07,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:33:07,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:33:07,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586944655] [2024-11-28 04:33:07,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:33:07,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:33:07,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:33:07,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:33:07,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:33:07,127 INFO L87 Difference]: Start difference. First operand 4722 states and 6903 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-28 04:33:07,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:33:07,432 INFO L93 Difference]: Finished difference Result 6560 states and 9346 transitions. [2024-11-28 04:33:07,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:33:07,433 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-28 04:33:07,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:33:07,462 INFO L225 Difference]: With dead ends: 6560 [2024-11-28 04:33:07,466 INFO L226 Difference]: Without dead ends: 6560 [2024-11-28 04:33:07,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:33:07,467 INFO L435 NwaCegarLoop]: 3443 mSDtfsCounter, 1450 mSDsluCounter, 6292 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1456 SdHoareTripleChecker+Valid, 9735 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.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:33:07,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1456 Valid, 9735 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:33:07,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6560 states. [2024-11-28 04:33:07,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6560 to 4724. [2024-11-28 04:33:07,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4724 states, 3854 states have (on average 1.7797093928386092) internal successors, (6859), 4701 states have internal predecessors, (6859), 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-28 04:33:07,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4724 states to 4724 states and 6905 transitions. [2024-11-28 04:33:07,603 INFO L78 Accepts]: Start accepts. Automaton has 4724 states and 6905 transitions. Word has length 11 [2024-11-28 04:33:07,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:33:07,603 INFO L471 AbstractCegarLoop]: Abstraction has 4724 states and 6905 transitions. [2024-11-28 04:33:07,603 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-28 04:33:07,603 INFO L276 IsEmpty]: Start isEmpty. Operand 4724 states and 6905 transitions. [2024-11-28 04:33:07,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-28 04:33:07,604 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:33:07,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:33:07,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 04:33:07,605 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr324REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:33:07,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:33:07,606 INFO L85 PathProgramCache]: Analyzing trace with hash 494071061, now seen corresponding path program 1 times [2024-11-28 04:33:07,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:33:07,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343449254] [2024-11-28 04:33:07,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:33:07,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:33:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:33:07,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:33:07,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:33:07,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343449254] [2024-11-28 04:33:07,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343449254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:33:07,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:33:07,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:33:07,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610949504] [2024-11-28 04:33:07,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:33:07,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:33:07,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:33:07,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:33:07,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:33:07,778 INFO L87 Difference]: Start difference. First operand 4724 states and 6905 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:33:08,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:33:08,071 INFO L93 Difference]: Finished difference Result 6560 states and 9345 transitions. [2024-11-28 04:33:08,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:33:08,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2024-11-28 04:33:08,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:33:08,089 INFO L225 Difference]: With dead ends: 6560 [2024-11-28 04:33:08,090 INFO L226 Difference]: Without dead ends: 6560 [2024-11-28 04:33:08,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:33:08,090 INFO L435 NwaCegarLoop]: 2984 mSDtfsCounter, 1438 mSDsluCounter, 5833 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 8817 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.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:33:08,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1444 Valid, 8817 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:33:08,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6560 states. [2024-11-28 04:33:08,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6560 to 4735. [2024-11-28 04:33:08,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4735 states, 3865 states have (on average 1.777490297542044) internal successors, (6870), 4712 states have internal predecessors, (6870), 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-28 04:33:08,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4735 states to 4735 states and 6916 transitions. [2024-11-28 04:33:08,177 INFO L78 Accepts]: Start accepts. Automaton has 4735 states and 6916 transitions. Word has length 21 [2024-11-28 04:33:08,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:33:08,177 INFO L471 AbstractCegarLoop]: Abstraction has 4735 states and 6916 transitions. [2024-11-28 04:33:08,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:33:08,177 INFO L276 IsEmpty]: Start isEmpty. Operand 4735 states and 6916 transitions. [2024-11-28 04:33:08,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-28 04:33:08,178 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:33:08,178 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:33:08,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 04:33:08,178 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:33:08,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:33:08,179 INFO L85 PathProgramCache]: Analyzing trace with hash -2007176747, now seen corresponding path program 1 times [2024-11-28 04:33:08,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:33:08,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476599971] [2024-11-28 04:33:08,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:33:08,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:33:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:33:08,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:33:08,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:33:08,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476599971] [2024-11-28 04:33:08,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476599971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:33:08,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:33:08,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:33:08,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659065084] [2024-11-28 04:33:08,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:33:08,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:33:08,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:33:08,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:33:08,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:33:08,344 INFO L87 Difference]: Start difference. First operand 4735 states and 6916 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:33:10,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:33:10,175 INFO L93 Difference]: Finished difference Result 4810 states and 7022 transitions. [2024-11-28 04:33:10,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:33:10,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2024-11-28 04:33:10,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:33:10,189 INFO L225 Difference]: With dead ends: 4810 [2024-11-28 04:33:10,189 INFO L226 Difference]: Without dead ends: 4810 [2024-11-28 04:33:10,189 INFO L434 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-28 04:33:10,190 INFO L435 NwaCegarLoop]: 2027 mSDtfsCounter, 3104 mSDsluCounter, 1903 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3114 SdHoareTripleChecker+Valid, 3930 SdHoareTripleChecker+Invalid, 2041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:33:10,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3114 Valid, 3930 Invalid, 2041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2009 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-28 04:33:10,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2024-11-28 04:33:10,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4712. [2024-11-28 04:33:10,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4712 states, 3865 states have (on average 1.765588615782665) internal successors, (6824), 4689 states have internal predecessors, (6824), 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-28 04:33:10,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4712 states to 4712 states and 6870 transitions. [2024-11-28 04:33:10,286 INFO L78 Accepts]: Start accepts. Automaton has 4712 states and 6870 transitions. Word has length 21 [2024-11-28 04:33:10,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:33:10,287 INFO L471 AbstractCegarLoop]: Abstraction has 4712 states and 6870 transitions. [2024-11-28 04:33:10,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:33:10,287 INFO L276 IsEmpty]: Start isEmpty. Operand 4712 states and 6870 transitions. [2024-11-28 04:33:10,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-28 04:33:10,289 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:33:10,289 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:33:10,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 04:33:10,289 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:33:10,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:33:10,290 INFO L85 PathProgramCache]: Analyzing trace with hash -2007176746, now seen corresponding path program 1 times [2024-11-28 04:33:10,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:33:10,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876417063] [2024-11-28 04:33:10,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:33:10,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:33:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:33:10,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:33:10,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:33:10,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876417063] [2024-11-28 04:33:10,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876417063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:33:10,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:33:10,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:33:10,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511276797] [2024-11-28 04:33:10,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:33:10,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:33:10,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:33:10,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:33:10,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:33:10,432 INFO L87 Difference]: Start difference. First operand 4712 states and 6870 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:33:10,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:33:10,500 INFO L93 Difference]: Finished difference Result 4574 states and 6664 transitions. [2024-11-28 04:33:10,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:33:10,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2024-11-28 04:33:10,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:33:10,513 INFO L225 Difference]: With dead ends: 4574 [2024-11-28 04:33:10,513 INFO L226 Difference]: Without dead ends: 4574 [2024-11-28 04:33:10,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:33:10,514 INFO L435 NwaCegarLoop]: 2857 mSDtfsCounter, 61 mSDsluCounter, 2804 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 5661 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-28 04:33:10,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 5661 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:33:10,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2024-11-28 04:33:10,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 4574. [2024-11-28 04:33:10,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4574 states, 3739 states have (on average 1.7699919764642953) internal successors, (6618), 4551 states have internal predecessors, (6618), 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-28 04:33:10,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4574 states to 4574 states and 6664 transitions. [2024-11-28 04:33:10,594 INFO L78 Accepts]: Start accepts. Automaton has 4574 states and 6664 transitions. Word has length 21 [2024-11-28 04:33:10,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:33:10,595 INFO L471 AbstractCegarLoop]: Abstraction has 4574 states and 6664 transitions. [2024-11-28 04:33:10,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:33:10,596 INFO L276 IsEmpty]: Start isEmpty. Operand 4574 states and 6664 transitions. [2024-11-28 04:33:10,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-28 04:33:10,596 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:33:10,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:33:10,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 04:33:10,597 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-28 04:33:10,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:33:10,597 INFO L85 PathProgramCache]: Analyzing trace with hash -456258833, now seen corresponding path program 1 times [2024-11-28 04:33:10,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:33:10,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594108026] [2024-11-28 04:33:10,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:33:10,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:33:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:33:10,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:33:10,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:33:10,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594108026] [2024-11-28 04:33:10,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594108026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:33:10,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:33:10,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:33:10,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697826966] [2024-11-28 04:33:10,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:33:10,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:33:10,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:33:10,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:33:10,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:33:10,692 INFO L87 Difference]: Start difference. First operand 4574 states and 6664 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:33:10,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:33:10,798 INFO L93 Difference]: Finished difference Result 4545 states and 6614 transitions. [2024-11-28 04:33:10,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:33:10,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2024-11-28 04:33:10,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:33:10,808 INFO L225 Difference]: With dead ends: 4545 [2024-11-28 04:33:10,809 INFO L226 Difference]: Without dead ends: 4545 [2024-11-28 04:33:10,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:33:10,809 INFO L435 NwaCegarLoop]: 2822 mSDtfsCounter, 41 mSDsluCounter, 5616 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 8438 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:33:10,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 8438 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:33:10,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4545 states. [2024-11-28 04:33:10,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4545 to 4539. [2024-11-28 04:33:10,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4539 states, 3711 states have (on average 1.7682565346267853) internal successors, (6562), 4516 states have internal predecessors, (6562), 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-28 04:33:10,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4539 states to 4539 states and 6608 transitions. [2024-11-28 04:33:10,871 INFO L78 Accepts]: Start accepts. Automaton has 4539 states and 6608 transitions. Word has length 23 [2024-11-28 04:33:10,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:33:10,872 INFO L471 AbstractCegarLoop]: Abstraction has 4539 states and 6608 transitions. [2024-11-28 04:33:10,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:33:10,872 INFO L276 IsEmpty]: Start isEmpty. Operand 4539 states and 6608 transitions. [2024-11-28 04:33:10,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 04:33:10,872 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:33:10,873 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:33:10,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 04:33:10,873 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-28 04:33:10,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:33:10,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1116825789, now seen corresponding path program 1 times [2024-11-28 04:33:10,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:33:10,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613214068] [2024-11-28 04:33:10,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:33:10,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:33:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:33:11,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:33:11,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:33:11,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613214068] [2024-11-28 04:33:11,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613214068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:33:11,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:33:11,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:33:11,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539601004] [2024-11-28 04:33:11,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:33:11,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:33:11,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:33:11,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:33:11,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:33:11,155 INFO L87 Difference]: Start difference. First operand 4539 states and 6608 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:33:13,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:33:13,636 INFO L93 Difference]: Finished difference Result 6838 states and 9759 transitions. [2024-11-28 04:33:13,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:33:13,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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 37 [2024-11-28 04:33:13,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:33:13,652 INFO L225 Difference]: With dead ends: 6838 [2024-11-28 04:33:13,652 INFO L226 Difference]: Without dead ends: 6838 [2024-11-28 04:33:13,652 INFO L434 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-28 04:33:13,653 INFO L435 NwaCegarLoop]: 2293 mSDtfsCounter, 2319 mSDsluCounter, 3652 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2323 SdHoareTripleChecker+Valid, 5945 SdHoareTripleChecker+Invalid, 2386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:33:13,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2323 Valid, 5945 Invalid, 2386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2383 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-28 04:33:13,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6838 states. [2024-11-28 04:33:13,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6838 to 4535. [2024-11-28 04:33:13,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4535 states, 3711 states have (on average 1.7661007814605227) internal successors, (6554), 4512 states have internal predecessors, (6554), 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-28 04:33:13,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4535 states to 4535 states and 6600 transitions. [2024-11-28 04:33:13,725 INFO L78 Accepts]: Start accepts. Automaton has 4535 states and 6600 transitions. Word has length 37 [2024-11-28 04:33:13,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:33:13,725 INFO L471 AbstractCegarLoop]: Abstraction has 4535 states and 6600 transitions. [2024-11-28 04:33:13,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:33:13,725 INFO L276 IsEmpty]: Start isEmpty. Operand 4535 states and 6600 transitions. [2024-11-28 04:33:13,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-28 04:33:13,727 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:33:13,727 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:33:13,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 04:33:13,728 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-28 04:33:13,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:33:13,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1260687181, now seen corresponding path program 1 times [2024-11-28 04:33:13,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:33:13,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564548727] [2024-11-28 04:33:13,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:33:13,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:33:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:33:13,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:33:13,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:33:13,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564548727] [2024-11-28 04:33:13,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564548727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:33:13,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:33:13,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:33:13,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101552110] [2024-11-28 04:33:13,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:33:13,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:33:13,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:33:13,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:33:13,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:33:13,895 INFO L87 Difference]: Start difference. First operand 4535 states and 6600 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:33:13,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:33:13,976 INFO L93 Difference]: Finished difference Result 4535 states and 6592 transitions. [2024-11-28 04:33:13,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:33:13,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 71 [2024-11-28 04:33:13,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:33:13,987 INFO L225 Difference]: With dead ends: 4535 [2024-11-28 04:33:13,987 INFO L226 Difference]: Without dead ends: 4535 [2024-11-28 04:33:13,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:33:13,988 INFO L435 NwaCegarLoop]: 2817 mSDtfsCounter, 21 mSDsluCounter, 5603 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8420 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-28 04:33:13,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8420 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:33:13,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4535 states. [2024-11-28 04:33:14,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4535 to 4535. [2024-11-28 04:33:14,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4535 states, 3711 states have (on average 1.7639450282942604) internal successors, (6546), 4512 states have internal predecessors, (6546), 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-28 04:33:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4535 states to 4535 states and 6592 transitions. [2024-11-28 04:33:14,082 INFO L78 Accepts]: Start accepts. Automaton has 4535 states and 6592 transitions. Word has length 71 [2024-11-28 04:33:14,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:33:14,082 INFO L471 AbstractCegarLoop]: Abstraction has 4535 states and 6592 transitions. [2024-11-28 04:33:14,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:33:14,083 INFO L276 IsEmpty]: Start isEmpty. Operand 4535 states and 6592 transitions. [2024-11-28 04:33:14,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-28 04:33:14,087 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:33:14,087 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:33:14,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 04:33:14,088 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-28 04:33:14,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:33:14,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1330640513, now seen corresponding path program 1 times [2024-11-28 04:33:14,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:33:14,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303019217] [2024-11-28 04:33:14,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:33:14,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:33:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:33:14,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:33:14,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:33:14,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303019217] [2024-11-28 04:33:14,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303019217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:33:14,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:33:14,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:33:14,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429956941] [2024-11-28 04:33:14,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:33:14,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:33:14,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:33:14,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:33:14,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:33:14,276 INFO L87 Difference]: Start difference. First operand 4535 states and 6592 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:33:14,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:33:14,395 INFO L93 Difference]: Finished difference Result 6039 states and 8771 transitions. [2024-11-28 04:33:14,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:33:14,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 79 [2024-11-28 04:33:14,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:33:14,413 INFO L225 Difference]: With dead ends: 6039 [2024-11-28 04:33:14,414 INFO L226 Difference]: Without dead ends: 6039 [2024-11-28 04:33:14,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:33:14,415 INFO L435 NwaCegarLoop]: 2836 mSDtfsCounter, 1083 mSDsluCounter, 2770 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 5606 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-28 04:33:14,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 5606 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:33:14,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6039 states. [2024-11-28 04:33:14,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6039 to 5388. [2024-11-28 04:33:14,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5388 states, 4560 states have (on average 1.7464912280701754) internal successors, (7964), 5361 states have internal predecessors, (7964), 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-28 04:33:14,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5388 states to 5388 states and 8018 transitions. [2024-11-28 04:33:14,499 INFO L78 Accepts]: Start accepts. Automaton has 5388 states and 8018 transitions. Word has length 79 [2024-11-28 04:33:14,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:33:14,500 INFO L471 AbstractCegarLoop]: Abstraction has 5388 states and 8018 transitions. [2024-11-28 04:33:14,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:33:14,500 INFO L276 IsEmpty]: Start isEmpty. Operand 5388 states and 8018 transitions. [2024-11-28 04:33:14,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-28 04:33:14,503 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:33:14,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:33:14,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 04:33:14,504 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-28 04:33:14,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:33:14,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1327628103, now seen corresponding path program 1 times [2024-11-28 04:33:14,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:33:14,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163514910] [2024-11-28 04:33:14,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:33:14,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:33:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:33:15,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:33:15,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:33:15,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163514910] [2024-11-28 04:33:15,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163514910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:33:15,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:33:15,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:33:15,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266302848] [2024-11-28 04:33:15,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:33:15,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:33:15,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:33:15,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:33:15,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:33:15,160 INFO L87 Difference]: Start difference. First operand 5388 states and 8018 transitions. Second operand has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:33:17,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:33:17,323 INFO L93 Difference]: Finished difference Result 5304 states and 7876 transitions. [2024-11-28 04:33:17,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:33:17,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 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 82 [2024-11-28 04:33:17,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:33:17,337 INFO L225 Difference]: With dead ends: 5304 [2024-11-28 04:33:17,337 INFO L226 Difference]: Without dead ends: 5304 [2024-11-28 04:33:17,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:33:17,338 INFO L435 NwaCegarLoop]: 1551 mSDtfsCounter, 2658 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 2463 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2668 SdHoareTripleChecker+Valid, 3109 SdHoareTripleChecker+Invalid, 2556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:33:17,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2668 Valid, 3109 Invalid, 2556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2463 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-28 04:33:17,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5304 states. [2024-11-28 04:33:17,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5304 to 4762. [2024-11-28 04:33:17,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4762 states, 4018 states have (on average 1.70681931309109) internal successors, (6858), 4735 states have internal predecessors, (6858), 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-28 04:33:17,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4762 states to 4762 states and 6912 transitions. [2024-11-28 04:33:17,415 INFO L78 Accepts]: Start accepts. Automaton has 4762 states and 6912 transitions. Word has length 82 [2024-11-28 04:33:17,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:33:17,415 INFO L471 AbstractCegarLoop]: Abstraction has 4762 states and 6912 transitions. [2024-11-28 04:33:17,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:33:17,416 INFO L276 IsEmpty]: Start isEmpty. Operand 4762 states and 6912 transitions. [2024-11-28 04:33:17,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-28 04:33:17,416 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:33:17,417 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:33:17,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 04:33:17,417 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-28 04:33:17,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:33:17,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1108578542, now seen corresponding path program 1 times [2024-11-28 04:33:17,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:33:17,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062618210] [2024-11-28 04:33:17,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:33:17,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:33:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:33:17,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:33:17,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:33:17,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062618210] [2024-11-28 04:33:17,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062618210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:33:17,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:33:17,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:33:17,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643019214] [2024-11-28 04:33:17,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:33:17,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:33:17,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:33:17,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:33:17,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:33:17,767 INFO L87 Difference]: Start difference. First operand 4762 states and 6912 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:33:19,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:33:19,417 INFO L93 Difference]: Finished difference Result 4761 states and 6910 transitions. [2024-11-28 04:33:19,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:33:19,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 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 87 [2024-11-28 04:33:19,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:33:19,428 INFO L225 Difference]: With dead ends: 4761 [2024-11-28 04:33:19,429 INFO L226 Difference]: Without dead ends: 4761 [2024-11-28 04:33:19,429 INFO L434 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-28 04:33:19,429 INFO L435 NwaCegarLoop]: 2744 mSDtfsCounter, 2 mSDsluCounter, 5747 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8491 SdHoareTripleChecker+Invalid, 2493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:33:19,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8491 Invalid, 2493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-28 04:33:19,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4761 states. [2024-11-28 04:33:19,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4761 to 4761. [2024-11-28 04:33:19,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4761 states, 4018 states have (on average 1.7063215530114484) internal successors, (6856), 4734 states have internal predecessors, (6856), 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-28 04:33:19,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4761 states to 4761 states and 6910 transitions. [2024-11-28 04:33:19,495 INFO L78 Accepts]: Start accepts. Automaton has 4761 states and 6910 transitions. Word has length 87 [2024-11-28 04:33:19,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:33:19,495 INFO L471 AbstractCegarLoop]: Abstraction has 4761 states and 6910 transitions. [2024-11-28 04:33:19,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:33:19,496 INFO L276 IsEmpty]: Start isEmpty. Operand 4761 states and 6910 transitions. [2024-11-28 04:33:19,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-28 04:33:19,498 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:33:19,498 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:33:19,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 04:33:19,500 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-28 04:33:19,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:33:19,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1108578541, now seen corresponding path program 1 times [2024-11-28 04:33:19,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:33:19,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217165823] [2024-11-28 04:33:19,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:33:19,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:33:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:33:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:33:20,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:33:20,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217165823] [2024-11-28 04:33:20,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217165823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:33:20,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:33:20,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:33:20,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800751424] [2024-11-28 04:33:20,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:33:20,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:33:20,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:33:20,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:33:20,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:33:20,099 INFO L87 Difference]: Start difference. First operand 4761 states and 6910 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:33:22,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:33:22,333 INFO L93 Difference]: Finished difference Result 4760 states and 6908 transitions. [2024-11-28 04:33:22,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:33:22,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 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 87 [2024-11-28 04:33:22,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:33:22,343 INFO L225 Difference]: With dead ends: 4760 [2024-11-28 04:33:22,343 INFO L226 Difference]: Without dead ends: 4760 [2024-11-28 04:33:22,344 INFO L434 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-28 04:33:22,344 INFO L435 NwaCegarLoop]: 2744 mSDtfsCounter, 1 mSDsluCounter, 5721 mSDsCounter, 0 mSdLazyCounter, 2515 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 8465 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.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:33:22,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 8465 Invalid, 2516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2515 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-28 04:33:22,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4760 states. [2024-11-28 04:33:22,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4760 to 4760. [2024-11-28 04:33:22,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4760 states, 4016 states have (on average 1.7066733067729083) internal successors, (6854), 4733 states have internal predecessors, (6854), 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-28 04:33:22,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4760 states to 4760 states and 6908 transitions. [2024-11-28 04:33:22,409 INFO L78 Accepts]: Start accepts. Automaton has 4760 states and 6908 transitions. Word has length 87 [2024-11-28 04:33:22,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:33:22,409 INFO L471 AbstractCegarLoop]: Abstraction has 4760 states and 6908 transitions. [2024-11-28 04:33:22,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:33:22,410 INFO L276 IsEmpty]: Start isEmpty. Operand 4760 states and 6908 transitions. [2024-11-28 04:33:22,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-28 04:33:22,411 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:33:22,411 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:33:22,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 04:33:22,412 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-28 04:33:22,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:33:22,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1806705785, now seen corresponding path program 1 times [2024-11-28 04:33:22,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:33:22,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241465779] [2024-11-28 04:33:22,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:33:22,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:33:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:33:22,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:33:22,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:33:22,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241465779] [2024-11-28 04:33:22,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241465779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:33:22,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:33:22,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:33:22,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828215786] [2024-11-28 04:33:22,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:33:22,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:33:22,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:33:22,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:33:22,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:33:22,730 INFO L87 Difference]: Start difference. First operand 4760 states and 6908 transitions. Second operand has 7 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:33:24,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:33:24,805 INFO L93 Difference]: Finished difference Result 4778 states and 6941 transitions. [2024-11-28 04:33:24,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 04:33:24,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 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 95 [2024-11-28 04:33:24,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:33:24,827 INFO L225 Difference]: With dead ends: 4778 [2024-11-28 04:33:24,828 INFO L226 Difference]: Without dead ends: 4778 [2024-11-28 04:33:24,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:33:24,830 INFO L435 NwaCegarLoop]: 2708 mSDtfsCounter, 27 mSDsluCounter, 8674 mSDsCounter, 0 mSdLazyCounter, 2350 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 11382 SdHoareTripleChecker+Invalid, 2361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-28 04:33:24,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 11382 Invalid, 2361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2350 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-28 04:33:24,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4778 states. [2024-11-28 04:33:24,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4778 to 4769. [2024-11-28 04:33:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4769 states, 4024 states have (on average 1.706013916500994) internal successors, (6865), 4740 states have internal predecessors, (6865), 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-28 04:33:24,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4769 states to 4769 states and 6931 transitions. [2024-11-28 04:33:24,912 INFO L78 Accepts]: Start accepts. Automaton has 4769 states and 6931 transitions. Word has length 95 [2024-11-28 04:33:24,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:33:24,912 INFO L471 AbstractCegarLoop]: Abstraction has 4769 states and 6931 transitions. [2024-11-28 04:33:24,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:33:24,913 INFO L276 IsEmpty]: Start isEmpty. Operand 4769 states and 6931 transitions. [2024-11-28 04:33:24,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-28 04:33:24,914 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:33:24,914 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:33:24,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 04:33:24,914 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-28 04:33:24,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:33:24,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1806705786, now seen corresponding path program 1 times [2024-11-28 04:33:24,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:33:24,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982842355] [2024-11-28 04:33:24,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:33:24,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:33:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:33:25,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:33:25,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:33:25,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982842355] [2024-11-28 04:33:25,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982842355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:33:25,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:33:25,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:33:25,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332553427] [2024-11-28 04:33:25,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:33:25,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:33:25,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:33:25,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:33:25,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:33:25,563 INFO L87 Difference]: Start difference. First operand 4769 states and 6931 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:33:28,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:33:28,045 INFO L93 Difference]: Finished difference Result 4769 states and 6929 transitions. [2024-11-28 04:33:28,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:33:28,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 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 95 [2024-11-28 04:33:28,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:33:28,055 INFO L225 Difference]: With dead ends: 4769 [2024-11-28 04:33:28,056 INFO L226 Difference]: Without dead ends: 4769 [2024-11-28 04:33:28,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:33:28,056 INFO L435 NwaCegarLoop]: 2715 mSDtfsCounter, 22 mSDsluCounter, 8085 mSDsCounter, 0 mSdLazyCounter, 2892 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 10800 SdHoareTripleChecker+Invalid, 2901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:33:28,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 10800 Invalid, 2901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2892 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-28 04:33:28,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states. [2024-11-28 04:33:28,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 4769. [2024-11-28 04:33:28,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4769 states, 4024 states have (on average 1.70551689860835) internal successors, (6863), 4740 states have internal predecessors, (6863), 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-28 04:33:28,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4769 states to 4769 states and 6929 transitions. [2024-11-28 04:33:28,124 INFO L78 Accepts]: Start accepts. Automaton has 4769 states and 6929 transitions. Word has length 95 [2024-11-28 04:33:28,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:33:28,125 INFO L471 AbstractCegarLoop]: Abstraction has 4769 states and 6929 transitions. [2024-11-28 04:33:28,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:33:28,125 INFO L276 IsEmpty]: Start isEmpty. Operand 4769 states and 6929 transitions. [2024-11-28 04:33:28,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-28 04:33:28,126 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:33:28,126 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:33:28,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 04:33:28,126 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-28 04:33:28,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:33:28,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1922986770, now seen corresponding path program 1 times [2024-11-28 04:33:28,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:33:28,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428528567] [2024-11-28 04:33:28,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:33:28,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:33:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:33:28,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:33:28,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:33:28,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428528567] [2024-11-28 04:33:28,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428528567] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:33:28,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291136658] [2024-11-28 04:33:28,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:33:28,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:33:28,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:33:28,718 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:33:28,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 04:33:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:33:29,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-28 04:33:29,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:33:29,220 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:33:29,220 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-28 04:33:29,239 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-28 04:33:29,325 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:33:29,326 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-28 04:33:29,372 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-28 04:33:29,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:33:29,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:33:29,438 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-28 04:33:29,438 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-28 04:33:29,454 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_660 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_660) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_#t~mem55#1.base|)) is different from false [2024-11-28 04:33:29,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291136658] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:33:29,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:33:29,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2024-11-28 04:33:29,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848914868] [2024-11-28 04:33:29,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:33:29,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 04:33:29,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:33:29,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 04:33:29,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2024-11-28 04:33:29,459 INFO L87 Difference]: Start difference. First operand 4769 states and 6929 transitions. Second operand has 14 states, 12 states have (on average 9.083333333333334) internal successors, (109), 13 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:33:33,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:33:33,561 INFO L93 Difference]: Finished difference Result 4768 states and 6927 transitions. [2024-11-28 04:33:33,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 04:33:33,562 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 9.083333333333334) internal successors, (109), 13 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2024-11-28 04:33:33,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:33:33,575 INFO L225 Difference]: With dead ends: 4768 [2024-11-28 04:33:33,575 INFO L226 Difference]: Without dead ends: 4768 [2024-11-28 04:33:33,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=342, Unknown=1, NotChecked=38, Total=462 [2024-11-28 04:33:33,576 INFO L435 NwaCegarLoop]: 1894 mSDtfsCounter, 2684 mSDsluCounter, 13104 mSDsCounter, 0 mSdLazyCounter, 6965 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2702 SdHoareTripleChecker+Valid, 14998 SdHoareTripleChecker+Invalid, 6990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 6965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:33:33,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2702 Valid, 14998 Invalid, 6990 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 6965 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-28 04:33:33,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4768 states. [2024-11-28 04:33:33,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4768 to 4768. [2024-11-28 04:33:33,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4768 states, 4024 states have (on average 1.7050198807157058) internal successors, (6861), 4739 states have internal predecessors, (6861), 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-28 04:33:33,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4768 states to 4768 states and 6927 transitions. [2024-11-28 04:33:33,652 INFO L78 Accepts]: Start accepts. Automaton has 4768 states and 6927 transitions. Word has length 96 [2024-11-28 04:33:33,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:33:33,652 INFO L471 AbstractCegarLoop]: Abstraction has 4768 states and 6927 transitions. [2024-11-28 04:33:33,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 9.083333333333334) internal successors, (109), 13 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:33:33,652 INFO L276 IsEmpty]: Start isEmpty. Operand 4768 states and 6927 transitions. [2024-11-28 04:33:33,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-28 04:33:33,654 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:33:33,654 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:33:33,666 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 04:33:33,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-28 04:33:33,859 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-28 04:33:33,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:33:33,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1922986771, now seen corresponding path program 1 times [2024-11-28 04:33:33,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:33:33,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381271797] [2024-11-28 04:33:33,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:33:33,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:33:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:33:34,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:33:34,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:33:34,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381271797] [2024-11-28 04:33:34,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381271797] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:33:34,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622277169] [2024-11-28 04:33:34,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:33:34,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:33:34,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:33:34,761 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:33:34,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 04:33:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:33:35,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-28 04:33:35,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:33:35,218 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:33:35,218 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-28 04:33:35,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 04:33:35,261 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-28 04:33:35,265 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-28 04:33:35,367 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-28 04:33:35,372 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-28 04:33:35,502 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:33:35,502 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-28 04:33:35,513 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-28 04:33:35,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 31 treesize of output 13 [2024-11-28 04:33:35,570 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-28 04:33:35,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:33:35,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:33:35,706 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int))) (<= (+ 20 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_805) |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~mem55#1.base| v_ArrVal_804) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_805 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 04:33:35,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622277169] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:33:35,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:33:35,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2024-11-28 04:33:35,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126540348] [2024-11-28 04:33:35,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:33:35,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 04:33:35,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:33:35,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 04:33:35,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2024-11-28 04:33:35,712 INFO L87 Difference]: Start difference. First operand 4768 states and 6927 transitions. Second operand has 18 states, 15 states have (on average 8.066666666666666) internal successors, (121), 18 states have internal predecessors, (121), 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-28 04:33:42,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:33:42,464 INFO L93 Difference]: Finished difference Result 4775 states and 6933 transitions. [2024-11-28 04:33:42,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 04:33:42,465 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 8.066666666666666) internal successors, (121), 18 states have internal predecessors, (121), 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 96 [2024-11-28 04:33:42,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:33:42,473 INFO L225 Difference]: With dead ends: 4775 [2024-11-28 04:33:42,473 INFO L226 Difference]: Without dead ends: 4775 [2024-11-28 04:33:42,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=463, Unknown=1, NotChecked=44, Total=600 [2024-11-28 04:33:42,475 INFO L435 NwaCegarLoop]: 1899 mSDtfsCounter, 2677 mSDsluCounter, 14628 mSDsCounter, 0 mSdLazyCounter, 10927 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2695 SdHoareTripleChecker+Valid, 16527 SdHoareTripleChecker+Invalid, 10974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 10927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:33:42,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2695 Valid, 16527 Invalid, 10974 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [47 Valid, 10927 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-11-28 04:33:42,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4775 states. [2024-11-28 04:33:42,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4775 to 4763. [2024-11-28 04:33:42,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4763 states, 4020 states have (on average 1.705223880597015) internal successors, (6855), 4735 states have internal predecessors, (6855), 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-28 04:33:42,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4763 states to 4763 states and 6909 transitions. [2024-11-28 04:33:42,543 INFO L78 Accepts]: Start accepts. Automaton has 4763 states and 6909 transitions. Word has length 96 [2024-11-28 04:33:42,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:33:42,544 INFO L471 AbstractCegarLoop]: Abstraction has 4763 states and 6909 transitions. [2024-11-28 04:33:42,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 8.066666666666666) internal successors, (121), 18 states have internal predecessors, (121), 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-28 04:33:42,544 INFO L276 IsEmpty]: Start isEmpty. Operand 4763 states and 6909 transitions. [2024-11-28 04:33:42,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-28 04:33:42,545 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:33:42,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:33:42,555 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 04:33:42,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:33:42,749 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-28 04:33:42,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:33:42,750 INFO L85 PathProgramCache]: Analyzing trace with hash -957441234, now seen corresponding path program 1 times [2024-11-28 04:33:42,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:33:42,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437110111] [2024-11-28 04:33:42,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:33:42,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:33:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:33:43,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-28 04:33:43,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:33:43,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437110111] [2024-11-28 04:33:43,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437110111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:33:43,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:33:43,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 04:33:43,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18106658] [2024-11-28 04:33:43,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:33:43,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 04:33:43,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:33:43,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 04:33:43,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-28 04:33:43,368 INFO L87 Difference]: Start difference. First operand 4763 states and 6909 transitions. Second operand has 14 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:33:47,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:33:47,680 INFO L93 Difference]: Finished difference Result 4782 states and 6941 transitions. [2024-11-28 04:33:47,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 04:33:47,681 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-28 04:33:47,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:33:47,689 INFO L225 Difference]: With dead ends: 4782 [2024-11-28 04:33:47,689 INFO L226 Difference]: Without dead ends: 4782 [2024-11-28 04:33:47,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-28 04:33:47,690 INFO L435 NwaCegarLoop]: 1893 mSDtfsCounter, 2664 mSDsluCounter, 14948 mSDsCounter, 0 mSdLazyCounter, 7890 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2682 SdHoareTripleChecker+Valid, 16841 SdHoareTripleChecker+Invalid, 7913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 7890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:33:47,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2682 Valid, 16841 Invalid, 7913 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 7890 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-28 04:33:47,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4782 states. [2024-11-28 04:33:47,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4782 to 4778. [2024-11-28 04:33:47,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4778 states, 4034 states have (on average 1.7035200793257312) internal successors, (6872), 4748 states have internal predecessors, (6872), 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-28 04:33:47,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4778 states to 4778 states and 6928 transitions. [2024-11-28 04:33:47,772 INFO L78 Accepts]: Start accepts. Automaton has 4778 states and 6928 transitions. Word has length 98 [2024-11-28 04:33:47,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:33:47,773 INFO L471 AbstractCegarLoop]: Abstraction has 4778 states and 6928 transitions. [2024-11-28 04:33:47,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:33:47,773 INFO L276 IsEmpty]: Start isEmpty. Operand 4778 states and 6928 transitions. [2024-11-28 04:33:47,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-28 04:33:47,774 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:33:47,774 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:33:47,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 04:33:47,775 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-28 04:33:47,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:33:47,775 INFO L85 PathProgramCache]: Analyzing trace with hash -957441233, now seen corresponding path program 1 times [2024-11-28 04:33:47,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:33:47,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565945364] [2024-11-28 04:33:47,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:33:47,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:33:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:33:48,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:33:48,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:33:48,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565945364] [2024-11-28 04:33:48,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565945364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:33:48,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:33:48,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 04:33:48,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271420450] [2024-11-28 04:33:48,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:33:48,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 04:33:48,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:33:48,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 04:33:48,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:33:48,651 INFO L87 Difference]: Start difference. First operand 4778 states and 6928 transitions. Second operand has 11 states, 10 states have (on average 9.6) internal successors, (96), 11 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:33:53,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:33:53,039 INFO L93 Difference]: Finished difference Result 4781 states and 6939 transitions. [2024-11-28 04:33:53,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:33:53,039 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.6) internal successors, (96), 11 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-28 04:33:53,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:33:53,049 INFO L225 Difference]: With dead ends: 4781 [2024-11-28 04:33:53,049 INFO L226 Difference]: Without dead ends: 4781 [2024-11-28 04:33:53,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:33:53,050 INFO L435 NwaCegarLoop]: 1900 mSDtfsCounter, 2663 mSDsluCounter, 10112 mSDsCounter, 0 mSdLazyCounter, 7182 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2681 SdHoareTripleChecker+Valid, 12012 SdHoareTripleChecker+Invalid, 7204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 7182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:33:53,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2681 Valid, 12012 Invalid, 7204 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 7182 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-28 04:33:53,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4781 states. [2024-11-28 04:33:53,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4781 to 4778. [2024-11-28 04:33:53,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4778 states, 4034 states have (on average 1.7030242935052058) internal successors, (6870), 4748 states have internal predecessors, (6870), 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-28 04:33:53,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4778 states to 4778 states and 6926 transitions. [2024-11-28 04:33:53,112 INFO L78 Accepts]: Start accepts. Automaton has 4778 states and 6926 transitions. Word has length 98 [2024-11-28 04:33:53,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:33:53,113 INFO L471 AbstractCegarLoop]: Abstraction has 4778 states and 6926 transitions. [2024-11-28 04:33:53,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.6) internal successors, (96), 11 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:33:53,113 INFO L276 IsEmpty]: Start isEmpty. Operand 4778 states and 6926 transitions. [2024-11-28 04:33:53,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-28 04:33:53,114 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:33:53,114 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:33:53,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 04:33:53,114 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-28 04:33:53,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:33:53,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1425742325, now seen corresponding path program 1 times [2024-11-28 04:33:53,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:33:53,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558445797] [2024-11-28 04:33:53,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:33:53,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:33:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:33:53,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:33:53,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:33:53,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558445797] [2024-11-28 04:33:53,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558445797] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:33:53,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945902280] [2024-11-28 04:33:53,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:33:53,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:33:53,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:33:53,742 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:33:53,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 04:33:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:33:54,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-28 04:33:54,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:33:54,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:33:54,220 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:33:54,221 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-28 04:33:54,231 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-28 04:33:54,293 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:33:54,293 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-28 04:33:54,352 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:33:54,352 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-28 04:33:54,369 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-28 04:33:54,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:33:54,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:33:54,386 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1086 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1086) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-28 04:33:54,398 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1086 (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_1086) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-28 04:33:54,443 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-28 04:33:54,443 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-28 04:33:54,453 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1086 (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_1089))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1086)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem55#1.base|)) is different from false [2024-11-28 04:33:54,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945902280] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:33:54,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:33:54,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2024-11-28 04:33:54,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824162653] [2024-11-28 04:33:54,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:33:54,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 04:33:54,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:33:54,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 04:33:54,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=202, Unknown=3, NotChecked=90, Total=342 [2024-11-28 04:33:54,456 INFO L87 Difference]: Start difference. First operand 4778 states and 6926 transitions. Second operand has 16 states, 14 states have (on average 10.357142857142858) internal successors, (145), 15 states have internal predecessors, (145), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:33:59,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:33:59,054 INFO L93 Difference]: Finished difference Result 4780 states and 6937 transitions. [2024-11-28 04:33:59,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 04:33:59,054 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 10.357142857142858) internal successors, (145), 15 states have internal predecessors, (145), 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 99 [2024-11-28 04:33:59,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:33:59,063 INFO L225 Difference]: With dead ends: 4780 [2024-11-28 04:33:59,064 INFO L226 Difference]: Without dead ends: 4780 [2024-11-28 04:33:59,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650 [2024-11-28 04:33:59,066 INFO L435 NwaCegarLoop]: 1893 mSDtfsCounter, 2644 mSDsluCounter, 16831 mSDsCounter, 0 mSdLazyCounter, 8717 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2662 SdHoareTripleChecker+Valid, 18724 SdHoareTripleChecker+Invalid, 8740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 8717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:33:59,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2662 Valid, 18724 Invalid, 8740 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 8717 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-28 04:33:59,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4780 states. [2024-11-28 04:33:59,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4780 to 4777. [2024-11-28 04:33:59,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4777 states, 4034 states have (on average 1.7025285076846801) internal successors, (6868), 4747 states have internal predecessors, (6868), 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-28 04:33:59,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4777 states to 4777 states and 6924 transitions. [2024-11-28 04:33:59,125 INFO L78 Accepts]: Start accepts. Automaton has 4777 states and 6924 transitions. Word has length 99 [2024-11-28 04:33:59,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:33:59,126 INFO L471 AbstractCegarLoop]: Abstraction has 4777 states and 6924 transitions. [2024-11-28 04:33:59,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 10.357142857142858) internal successors, (145), 15 states have internal predecessors, (145), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:33:59,126 INFO L276 IsEmpty]: Start isEmpty. Operand 4777 states and 6924 transitions. [2024-11-28 04:33:59,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-28 04:33:59,127 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:33:59,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:33:59,138 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 04:33:59,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:33:59,328 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-28 04:33:59,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:33:59,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1425742326, now seen corresponding path program 1 times [2024-11-28 04:33:59,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:33:59,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119707789] [2024-11-28 04:33:59,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:33:59,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:33:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:34:00,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:34:00,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:34:00,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119707789] [2024-11-28 04:34:00,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119707789] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:34:00,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112652827] [2024-11-28 04:34:00,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:34:00,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:00,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:34:00,312 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:34:00,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 04:34:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:34:00,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-28 04:34:00,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:34:00,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:34:00,797 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:34:00,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:34:00,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 04:34:00,832 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-28 04:34:00,840 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-28 04:34:00,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:34:00,949 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-28 04:34:01,067 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:34:01,067 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-28 04:34:01,076 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-28 04:34:01,165 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:34:01,165 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-28 04:34:01,170 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-28 04:34:01,195 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-28 04:34:01,199 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-28 04:34:01,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:34:01,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:34:01,283 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1243 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1242 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1243) |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_1242) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 04:34:01,296 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_1243 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1242 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1242) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-28 04:34:01,357 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1249 (Array Int Int)) (v_ArrVal_1248 (Array Int Int)) (v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1242 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1249))) (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_1248) .cse0 v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1242) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1249 (Array Int Int)) (v_ArrVal_1248 (Array Int Int)) (v_ArrVal_1243 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1248) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1249) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-28 04:34:01,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112652827] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:34:01,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:34:01,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-11-28 04:34:01,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038694381] [2024-11-28 04:34:01,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:34:01,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 04:34:01,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:34:01,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 04:34:01,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=398, Unknown=3, NotChecked=126, Total=600 [2024-11-28 04:34:01,361 INFO L87 Difference]: Start difference. First operand 4777 states and 6924 transitions. Second operand has 20 states, 17 states have (on average 9.294117647058824) internal successors, (158), 20 states have internal predecessors, (158), 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-28 04:34:09,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:34:09,387 INFO L93 Difference]: Finished difference Result 4779 states and 6935 transitions. [2024-11-28 04:34:09,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 04:34:09,388 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 9.294117647058824) internal successors, (158), 20 states have internal predecessors, (158), 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 99 [2024-11-28 04:34:09,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:34:09,393 INFO L225 Difference]: With dead ends: 4779 [2024-11-28 04:34:09,393 INFO L226 Difference]: Without dead ends: 4779 [2024-11-28 04:34:09,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=595, Unknown=3, NotChecked=156, Total=870 [2024-11-28 04:34:09,394 INFO L435 NwaCegarLoop]: 1898 mSDtfsCounter, 2667 mSDsluCounter, 15801 mSDsCounter, 0 mSdLazyCounter, 12491 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2685 SdHoareTripleChecker+Valid, 17699 SdHoareTripleChecker+Invalid, 12535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 12491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:34:09,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2685 Valid, 17699 Invalid, 12535 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [44 Valid, 12491 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2024-11-28 04:34:09,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4779 states. [2024-11-28 04:34:09,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4779 to 4761. [2024-11-28 04:34:09,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4761 states, 4020 states have (on average 1.704228855721393) internal successors, (6851), 4733 states have internal predecessors, (6851), 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-28 04:34:09,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4761 states to 4761 states and 6905 transitions. [2024-11-28 04:34:09,488 INFO L78 Accepts]: Start accepts. Automaton has 4761 states and 6905 transitions. Word has length 99 [2024-11-28 04:34:09,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:34:09,488 INFO L471 AbstractCegarLoop]: Abstraction has 4761 states and 6905 transitions. [2024-11-28 04:34:09,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 9.294117647058824) internal successors, (158), 20 states have internal predecessors, (158), 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-28 04:34:09,489 INFO L276 IsEmpty]: Start isEmpty. Operand 4761 states and 6905 transitions. [2024-11-28 04:34:09,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-28 04:34:09,490 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:34:09,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:34:09,500 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-28 04:34:09,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-28 04:34:09,691 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-28 04:34:09,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:34:09,691 INFO L85 PathProgramCache]: Analyzing trace with hash -253311104, now seen corresponding path program 1 times [2024-11-28 04:34:09,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:34:09,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836144763] [2024-11-28 04:34:09,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:34:09,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:34:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:34:10,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-28 04:34:10,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:34:10,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836144763] [2024-11-28 04:34:10,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836144763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:34:10,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:34:10,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 04:34:10,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625328633] [2024-11-28 04:34:10,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:34:10,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 04:34:10,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:34:10,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 04:34:10,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:34:10,368 INFO L87 Difference]: Start difference. First operand 4761 states and 6905 transitions. Second operand has 15 states, 13 states have (on average 7.615384615384615) internal successors, (99), 14 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:34:15,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:34:15,228 INFO L93 Difference]: Finished difference Result 4786 states and 6943 transitions. [2024-11-28 04:34:15,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 04:34:15,230 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.615384615384615) internal successors, (99), 14 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2024-11-28 04:34:15,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:34:15,236 INFO L225 Difference]: With dead ends: 4786 [2024-11-28 04:34:15,236 INFO L226 Difference]: Without dead ends: 4786 [2024-11-28 04:34:15,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-28 04:34:15,237 INFO L435 NwaCegarLoop]: 1892 mSDtfsCounter, 2687 mSDsluCounter, 16846 mSDsCounter, 0 mSdLazyCounter, 8716 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2705 SdHoareTripleChecker+Valid, 18738 SdHoareTripleChecker+Invalid, 8740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 8716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:34:15,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2705 Valid, 18738 Invalid, 8740 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 8716 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-28 04:34:15,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4786 states. [2024-11-28 04:34:15,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4786 to 4782. [2024-11-28 04:34:15,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4782 states, 4040 states have (on average 1.7014851485148514) internal successors, (6874), 4752 states have internal predecessors, (6874), 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-28 04:34:15,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4782 states to 4782 states and 6930 transitions. [2024-11-28 04:34:15,294 INFO L78 Accepts]: Start accepts. Automaton has 4782 states and 6930 transitions. Word has length 101 [2024-11-28 04:34:15,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:34:15,294 INFO L471 AbstractCegarLoop]: Abstraction has 4782 states and 6930 transitions. [2024-11-28 04:34:15,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.615384615384615) internal successors, (99), 14 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:34:15,294 INFO L276 IsEmpty]: Start isEmpty. Operand 4782 states and 6930 transitions. [2024-11-28 04:34:15,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-28 04:34:15,295 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:34:15,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:34:15,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-28 04:34:15,296 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-28 04:34:15,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:34:15,296 INFO L85 PathProgramCache]: Analyzing trace with hash -253311103, now seen corresponding path program 1 times [2024-11-28 04:34:15,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:34:15,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806314132] [2024-11-28 04:34:15,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:34:15,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:34:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:34:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:34:16,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:34:16,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806314132] [2024-11-28 04:34:16,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806314132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:34:16,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:34:16,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 04:34:16,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110070116] [2024-11-28 04:34:16,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:34:16,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 04:34:16,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:34:16,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 04:34:16,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-28 04:34:16,210 INFO L87 Difference]: Start difference. First operand 4782 states and 6930 transitions. Second operand has 12 states, 11 states have (on average 9.0) internal successors, (99), 12 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:34:21,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:34:21,492 INFO L93 Difference]: Finished difference Result 4785 states and 6941 transitions. [2024-11-28 04:34:21,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:34:21,492 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.0) internal successors, (99), 12 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2024-11-28 04:34:21,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:34:21,496 INFO L225 Difference]: With dead ends: 4785 [2024-11-28 04:34:21,496 INFO L226 Difference]: Without dead ends: 4785 [2024-11-28 04:34:21,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-28 04:34:21,497 INFO L435 NwaCegarLoop]: 1899 mSDtfsCounter, 2682 mSDsluCounter, 11613 mSDsCounter, 0 mSdLazyCounter, 8366 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2700 SdHoareTripleChecker+Valid, 13512 SdHoareTripleChecker+Invalid, 8388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 8366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:34:21,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2700 Valid, 13512 Invalid, 8388 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 8366 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-28 04:34:21,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4785 states. [2024-11-28 04:34:21,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4785 to 4782. [2024-11-28 04:34:21,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4782 states, 4040 states have (on average 1.700990099009901) internal successors, (6872), 4752 states have internal predecessors, (6872), 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-28 04:34:21,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4782 states to 4782 states and 6928 transitions. [2024-11-28 04:34:21,536 INFO L78 Accepts]: Start accepts. Automaton has 4782 states and 6928 transitions. Word has length 101 [2024-11-28 04:34:21,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:34:21,536 INFO L471 AbstractCegarLoop]: Abstraction has 4782 states and 6928 transitions. [2024-11-28 04:34:21,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.0) internal successors, (99), 12 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:34:21,536 INFO L276 IsEmpty]: Start isEmpty. Operand 4782 states and 6928 transitions. [2024-11-28 04:34:21,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-28 04:34:21,537 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:34:21,537 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:34:21,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-28 04:34:21,538 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-28 04:34:21,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:34:21,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1358692185, now seen corresponding path program 1 times [2024-11-28 04:34:21,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:34:21,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397580471] [2024-11-28 04:34:21,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:34:21,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:34:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:34:22,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:34:22,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:34:22,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397580471] [2024-11-28 04:34:22,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397580471] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:34:22,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762278595] [2024-11-28 04:34:22,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:34:22,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:22,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:34:22,226 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:34:22,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 04:34:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:34:22,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-28 04:34:22,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:34:22,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:34:22,744 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:34:22,744 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-28 04:34:22,751 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-28 04:34:22,811 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:34:22,812 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-28 04:34:22,864 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:34:22,865 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-28 04:34:22,924 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:34:22,924 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-28 04:34:22,937 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-28 04:34:22,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:34:22,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:34:22,994 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1555 (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_1555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2024-11-28 04:34:23,141 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-28 04:34:23,141 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-28 04:34:23,147 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1555 (Array Int Int)) (v_ArrVal_1554 (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 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1558))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1554)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1555)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-28 04:34:23,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762278595] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:34:23,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:34:23,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 17 [2024-11-28 04:34:23,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54866130] [2024-11-28 04:34:23,148 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:34:23,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 04:34:23,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:34:23,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 04:34:23,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=329, Unknown=29, NotChecked=78, Total=506 [2024-11-28 04:34:23,150 INFO L87 Difference]: Start difference. First operand 4782 states and 6928 transitions. Second operand has 18 states, 16 states have (on average 9.375) internal successors, (150), 17 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:34:27,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:34:27,826 INFO L93 Difference]: Finished difference Result 4784 states and 6939 transitions. [2024-11-28 04:34:27,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 04:34:27,826 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 9.375) internal successors, (150), 17 states have internal predecessors, (150), 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 102 [2024-11-28 04:34:27,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:34:27,831 INFO L225 Difference]: With dead ends: 4784 [2024-11-28 04:34:27,831 INFO L226 Difference]: Without dead ends: 4784 [2024-11-28 04:34:27,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=647, Unknown=36, NotChecked=110, Total=930 [2024-11-28 04:34:27,832 INFO L435 NwaCegarLoop]: 1892 mSDtfsCounter, 2646 mSDsluCounter, 16824 mSDsCounter, 0 mSdLazyCounter, 8710 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2664 SdHoareTripleChecker+Valid, 18716 SdHoareTripleChecker+Invalid, 8733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 8710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:34:27,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2664 Valid, 18716 Invalid, 8733 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 8710 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-28 04:34:27,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4784 states. [2024-11-28 04:34:27,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4784 to 4781. [2024-11-28 04:34:27,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4781 states, 4040 states have (on average 1.7004950495049505) internal successors, (6870), 4751 states have internal predecessors, (6870), 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-28 04:34:27,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4781 states to 4781 states and 6926 transitions. [2024-11-28 04:34:27,880 INFO L78 Accepts]: Start accepts. Automaton has 4781 states and 6926 transitions. Word has length 102 [2024-11-28 04:34:27,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:34:27,881 INFO L471 AbstractCegarLoop]: Abstraction has 4781 states and 6926 transitions. [2024-11-28 04:34:27,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 9.375) internal successors, (150), 17 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:34:27,881 INFO L276 IsEmpty]: Start isEmpty. Operand 4781 states and 6926 transitions. [2024-11-28 04:34:27,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-28 04:34:27,882 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:34:27,882 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:34:27,893 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 04:34:28,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-28 04:34:28,083 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-28 04:34:28,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:34:28,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1358692186, now seen corresponding path program 1 times [2024-11-28 04:34:28,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:34:28,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887643227] [2024-11-28 04:34:28,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:34:28,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:34:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:34: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-28 04:34:28,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:34:28,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887643227] [2024-11-28 04:34:28,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887643227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:34:28,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265562808] [2024-11-28 04:34:28,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:34:28,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:28,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:34:28,998 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:34:29,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 04:34:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:34:29,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-28 04:34:29,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:34:29,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:34:29,502 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:34:29,503 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-28 04:34:29,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 04:34:29,537 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-28 04:34:29,544 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-28 04:34:29,635 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-28 04:34:29,639 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-28 04:34:29,743 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:34:29,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-28 04:34:29,753 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-28 04:34:29,839 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:34:29,839 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-28 04:34:29,843 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-28 04:34:29,913 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:34:29,913 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-28 04:34:29,921 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-28 04:34:29,942 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-28 04:34:29,946 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-28 04:34:29,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:34:29,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:34:30,032 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1725 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_1726) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 04:34:30,044 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_1725 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1725) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1725) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1726) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-28 04:34:30,069 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1724 (Array Int Int)) (v_ArrVal_1723 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1724) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1723) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1725) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1724 (Array Int Int)) (v_ArrVal_1723 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1723))) (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~mem57#1.base| v_ArrVal_1724) .cse1 v_ArrVal_1725) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1726) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-28 04:34:30,215 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1724 (Array Int Int)) (v_ArrVal_1723 (Array Int Int)) (v_ArrVal_1732 (Array Int Int)) (v_ArrVal_1731 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1732))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1723))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 12 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1731) .cse0 v_ArrVal_1724) .cse1 v_ArrVal_1725) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1726) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1724 (Array Int Int)) (v_ArrVal_1723 (Array Int Int)) (v_ArrVal_1732 (Array Int Int)) (v_ArrVal_1731 (Array Int Int))) (<= 0 (+ 8 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1732))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1731) .cse5 v_ArrVal_1724) (select (select (store .cse6 .cse5 v_ArrVal_1723) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1725))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 04:34:30,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265562808] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:34:30,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:34:30,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2024-11-28 04:34:30,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115802244] [2024-11-28 04:34:30,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:34:30,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 04:34:30,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:34:30,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 04:34:30,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=515, Unknown=7, NotChecked=196, Total=812 [2024-11-28 04:34:30,221 INFO L87 Difference]: Start difference. First operand 4781 states and 6926 transitions. Second operand has 22 states, 19 states have (on average 8.631578947368421) internal successors, (164), 22 states have internal predecessors, (164), 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-28 04:34:40,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:34:40,362 INFO L93 Difference]: Finished difference Result 4783 states and 6937 transitions. [2024-11-28 04:34:40,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 04:34:40,363 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.631578947368421) internal successors, (164), 22 states have internal predecessors, (164), 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 102 [2024-11-28 04:34:40,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:34:40,367 INFO L225 Difference]: With dead ends: 4783 [2024-11-28 04:34:40,367 INFO L226 Difference]: Without dead ends: 4783 [2024-11-28 04:34:40,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=152, Invalid=787, Unknown=7, NotChecked=244, Total=1190 [2024-11-28 04:34:40,368 INFO L435 NwaCegarLoop]: 1897 mSDtfsCounter, 2646 mSDsluCounter, 20683 mSDsCounter, 0 mSdLazyCounter, 15768 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2664 SdHoareTripleChecker+Valid, 22580 SdHoareTripleChecker+Invalid, 15795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 15768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:34:40,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2664 Valid, 22580 Invalid, 15795 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 15768 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2024-11-28 04:34:40,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4783 states. [2024-11-28 04:34:40,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4783 to 4759. [2024-11-28 04:34:40,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4759 states, 4020 states have (on average 1.703233830845771) internal successors, (6847), 4731 states have internal predecessors, (6847), 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-28 04:34:40,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4759 states to 4759 states and 6901 transitions. [2024-11-28 04:34:40,433 INFO L78 Accepts]: Start accepts. Automaton has 4759 states and 6901 transitions. Word has length 102 [2024-11-28 04:34:40,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:34:40,433 INFO L471 AbstractCegarLoop]: Abstraction has 4759 states and 6901 transitions. [2024-11-28 04:34:40,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.631578947368421) internal successors, (164), 22 states have internal predecessors, (164), 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-28 04:34:40,433 INFO L276 IsEmpty]: Start isEmpty. Operand 4759 states and 6901 transitions. [2024-11-28 04:34:40,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-28 04:34:40,434 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:34:40,434 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:34:40,442 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 04:34:40,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-28 04:34:40,635 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-28 04:34:40,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:34:40,635 INFO L85 PathProgramCache]: Analyzing trace with hash -132874987, now seen corresponding path program 1 times [2024-11-28 04:34:40,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:34:40,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622463068] [2024-11-28 04:34:40,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:34:40,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:34:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:34:41,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:34:41,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:34:41,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622463068] [2024-11-28 04:34:41,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622463068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:34:41,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:34:41,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 04:34:41,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480948279] [2024-11-28 04:34:41,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:34:41,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 04:34:41,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:34:41,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 04:34:41,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-28 04:34:41,340 INFO L87 Difference]: Start difference. First operand 4759 states and 6901 transitions. Second operand has 16 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:34:45,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:34:45,523 INFO L93 Difference]: Finished difference Result 4790 states and 6945 transitions. [2024-11-28 04:34:45,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 04:34:45,524 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2024-11-28 04:34:45,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:34:45,530 INFO L225 Difference]: With dead ends: 4790 [2024-11-28 04:34:45,531 INFO L226 Difference]: Without dead ends: 4790 [2024-11-28 04:34:45,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2024-11-28 04:34:45,531 INFO L435 NwaCegarLoop]: 1891 mSDtfsCounter, 2684 mSDsluCounter, 14939 mSDsCounter, 0 mSdLazyCounter, 7850 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2702 SdHoareTripleChecker+Valid, 16830 SdHoareTripleChecker+Invalid, 7873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 7850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-28 04:34:45,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2702 Valid, 16830 Invalid, 7873 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 7850 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-28 04:34:45,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4790 states. [2024-11-28 04:34:45,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4790 to 4786. [2024-11-28 04:34:45,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4786 states, 4046 states have (on average 1.699456253089471) internal successors, (6876), 4756 states have internal predecessors, (6876), 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-28 04:34:45,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4786 states to 4786 states and 6932 transitions. [2024-11-28 04:34:45,619 INFO L78 Accepts]: Start accepts. Automaton has 4786 states and 6932 transitions. Word has length 104 [2024-11-28 04:34:45,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:34:45,619 INFO L471 AbstractCegarLoop]: Abstraction has 4786 states and 6932 transitions. [2024-11-28 04:34:45,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:34:45,620 INFO L276 IsEmpty]: Start isEmpty. Operand 4786 states and 6932 transitions. [2024-11-28 04:34:45,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-28 04:34:45,620 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:34:45,620 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:34:45,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-28 04:34:45,621 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-28 04:34:45,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:34:45,621 INFO L85 PathProgramCache]: Analyzing trace with hash -132874986, now seen corresponding path program 1 times [2024-11-28 04:34:45,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:34:45,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111321120] [2024-11-28 04:34:45,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:34:45,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:34:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:34:46,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:34:46,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:34:46,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111321120] [2024-11-28 04:34:46,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111321120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:34:46,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:34:46,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 04:34:46,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643015676] [2024-11-28 04:34:46,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:34:46,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 04:34:46,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:34:46,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 04:34:46,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-28 04:34:46,472 INFO L87 Difference]: Start difference. First operand 4786 states and 6932 transitions. Second operand has 13 states, 12 states have (on average 8.5) internal successors, (102), 13 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:34:51,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:34:51,165 INFO L93 Difference]: Finished difference Result 4789 states and 6943 transitions. [2024-11-28 04:34:51,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 04:34:51,165 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.5) internal successors, (102), 13 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2024-11-28 04:34:51,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:34:51,169 INFO L225 Difference]: With dead ends: 4789 [2024-11-28 04:34:51,169 INFO L226 Difference]: Without dead ends: 4789 [2024-11-28 04:34:51,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-28 04:34:51,170 INFO L435 NwaCegarLoop]: 1898 mSDtfsCounter, 2665 mSDsluCounter, 9779 mSDsCounter, 0 mSdLazyCounter, 7541 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2683 SdHoareTripleChecker+Valid, 11677 SdHoareTripleChecker+Invalid, 7563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 7541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:34:51,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2683 Valid, 11677 Invalid, 7563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 7541 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-28 04:34:51,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4789 states. [2024-11-28 04:34:51,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4789 to 4786. [2024-11-28 04:34:51,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4786 states, 4046 states have (on average 1.698961937716263) internal successors, (6874), 4756 states have internal predecessors, (6874), 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-28 04:34:51,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4786 states to 4786 states and 6930 transitions. [2024-11-28 04:34:51,209 INFO L78 Accepts]: Start accepts. Automaton has 4786 states and 6930 transitions. Word has length 104 [2024-11-28 04:34:51,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:34:51,210 INFO L471 AbstractCegarLoop]: Abstraction has 4786 states and 6930 transitions. [2024-11-28 04:34:51,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.5) internal successors, (102), 13 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:34:51,210 INFO L276 IsEmpty]: Start isEmpty. Operand 4786 states and 6930 transitions. [2024-11-28 04:34:51,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-28 04:34:51,210 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:34:51,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:34:51,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-28 04:34:51,211 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-28 04:34:51,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:34:51,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1027771036, now seen corresponding path program 1 times [2024-11-28 04:34:51,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:34:51,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858203840] [2024-11-28 04:34:51,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:34:51,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:34:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:34:51,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-28 04:34:51,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:34:51,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858203840] [2024-11-28 04:34:51,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858203840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:34:51,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567187055] [2024-11-28 04:34:51,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:34:51,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:51,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:34:51,895 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:34:51,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 04:34:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:34:52,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-28 04:34:52,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:34:52,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:34:52,393 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:34:52,393 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-28 04:34:52,400 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-28 04:34:52,449 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:34:52,449 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-28 04:34:52,499 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:34:52,500 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-28 04:34:52,545 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:34:52,546 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-28 04:34:52,596 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:34:52,596 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-28 04:34:52,609 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-28 04:34:52,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:34:52,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:34:52,755 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2063 (Array Int Int)) (v_ArrVal_2062 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2062))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2063)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 04:34:52,765 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2061 (Array Int Int)) (v_ArrVal_2063 (Array Int Int)) (v_ArrVal_2062 (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_2061))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2062)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2063)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 04:34:52,771 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2061 (Array Int Int)) (v_ArrVal_2063 (Array Int Int)) (v_ArrVal_2062 (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| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2061))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2062)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2063)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 04:34:52,815 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-28 04:34:52,815 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-28 04:34:52,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567187055] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:34:52,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:34:52,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 19 [2024-11-28 04:34:52,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652632240] [2024-11-28 04:34:52,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:34:52,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 04:34:52,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:34:52,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 04:34:52,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=434, Unknown=42, NotChecked=138, Total=702 [2024-11-28 04:34:52,885 INFO L87 Difference]: Start difference. First operand 4786 states and 6930 transitions. Second operand has 20 states, 18 states have (on average 8.61111111111111) internal successors, (155), 19 states have internal predecessors, (155), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:34:57,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:34:57,721 INFO L93 Difference]: Finished difference Result 4788 states and 6941 transitions. [2024-11-28 04:34:57,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 04:34:57,721 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 8.61111111111111) internal successors, (155), 19 states have internal predecessors, (155), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2024-11-28 04:34:57,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:34:57,726 INFO L225 Difference]: With dead ends: 4788 [2024-11-28 04:34:57,726 INFO L226 Difference]: Without dead ends: 4788 [2024-11-28 04:34:57,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=842, Unknown=58, NotChecked=192, Total=1260 [2024-11-28 04:34:57,727 INFO L435 NwaCegarLoop]: 1891 mSDtfsCounter, 2644 mSDsluCounter, 16822 mSDsCounter, 0 mSdLazyCounter, 8760 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2662 SdHoareTripleChecker+Valid, 18713 SdHoareTripleChecker+Invalid, 8783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 8760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:34:57,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2662 Valid, 18713 Invalid, 8783 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 8760 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-28 04:34:57,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4788 states. [2024-11-28 04:34:57,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4788 to 4785. [2024-11-28 04:34:57,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4785 states, 4046 states have (on average 1.6984676223430548) internal successors, (6872), 4755 states have internal predecessors, (6872), 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-28 04:34:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4785 states to 4785 states and 6928 transitions. [2024-11-28 04:34:57,808 INFO L78 Accepts]: Start accepts. Automaton has 4785 states and 6928 transitions. Word has length 105 [2024-11-28 04:34:57,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:34:57,808 INFO L471 AbstractCegarLoop]: Abstraction has 4785 states and 6928 transitions. [2024-11-28 04:34:57,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 8.61111111111111) internal successors, (155), 19 states have internal predecessors, (155), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:34:57,809 INFO L276 IsEmpty]: Start isEmpty. Operand 4785 states and 6928 transitions. [2024-11-28 04:34:57,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-28 04:34:57,809 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:34:57,809 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:34:57,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-28 04:34:58,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:58,010 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-28 04:34:58,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:34:58,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1027771037, now seen corresponding path program 1 times [2024-11-28 04:34:58,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:34:58,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726251810] [2024-11-28 04:34:58,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:34:58,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:34:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:34:59,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:34:59,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:34:59,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726251810] [2024-11-28 04:34:59,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726251810] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:34:59,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454511914] [2024-11-28 04:34:59,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:34:59,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:59,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:34:59,008 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:34:59,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 04:34:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:34:59,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-28 04:34:59,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:34:59,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:34:59,671 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:34:59,671 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-28 04:34:59,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 04:34:59,718 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-28 04:34:59,731 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-28 04:34:59,846 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-28 04:34:59,850 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-28 04:34:59,995 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:34:59,995 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-28 04:35:00,000 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-28 04:35:00,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:35:00,101 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 65 treesize of output 37 [2024-11-28 04:35:00,113 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-28 04:35:00,247 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 04:35:00,247 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 75 treesize of output 62 [2024-11-28 04:35:00,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 04:35:00,259 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-28 04:35:00,351 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:35:00,352 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-28 04:35:00,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:35:00,383 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-28 04:35:00,387 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-28 04:35:00,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:35:00,417 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:35:00,658 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2245 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2245))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) 0) (forall ((v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2246 (Array Int Int))) (<= 0 (+ 20 (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2246) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2248) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) (forall ((v_ArrVal_2245 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2245))) (or (forall ((v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2247 (Array Int Int)) (v_ArrVal_2246 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2246))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse2 .cse3 v_ArrVal_2248) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_2247) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (< (+ (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) 0)))))) is different from false [2024-11-28 04:35:00,688 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2245 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| .cse4 v_ArrVal_2245))) (or (forall ((v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2247 (Array Int Int)) (v_ArrVal_2246 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse4 v_ArrVal_2246))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store .cse0 .cse1 v_ArrVal_2248) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2247) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (< (+ 8 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) 0)))) (forall ((v_ArrVal_2245 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.offset| .cse4 v_ArrVal_2245))) (or (forall ((v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2246 (Array Int Int))) (<= 0 (+ (select (select (store .cse5 (select (select (store |c_#memory_$Pointer$#2.base| .cse4 v_ArrVal_2246) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2248) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (< (+ 8 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) 0))))))) is different from false [2024-11-28 04:35:01,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454511914] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:35:01,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:35:01,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 25 [2024-11-28 04:35:01,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757855278] [2024-11-28 04:35:01,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:35:01,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 04:35:01,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:35:01,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 04:35:01,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=923, Unknown=11, NotChecked=126, Total=1190 [2024-11-28 04:35:01,518 INFO L87 Difference]: Start difference. First operand 4785 states and 6928 transitions. Second operand has 26 states, 23 states have (on average 8.73913043478261) internal successors, (201), 26 states have internal predecessors, (201), 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-28 04:35:12,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:35:12,659 INFO L93 Difference]: Finished difference Result 6635 states and 9258 transitions. [2024-11-28 04:35:12,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 04:35:12,659 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 8.73913043478261) internal successors, (201), 26 states have internal predecessors, (201), 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 105 [2024-11-28 04:35:12,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:35:12,664 INFO L225 Difference]: With dead ends: 6635 [2024-11-28 04:35:12,664 INFO L226 Difference]: Without dead ends: 6635 [2024-11-28 04:35:12,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=250, Invalid=1553, Unknown=11, NotChecked=166, Total=1980 [2024-11-28 04:35:12,665 INFO L435 NwaCegarLoop]: 1904 mSDtfsCounter, 7239 mSDsluCounter, 22661 mSDsCounter, 0 mSdLazyCounter, 16208 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7267 SdHoareTripleChecker+Valid, 24565 SdHoareTripleChecker+Invalid, 16271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 16208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:35:12,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7267 Valid, 24565 Invalid, 16271 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 16208 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2024-11-28 04:35:12,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6635 states. [2024-11-28 04:35:12,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6635 to 4757. [2024-11-28 04:35:12,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4757 states, 4020 states have (on average 1.7022388059701492) internal successors, (6843), 4729 states have internal predecessors, (6843), 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-28 04:35:12,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4757 states to 4757 states and 6897 transitions. [2024-11-28 04:35:12,707 INFO L78 Accepts]: Start accepts. Automaton has 4757 states and 6897 transitions. Word has length 105 [2024-11-28 04:35:12,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:35:12,707 INFO L471 AbstractCegarLoop]: Abstraction has 4757 states and 6897 transitions. [2024-11-28 04:35:12,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 8.73913043478261) internal successors, (201), 26 states have internal predecessors, (201), 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-28 04:35:12,708 INFO L276 IsEmpty]: Start isEmpty. Operand 4757 states and 6897 transitions. [2024-11-28 04:35:12,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-28 04:35:12,708 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:35:12,708 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:35:12,719 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 04:35:12,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-11-28 04:35:12,909 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-28 04:35:12,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:35:12,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1308797673, now seen corresponding path program 1 times [2024-11-28 04:35:12,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:35:12,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149395439] [2024-11-28 04:35:12,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:35:12,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:35:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:35:13,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:35:13,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:35:13,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149395439] [2024-11-28 04:35:13,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149395439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:35:13,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:35:13,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-28 04:35:13,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186718464] [2024-11-28 04:35:13,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:35:13,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 04:35:13,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:35:13,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 04:35:13,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-11-28 04:35:13,677 INFO L87 Difference]: Start difference. First operand 4757 states and 6897 transitions. Second operand has 17 states, 15 states have (on average 7.066666666666666) internal successors, (106), 16 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:35:19,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:35:19,889 INFO L93 Difference]: Finished difference Result 4796 states and 6949 transitions. [2024-11-28 04:35:19,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 04:35:19,890 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 7.066666666666666) internal successors, (106), 16 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2024-11-28 04:35:19,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:35:19,893 INFO L225 Difference]: With dead ends: 4796 [2024-11-28 04:35:19,893 INFO L226 Difference]: Without dead ends: 4796 [2024-11-28 04:35:19,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2024-11-28 04:35:19,894 INFO L435 NwaCegarLoop]: 1890 mSDtfsCounter, 2692 mSDsluCounter, 22414 mSDsCounter, 0 mSdLazyCounter, 11317 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2710 SdHoareTripleChecker+Valid, 24304 SdHoareTripleChecker+Invalid, 11344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 11317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-28 04:35:19,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2710 Valid, 24304 Invalid, 11344 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 11317 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-28 04:35:19,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4796 states. [2024-11-28 04:35:19,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4796 to 4792. [2024-11-28 04:35:19,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4792 states, 4054 states have (on average 1.697089294523927) internal successors, (6880), 4762 states have internal predecessors, (6880), 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-28 04:35:19,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4792 states to 4792 states and 6936 transitions. [2024-11-28 04:35:19,935 INFO L78 Accepts]: Start accepts. Automaton has 4792 states and 6936 transitions. Word has length 108 [2024-11-28 04:35:19,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:35:19,935 INFO L471 AbstractCegarLoop]: Abstraction has 4792 states and 6936 transitions. [2024-11-28 04:35:19,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 7.066666666666666) internal successors, (106), 16 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:35:19,935 INFO L276 IsEmpty]: Start isEmpty. Operand 4792 states and 6936 transitions. [2024-11-28 04:35:19,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-28 04:35:19,936 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:35:19,936 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:35:19,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-28 04:35:19,936 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-28 04:35:19,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:35:19,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1308797672, now seen corresponding path program 1 times [2024-11-28 04:35:19,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:35:19,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130574376] [2024-11-28 04:35:19,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:35:19,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:35:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:35:21,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:35:21,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:35:21,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130574376] [2024-11-28 04:35:21,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130574376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:35:21,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:35:21,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 04:35:21,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854800697] [2024-11-28 04:35:21,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:35:21,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 04:35:21,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:35:21,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 04:35:21,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-28 04:35:21,104 INFO L87 Difference]: Start difference. First operand 4792 states and 6936 transitions. Second operand has 18 states, 16 states have (on average 6.625) internal successors, (106), 17 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:35:30,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:35:30,791 INFO L93 Difference]: Finished difference Result 4795 states and 6947 transitions. [2024-11-28 04:35:30,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 04:35:30,791 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.625) internal successors, (106), 17 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2024-11-28 04:35:30,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:35:30,795 INFO L225 Difference]: With dead ends: 4795 [2024-11-28 04:35:30,795 INFO L226 Difference]: Without dead ends: 4795 [2024-11-28 04:35:30,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-28 04:35:30,796 INFO L435 NwaCegarLoop]: 1891 mSDtfsCounter, 2665 mSDsluCounter, 20950 mSDsCounter, 0 mSdLazyCounter, 15522 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2683 SdHoareTripleChecker+Valid, 22841 SdHoareTripleChecker+Invalid, 15548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 15522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:35:30,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2683 Valid, 22841 Invalid, 15548 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 15522 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2024-11-28 04:35:30,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4795 states. [2024-11-28 04:35:30,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4795 to 4792. [2024-11-28 04:35:30,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4792 states, 4054 states have (on average 1.6965959546127283) internal successors, (6878), 4762 states have internal predecessors, (6878), 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-28 04:35:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4792 states to 4792 states and 6934 transitions. [2024-11-28 04:35:30,837 INFO L78 Accepts]: Start accepts. Automaton has 4792 states and 6934 transitions. Word has length 108 [2024-11-28 04:35:30,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:35:30,837 INFO L471 AbstractCegarLoop]: Abstraction has 4792 states and 6934 transitions. [2024-11-28 04:35:30,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.625) internal successors, (106), 17 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:35:30,837 INFO L276 IsEmpty]: Start isEmpty. Operand 4792 states and 6934 transitions. [2024-11-28 04:35:30,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-28 04:35:30,838 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:35:30,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:35:30,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-28 04:35:30,838 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-28 04:35:30,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:35:30,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1858815774, now seen corresponding path program 1 times [2024-11-28 04:35:30,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:35:30,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624368842] [2024-11-28 04:35:30,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:35:30,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:35:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:35:31,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:35:31,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:35:31,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624368842] [2024-11-28 04:35:31,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624368842] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:35:31,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906973314] [2024-11-28 04:35:31,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:35:31,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:35:31,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:35:31,643 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:35:31,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 04:35:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:35:32,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-28 04:35:32,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:35:32,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:35:32,190 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:35:32,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:35:32,209 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-28 04:35:32,277 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:35:32,277 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-28 04:35:32,325 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:35:32,325 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-28 04:35:32,377 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:35:32,377 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-28 04:35:32,428 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:35:32,429 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-28 04:35:32,479 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:35:32,479 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-28 04:35:32,489 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-28 04:35:32,509 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 04:35:32,510 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-28 04:35:32,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:35:32,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:35:37,250 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-28 04:35:37,250 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-28 04:35:37,272 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2616 (Array Int Int)) (v_ArrVal_2615 (Array Int Int)) (v_ArrVal_2622 (Array Int Int)) (v_ArrVal_2618 (Array Int Int)) (v_ArrVal_2617 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2622))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2615)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2616)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2617)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2618)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem55#1.base|)) is different from false [2024-11-28 04:35:37,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906973314] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:35:37,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:35:37,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 23 [2024-11-28 04:35:37,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619702219] [2024-11-28 04:35:37,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:35:37,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 04:35:37,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:35:37,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 04:35:37,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=920, Unknown=43, NotChecked=64, Total=1190 [2024-11-28 04:35:37,276 INFO L87 Difference]: Start difference. First operand 4792 states and 6934 transitions. Second operand has 24 states, 21 states have (on average 7.9523809523809526) internal successors, (167), 23 states have internal predecessors, (167), 2 states have call successors, (2), 1 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-28 04:35:43,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:35:43,131 INFO L93 Difference]: Finished difference Result 4794 states and 6945 transitions. [2024-11-28 04:35:43,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 04:35:43,132 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.9523809523809526) internal successors, (167), 23 states have internal predecessors, (167), 2 states have call successors, (2), 1 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 109 [2024-11-28 04:35:43,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:35:43,136 INFO L225 Difference]: With dead ends: 4794 [2024-11-28 04:35:43,136 INFO L226 Difference]: Without dead ends: 4794 [2024-11-28 04:35:43,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=267, Invalid=1416, Unknown=43, NotChecked=80, Total=1806 [2024-11-28 04:35:43,137 INFO L435 NwaCegarLoop]: 1889 mSDtfsCounter, 2645 mSDsluCounter, 16838 mSDsCounter, 0 mSdLazyCounter, 8771 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2663 SdHoareTripleChecker+Valid, 18727 SdHoareTripleChecker+Invalid, 8799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 8771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:35:43,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2663 Valid, 18727 Invalid, 8799 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 8771 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-28 04:35:43,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4794 states. [2024-11-28 04:35:43,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4794 to 4791. [2024-11-28 04:35:43,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4791 states, 4054 states have (on average 1.6961026147015295) internal successors, (6876), 4761 states have internal predecessors, (6876), 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-28 04:35:43,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4791 states to 4791 states and 6932 transitions. [2024-11-28 04:35:43,177 INFO L78 Accepts]: Start accepts. Automaton has 4791 states and 6932 transitions. Word has length 109 [2024-11-28 04:35:43,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:35:43,177 INFO L471 AbstractCegarLoop]: Abstraction has 4791 states and 6932 transitions. [2024-11-28 04:35:43,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.9523809523809526) internal successors, (167), 23 states have internal predecessors, (167), 2 states have call successors, (2), 1 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-28 04:35:43,177 INFO L276 IsEmpty]: Start isEmpty. Operand 4791 states and 6932 transitions. [2024-11-28 04:35:43,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-28 04:35:43,177 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:35:43,178 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:35:43,186 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-28 04:35:43,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-28 04:35:43,378 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-28 04:35:43,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:35:43,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1858815775, now seen corresponding path program 1 times [2024-11-28 04:35:43,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:35:43,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572283511] [2024-11-28 04:35:43,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:35:43,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:35:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:35:44,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:35:44,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:35:44,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572283511] [2024-11-28 04:35:44,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572283511] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:35:44,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116324007] [2024-11-28 04:35:44,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:35:44,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:35:44,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:35:44,639 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:35:44,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 04:35:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:35:45,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-28 04:35:45,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:35:45,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:35:45,183 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:35:45,183 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-28 04:35:45,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 04:35:45,230 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-28 04:35:45,243 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-28 04:35:45,362 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-28 04:35:45,366 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-28 04:35:45,537 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:35:45,537 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-28 04:35:45,548 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-28 04:35:45,697 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:35:45,697 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-28 04:35:45,708 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-28 04:35:45,852 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:35:45,852 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-28 04:35:45,865 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-28 04:35:45,996 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:35:45,996 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-28 04:35:46,010 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-28 04:35:46,128 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:35:46,128 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-28 04:35:46,139 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-28 04:35:46,163 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-28 04:35:46,169 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-28 04:35:46,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:35:46,239 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-28 04:35:46,239 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-28 04:35:46,251 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:35:46,252 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-28 04:35:46,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:35:46,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:35:47,245 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_ArrVal_2822 (Array Int Int)) (v_ArrVal_2820 (Array Int Int)) (v_ArrVal_2819 (Array Int Int)) (v_ArrVal_2818 (Array Int Int)) (v_ArrVal_2817 (Array Int Int))) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2818))) (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_2817) .cse1 v_ArrVal_2820) (select (select (store .cse2 .cse1 v_ArrVal_2819) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2822))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 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_2822 (Array Int Int)) (v_ArrVal_2821 (Array Int Int)) (v_ArrVal_2820 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_7| Int) (v_ArrVal_2819 (Array Int Int)) (v_ArrVal_2818 (Array Int Int)) (v_ArrVal_2817 (Array Int Int))) (or (forall ((v_ArrVal_2823 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2818))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2819))) (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_2817) .cse4 v_ArrVal_2820) .cse5 v_ArrVal_2822) |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_2823) (select (select (store .cse6 .cse5 v_ArrVal_2821) |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-28 04:35:47,303 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2822 (Array Int Int)) (v_ArrVal_2820 (Array Int Int)) (v_ArrVal_2819 (Array Int Int)) (v_ArrVal_2818 (Array Int Int)) (v_ArrVal_2817 (Array Int Int)) (v_ArrVal_2816 (Array Int Int)) (v_ArrVal_2815 (Array Int Int))) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2816))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2818))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2815) .cse0 v_ArrVal_2817) .cse1 v_ArrVal_2820) (select (select (store .cse2 .cse1 v_ArrVal_2819) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2822))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 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_2822 (Array Int Int)) (v_ArrVal_2821 (Array Int Int)) (v_ArrVal_2820 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_7| Int) (v_ArrVal_2819 (Array Int Int)) (v_ArrVal_2818 (Array Int Int)) (v_ArrVal_2817 (Array Int Int)) (v_ArrVal_2816 (Array Int Int)) (v_ArrVal_2815 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_7|) 0)) (forall ((v_ArrVal_2823 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2816))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2818))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2819))) (let ((.cse7 (select (select .cse8 |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~mem57#1.base| v_ArrVal_2815) .cse5 v_ArrVal_2817) .cse6 v_ArrVal_2820) .cse7 v_ArrVal_2822) |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_2823) (select (select (store .cse8 .cse7 v_ArrVal_2821) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-28 04:35:53,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:35:53,623 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-28 04:35:54,243 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_prenex_38 (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_39))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_prenex_41))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_prenex_38))) (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_37) .cse0 v_prenex_42) .cse1 v_prenex_40) .cse2 v_prenex_34) (select (select (store .cse3 .cse2 v_prenex_36) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_33))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((v_ArrVal_2822 (Array Int Int)) (v_ArrVal_2821 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_7| Int) (v_ArrVal_2820 (Array Int Int)) (v_ArrVal_2819 (Array Int Int)) (v_ArrVal_2829 (Array Int Int)) (v_ArrVal_2818 (Array Int Int)) (v_ArrVal_2823 Int) (v_ArrVal_2828 (Array Int Int)) (v_ArrVal_2817 (Array Int Int)) (v_ArrVal_2816 (Array Int Int)) (v_ArrVal_2815 (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_2828))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2816))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2818))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2819))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 3 (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2829) .cse7 v_ArrVal_2815) .cse8 v_ArrVal_2817) .cse9 v_ArrVal_2820) .cse10 v_ArrVal_2822) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_7| v_ArrVal_2823) (select (select (store .cse11 .cse10 v_ArrVal_2821) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))) (forall ((v_ArrVal_2822 (Array Int Int)) (v_ArrVal_2821 (Array Int Int)) (v_ArrVal_2820 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_7| Int) (v_ArrVal_2819 (Array Int Int)) (v_ArrVal_2829 (Array Int Int)) (v_ArrVal_2818 (Array Int Int)) (v_ArrVal_2823 Int) (v_ArrVal_2828 (Array Int Int)) (v_ArrVal_2817 (Array Int Int)) (v_ArrVal_2816 (Array Int Int)) (v_ArrVal_2815 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc62#1.base_7| |c_ULTIMATE.start_main_#t~mem55#1.base|) (let ((.cse22 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2828))) (let ((.cse15 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse21 (store .cse22 .cse15 v_ArrVal_2816))) (let ((.cse16 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse20 (store .cse21 .cse16 v_ArrVal_2818))) (let ((.cse17 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse19 (store .cse20 .cse17 v_ArrVal_2819))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 3 (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2829) .cse15 v_ArrVal_2815) .cse16 v_ArrVal_2817) .cse17 v_ArrVal_2820) .cse18 v_ArrVal_2822) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_7| v_ArrVal_2823) (select (select (store .cse19 .cse18 v_ArrVal_2821) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false [2024-11-28 04:35:54,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116324007] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:35:54,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:35:54,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2024-11-28 04:35:54,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967898216] [2024-11-28 04:35:54,255 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:35:54,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-28 04:35:54,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:35:54,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-28 04:35:54,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1430, Unknown=36, NotChecked=240, Total=1892 [2024-11-28 04:35:54,257 INFO L87 Difference]: Start difference. First operand 4791 states and 6932 transitions. Second operand has 32 states, 29 states have (on average 6.137931034482759) internal successors, (178), 30 states have internal predecessors, (178), 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-28 04:36:45,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:36:45,761 INFO L93 Difference]: Finished difference Result 4793 states and 6943 transitions. [2024-11-28 04:36:45,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 04:36:45,761 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 6.137931034482759) internal successors, (178), 30 states have internal predecessors, (178), 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 109 [2024-11-28 04:36:45,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:36:45,766 INFO L225 Difference]: With dead ends: 4793 [2024-11-28 04:36:45,766 INFO L226 Difference]: Without dead ends: 4793 [2024-11-28 04:36:45,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=321, Invalid=2205, Unknown=36, NotChecked=300, Total=2862 [2024-11-28 04:36:45,767 INFO L435 NwaCegarLoop]: 1889 mSDtfsCounter, 2652 mSDsluCounter, 20965 mSDsCounter, 0 mSdLazyCounter, 15505 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2670 SdHoareTripleChecker+Valid, 22854 SdHoareTripleChecker+Invalid, 15538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 15505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:36:45,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2670 Valid, 22854 Invalid, 15538 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [33 Valid, 15505 Invalid, 0 Unknown, 0 Unchecked, 49.6s Time] [2024-11-28 04:36:45,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4793 states. [2024-11-28 04:36:45,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4793 to 4755. [2024-11-28 04:36:45,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4755 states, 4020 states have (on average 1.7012437810945273) internal successors, (6839), 4727 states have internal predecessors, (6839), 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-28 04:36:45,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4755 states to 4755 states and 6893 transitions. [2024-11-28 04:36:45,813 INFO L78 Accepts]: Start accepts. Automaton has 4755 states and 6893 transitions. Word has length 109 [2024-11-28 04:36:45,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:36:45,814 INFO L471 AbstractCegarLoop]: Abstraction has 4755 states and 6893 transitions. [2024-11-28 04:36:45,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 6.137931034482759) internal successors, (178), 30 states have internal predecessors, (178), 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-28 04:36:45,814 INFO L276 IsEmpty]: Start isEmpty. Operand 4755 states and 6893 transitions. [2024-11-28 04:36:45,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-28 04:36:45,814 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:36:45,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:36:45,824 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 04:36:46,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-28 04:36:46,015 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-28 04:36:46,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:36:46,016 INFO L85 PathProgramCache]: Analyzing trace with hash -677663155, now seen corresponding path program 1 times [2024-11-28 04:36:46,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:36:46,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135075675] [2024-11-28 04:36:46,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:36:46,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:36:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:36:46,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:36:46,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:36:46,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135075675] [2024-11-28 04:36:46,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135075675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:36:46,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:36:46,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:36:46,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317143086] [2024-11-28 04:36:46,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:36:46,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:36:46,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:36:46,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:36:46,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:36:46,577 INFO L87 Difference]: Start difference. First operand 4755 states and 6893 transitions. Second operand has 7 states, 6 states have (on average 18.166666666666668) internal successors, (109), 7 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:36:53,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:36:53,725 INFO L93 Difference]: Finished difference Result 4754 states and 6891 transitions. [2024-11-28 04:36:53,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:36:53,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 18.166666666666668) internal successors, (109), 7 states have internal predecessors, (109), 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 111 [2024-11-28 04:36:53,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:36:53,731 INFO L225 Difference]: With dead ends: 4754 [2024-11-28 04:36:53,731 INFO L226 Difference]: Without dead ends: 4754 [2024-11-28 04:36:53,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:36:53,731 INFO L435 NwaCegarLoop]: 2731 mSDtfsCounter, 2 mSDsluCounter, 8789 mSDsCounter, 0 mSdLazyCounter, 2153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11520 SdHoareTripleChecker+Invalid, 2153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:36:53,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11520 Invalid, 2153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2153 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2024-11-28 04:36:53,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4754 states. [2024-11-28 04:36:53,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4754 to 4754. [2024-11-28 04:36:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4754 states, 4020 states have (on average 1.7007462686567165) internal successors, (6837), 4726 states have internal predecessors, (6837), 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-28 04:36:53,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4754 states to 4754 states and 6891 transitions. [2024-11-28 04:36:53,781 INFO L78 Accepts]: Start accepts. Automaton has 4754 states and 6891 transitions. Word has length 111 [2024-11-28 04:36:53,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:36:53,781 INFO L471 AbstractCegarLoop]: Abstraction has 4754 states and 6891 transitions. [2024-11-28 04:36:53,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 18.166666666666668) internal successors, (109), 7 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:36:53,782 INFO L276 IsEmpty]: Start isEmpty. Operand 4754 states and 6891 transitions. [2024-11-28 04:36:53,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-28 04:36:53,782 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:36:53,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:36:53,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-28 04:36:53,783 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-28 04:36:53,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:36:53,783 INFO L85 PathProgramCache]: Analyzing trace with hash -677663154, now seen corresponding path program 1 times [2024-11-28 04:36:53,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:36:53,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409676353] [2024-11-28 04:36:53,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:36:53,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:36:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:36:56,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:36:56,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:36:56,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409676353] [2024-11-28 04:36:56,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409676353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:36:56,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:36:56,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 04:36:56,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875881835] [2024-11-28 04:36:56,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:36:56,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 04:36:56,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:36:56,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 04:36:56,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-28 04:36:56,559 INFO L87 Difference]: Start difference. First operand 4754 states and 6891 transitions. Second operand has 19 states, 17 states have (on average 6.411764705882353) internal successors, (109), 18 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:37:44,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:37:44,231 INFO L93 Difference]: Finished difference Result 4798 states and 6947 transitions. [2024-11-28 04:37:44,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 04:37:44,231 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.411764705882353) internal successors, (109), 18 states have internal predecessors, (109), 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 111 [2024-11-28 04:37:44,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:37:44,237 INFO L225 Difference]: With dead ends: 4798 [2024-11-28 04:37:44,238 INFO L226 Difference]: Without dead ends: 4798 [2024-11-28 04:37:44,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-11-28 04:37:44,239 INFO L435 NwaCegarLoop]: 1890 mSDtfsCounter, 2664 mSDsluCounter, 20598 mSDsCounter, 0 mSdLazyCounter, 15871 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2682 SdHoareTripleChecker+Valid, 22488 SdHoareTripleChecker+Invalid, 15896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 15871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:37:44,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2682 Valid, 22488 Invalid, 15896 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [25 Valid, 15871 Invalid, 0 Unknown, 0 Unchecked, 46.5s Time] [2024-11-28 04:37:44,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4798 states. [2024-11-28 04:37:44,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4798 to 4795. [2024-11-28 04:37:44,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4795 states, 4060 states have (on average 1.694088669950739) internal successors, (6878), 4765 states have internal predecessors, (6878), 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-28 04:37:44,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4795 states to 4795 states and 6934 transitions. [2024-11-28 04:37:44,294 INFO L78 Accepts]: Start accepts. Automaton has 4795 states and 6934 transitions. Word has length 111 [2024-11-28 04:37:44,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:37:44,295 INFO L471 AbstractCegarLoop]: Abstraction has 4795 states and 6934 transitions. [2024-11-28 04:37:44,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.411764705882353) internal successors, (109), 18 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:37:44,295 INFO L276 IsEmpty]: Start isEmpty. Operand 4795 states and 6934 transitions. [2024-11-28 04:37:44,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-28 04:37:44,296 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:37:44,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:37:44,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-28 04:37:44,296 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-28 04:37:44,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:37:44,297 INFO L85 PathProgramCache]: Analyzing trace with hash 968076007, now seen corresponding path program 1 times [2024-11-28 04:37:44,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:37:44,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974962723] [2024-11-28 04:37:44,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:37:44,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:37:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:37:47,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:37:47,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:37:47,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974962723] [2024-11-28 04:37:47,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974962723] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:37:47,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535493813] [2024-11-28 04:37:47,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:37:47,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:37:47,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:37:47,140 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:37:47,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 04:37:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:37:47,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-28 04:37:47,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:37:47,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:37:48,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 04:37:48,148 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:37:48,148 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-28 04:37:48,171 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-28 04:37:48,192 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-28 04:37:48,347 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-28 04:37:48,356 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-28 04:37:48,896 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:37:48,896 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-28 04:37:48,906 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-28 04:37:49,257 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:37:49,257 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-28 04:37:49,267 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-28 04:37:49,583 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:37:49,583 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-28 04:37:49,614 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-28 04:37:49,898 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:37:49,899 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-28 04:37:49,909 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-28 04:37:50,216 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:37:50,216 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-28 04:37:50,248 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-28 04:37:50,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:37:50,454 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-28 04:37:50,494 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:37:50,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:37:50,541 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:37:50,541 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-28 04:37:50,553 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-28 04:37:50,622 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-28 04:37:50,639 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-28 04:37:50,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:37:50,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:37:51,035 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3227 (Array Int Int))) (<= 0 (+ 40 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem61#1.base| v_ArrVal_3227) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3227 (Array Int Int)) (v_ArrVal_3228 (Array Int Int))) (<= (+ 44 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem61#1.base| v_ArrVal_3227) |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_3228) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 04:37:51,619 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_3224 (Array Int Int)) (v_ArrVal_3225 (Array Int Int)) (v_ArrVal_3227 (Array Int Int))) (<= 0 (+ 40 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3224) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3225) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3227) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (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_3224 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_9| Int) (v_ArrVal_3225 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_9|) 0)) (forall ((v_ArrVal_3226 Int) (v_ArrVal_3227 (Array Int Int)) (v_ArrVal_3228 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3225))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 44 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3224) .cse1 v_ArrVal_3227) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_9| v_ArrVal_3226) (select (select (store .cse2 .cse1 v_ArrVal_3228) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))))) is different from false [2024-11-28 04:37:52,338 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_ArrVal_3222 (Array Int Int)) (v_ArrVal_3223 (Array Int Int)) (v_ArrVal_3224 (Array Int Int)) (v_ArrVal_3225 (Array Int Int)) (v_ArrVal_3227 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3222))) (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_3223) .cse1 v_ArrVal_3224) (select (select (store .cse2 .cse1 v_ArrVal_3225) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3227))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (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_3222 (Array Int Int)) (v_ArrVal_3223 (Array Int Int)) (v_ArrVal_3224 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_9| Int) (v_ArrVal_3225 (Array Int Int))) (or (forall ((v_ArrVal_3226 Int) (v_ArrVal_3227 (Array Int Int)) (v_ArrVal_3228 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3222))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_3225))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 44 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3223) .cse4 v_ArrVal_3224) .cse5 v_ArrVal_3227) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_9| v_ArrVal_3226) (select (select (store .cse6 .cse5 v_ArrVal_3228) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_9|) 0))))))) is different from false [2024-11-28 04:37:52,788 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_3220 (Array Int Int)) (v_ArrVal_3221 (Array Int Int)) (v_ArrVal_3222 (Array Int Int)) (v_ArrVal_3223 (Array Int Int)) (v_ArrVal_3224 (Array Int Int)) (v_ArrVal_3225 (Array Int Int)) (v_ArrVal_3227 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3220))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3222))) (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_3221) .cse1 v_ArrVal_3223) .cse2 v_ArrVal_3224) (select (select (store .cse3 .cse2 v_ArrVal_3225) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3227))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (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_3220 (Array Int Int)) (v_ArrVal_3221 (Array Int Int)) (v_ArrVal_3222 (Array Int Int)) (v_ArrVal_3223 (Array Int Int)) (v_ArrVal_3224 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_9| Int) (v_ArrVal_3225 (Array Int Int))) (or (forall ((v_ArrVal_3226 Int) (v_ArrVal_3227 (Array Int Int)) (v_ArrVal_3228 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3220))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_3222))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_3225))) (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_3221) .cse6 v_ArrVal_3223) .cse7 v_ArrVal_3224) .cse8 v_ArrVal_3227) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_9| v_ArrVal_3226) (select (select (store .cse9 .cse8 v_ArrVal_3228) |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-28 04:37:52,898 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc62#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_9|) 0))) (forall ((v_ArrVal_3220 (Array Int Int)) (v_ArrVal_3221 (Array Int Int)) (v_ArrVal_3222 (Array Int Int)) (v_ArrVal_3223 (Array Int Int)) (v_ArrVal_3224 (Array Int Int)) (v_ArrVal_3225 (Array Int Int)) (v_ArrVal_3227 (Array Int Int)) (v_ArrVal_3218 (Array Int Int)) (v_ArrVal_3219 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3218))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_3220))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3222))) (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~mem57#1.base| v_ArrVal_3219) .cse0 v_ArrVal_3221) .cse1 v_ArrVal_3223) .cse2 v_ArrVal_3224) (select (select (store .cse3 .cse2 v_ArrVal_3225) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3227))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))) (forall ((v_ArrVal_3220 (Array Int Int)) (v_ArrVal_3221 (Array Int Int)) (v_ArrVal_3222 (Array Int Int)) (v_ArrVal_3223 (Array Int Int)) (v_ArrVal_3224 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_9| Int) (v_ArrVal_3225 (Array Int Int)) (v_ArrVal_3218 (Array Int Int)) (v_ArrVal_3219 (Array Int Int))) (or (forall ((v_ArrVal_3226 Int) (v_ArrVal_3227 (Array Int Int)) (v_ArrVal_3228 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3218))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_3220))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_3222))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_3225))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ 44 (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3219) .cse7 v_ArrVal_3221) .cse8 v_ArrVal_3223) .cse9 v_ArrVal_3224) .cse10 v_ArrVal_3227) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_9| v_ArrVal_3226) (select (select (store .cse11 .cse10 v_ArrVal_3228) |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-28 04:37:52,959 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |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|) .cse5))) (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_3220 (Array Int Int)) (v_ArrVal_3221 (Array Int Int)) (v_ArrVal_3222 (Array Int Int)) (v_ArrVal_3223 (Array Int Int)) (v_ArrVal_3224 (Array Int Int)) (v_ArrVal_3225 (Array Int Int)) (v_ArrVal_3227 (Array Int Int)) (v_ArrVal_3218 (Array Int Int)) (v_ArrVal_3219 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3218))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3220))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3222))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3219) .cse1 v_ArrVal_3221) .cse2 v_ArrVal_3223) .cse3 v_ArrVal_3224) (select (select (store .cse4 .cse3 v_ArrVal_3225) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3227))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))) (forall ((v_ArrVal_3220 (Array Int Int)) (v_ArrVal_3221 (Array Int Int)) (v_ArrVal_3222 (Array Int Int)) (v_ArrVal_3223 (Array Int Int)) (v_ArrVal_3224 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_9| Int) (v_ArrVal_3225 (Array Int Int)) (v_ArrVal_3218 (Array Int Int)) (v_ArrVal_3219 (Array Int Int))) (or (forall ((v_ArrVal_3226 Int) (v_ArrVal_3227 (Array Int Int)) (v_ArrVal_3228 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3218))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_3220))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_3222))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_3225))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (<= (+ 44 (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3219) .cse8 v_ArrVal_3221) .cse9 v_ArrVal_3223) .cse10 v_ArrVal_3224) .cse11 v_ArrVal_3227) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_9| v_ArrVal_3226) (select (select (store .cse12 .cse11 v_ArrVal_3228) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_9|) 0))))))) is different from false [2024-11-28 04:37:53,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:37:53,242 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-28 04:37:58,081 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)) (or (= |v_ULTIMATE.start_main_#t~malloc62#1.base_9| |c_ULTIMATE.start_main_#t~mem55#1.base|) (forall ((v_ArrVal_3226 Int) (v_ArrVal_3220 (Array Int Int)) (v_ArrVal_3221 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3222 (Array Int Int)) (v_ArrVal_3234 (Array Int Int)) (v_ArrVal_3223 (Array Int Int)) (v_ArrVal_3224 (Array Int Int)) (v_ArrVal_3225 (Array Int Int)) (v_ArrVal_3227 (Array Int Int)) (v_ArrVal_3228 (Array Int Int)) (v_ArrVal_3218 (Array Int Int)) (v_ArrVal_3219 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3233))) (let ((.cse0 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse9 (store .cse10 .cse0 v_ArrVal_3218))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_3220))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_3222))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_3225))) (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_3234) .cse0 v_ArrVal_3219) .cse1 v_ArrVal_3221) .cse2 v_ArrVal_3223) .cse3 v_ArrVal_3224) .cse4 v_ArrVal_3227) |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_3226) (select (select (store .cse6 .cse4 v_ArrVal_3228) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))))) (forall ((v_prenex_61 (Array Int Int)) (v_prenex_60 (Array Int Int)) (v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_63 (Array Int Int)) (v_prenex_58 (Array Int Int)) (v_prenex_57 (Array Int Int)) (v_prenex_56 (Array Int Int)) (v_prenex_66 (Array Int Int)) (v_prenex_55 (Array Int Int)) (v_prenex_59 (Array Int Int))) (< 0 (+ (select (select (let ((.cse18 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_prenex_57))) (let ((.cse11 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse11 v_prenex_65))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse12 v_prenex_55))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse13 v_prenex_58))) (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_59) .cse11 v_prenex_66) .cse12 v_prenex_56) .cse13 v_prenex_60) .cse14 v_prenex_61) (select (select (store .cse15 .cse14 v_prenex_63) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_64))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 41))))) is different from false [2024-11-28 04:37:58,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535493813] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:37:58,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:37:58,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 26 [2024-11-28 04:37:58,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920298163] [2024-11-28 04:37:58,112 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:37:58,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-28 04:37:58,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:37:58,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-28 04:37:58,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=957, Unknown=24, NotChecked=490, Total=1640 [2024-11-28 04:37:58,114 INFO L87 Difference]: Start difference. First operand 4795 states and 6934 transitions. Second operand has 27 states, 25 states have (on average 6.8) internal successors, (170), 25 states have internal predecessors, (170), 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-28 04:39:30,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:30,502 INFO L93 Difference]: Finished difference Result 4797 states and 6945 transitions. [2024-11-28 04:39:30,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-28 04:39:30,502 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 6.8) internal successors, (170), 25 states have internal predecessors, (170), 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 112 [2024-11-28 04:39:30,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:30,507 INFO L225 Difference]: With dead ends: 4797 [2024-11-28 04:39:30,507 INFO L226 Difference]: Without dead ends: 4797 [2024-11-28 04:39:30,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=291, Invalid=1693, Unknown=24, NotChecked=644, Total=2652 [2024-11-28 04:39:30,508 INFO L435 NwaCegarLoop]: 1888 mSDtfsCounter, 2642 mSDsluCounter, 18003 mSDsCounter, 0 mSdLazyCounter, 13045 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 87.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2660 SdHoareTripleChecker+Valid, 19891 SdHoareTripleChecker+Invalid, 13071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 13045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 89.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:30,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2660 Valid, 19891 Invalid, 13071 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [26 Valid, 13045 Invalid, 0 Unknown, 0 Unchecked, 89.7s Time] [2024-11-28 04:39:30,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4797 states. [2024-11-28 04:39:30,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4797 to 4753. [2024-11-28 04:39:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4753 states, 4020 states have (on average 1.7002487562189055) internal successors, (6835), 4725 states have internal predecessors, (6835), 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-28 04:39:30,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4753 states to 4753 states and 6889 transitions. [2024-11-28 04:39:30,548 INFO L78 Accepts]: Start accepts. Automaton has 4753 states and 6889 transitions. Word has length 112 [2024-11-28 04:39:30,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:30,549 INFO L471 AbstractCegarLoop]: Abstraction has 4753 states and 6889 transitions. [2024-11-28 04:39:30,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 6.8) internal successors, (170), 25 states have internal predecessors, (170), 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-28 04:39:30,549 INFO L276 IsEmpty]: Start isEmpty. Operand 4753 states and 6889 transitions. [2024-11-28 04:39:30,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-28 04:39:30,549 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:30,549 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:30,558 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-28 04:39:30,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f31b5a-88c4-4236-8b1a-d17f76bbcd4e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-28 04:39:30,750 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-28 04:39:30,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:30,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1916052354, now seen corresponding path program 1 times [2024-11-28 04:39:30,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:30,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783175902] [2024-11-28 04:39:30,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:30,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:32,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:39:32,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:32,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783175902] [2024-11-28 04:39:32,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783175902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:39:32,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:39:32,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 04:39:32,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054064518] [2024-11-28 04:39:32,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:39:32,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:39:32,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:32,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:39:32,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:39:32,799 INFO L87 Difference]: Start difference. First operand 4753 states and 6889 transitions. Second operand has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:40:14,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:40:14,182 INFO L93 Difference]: Finished difference Result 4752 states and 6887 transitions. [2024-11-28 04:40:14,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:40:14,183 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 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 114 [2024-11-28 04:40:14,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:40:14,188 INFO L225 Difference]: With dead ends: 4752 [2024-11-28 04:40:14,188 INFO L226 Difference]: Without dead ends: 4752 [2024-11-28 04:40:14,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:40:14,189 INFO L435 NwaCegarLoop]: 1919 mSDtfsCounter, 5258 mSDsluCounter, 11365 mSDsCounter, 0 mSdLazyCounter, 5891 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5266 SdHoareTripleChecker+Valid, 13284 SdHoareTripleChecker+Invalid, 5913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 5891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:40:14,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5266 Valid, 13284 Invalid, 5913 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 5891 Invalid, 0 Unknown, 0 Unchecked, 40.4s Time] [2024-11-28 04:40:14,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4752 states. [2024-11-28 04:40:14,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4752 to 4752. [2024-11-28 04:40:14,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4752 states, 4020 states have (on average 1.6997512437810944) internal successors, (6833), 4724 states have internal predecessors, (6833), 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-28 04:40:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4752 states to 4752 states and 6887 transitions. [2024-11-28 04:40:14,232 INFO L78 Accepts]: Start accepts. Automaton has 4752 states and 6887 transitions. Word has length 114 [2024-11-28 04:40:14,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:40:14,232 INFO L471 AbstractCegarLoop]: Abstraction has 4752 states and 6887 transitions. [2024-11-28 04:40:14,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:40:14,233 INFO L276 IsEmpty]: Start isEmpty. Operand 4752 states and 6887 transitions. [2024-11-28 04:40:14,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-28 04:40:14,233 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:40:14,233 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:40:14,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-28 04:40:14,233 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-28 04:40:14,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:40:14,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1916052353, now seen corresponding path program 1 times [2024-11-28 04:40:14,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:40:14,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870016280] [2024-11-28 04:40:14,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:40:14,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:40:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:40:17,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:40:17,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:40:17,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870016280] [2024-11-28 04:40:17,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870016280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:40:17,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:40:17,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 04:40:17,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386658462] [2024-11-28 04:40:17,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:40:17,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 04:40:17,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:40:17,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 04:40:17,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-28 04:40:17,416 INFO L87 Difference]: Start difference. First operand 4752 states and 6887 transitions. Second operand has 16 states, 15 states have (on average 7.466666666666667) internal successors, (112), 16 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:41:41,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:41:41,920 INFO L93 Difference]: Finished difference Result 4836 states and 6997 transitions. [2024-11-28 04:41:41,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 04:41:41,920 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 7.466666666666667) internal successors, (112), 16 states have internal predecessors, (112), 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 114 [2024-11-28 04:41:41,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:41:41,926 INFO L225 Difference]: With dead ends: 4836 [2024-11-28 04:41:41,926 INFO L226 Difference]: Without dead ends: 4836 [2024-11-28 04:41:41,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2024-11-28 04:41:41,927 INFO L435 NwaCegarLoop]: 1897 mSDtfsCounter, 2715 mSDsluCounter, 21763 mSDsCounter, 0 mSdLazyCounter, 12086 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 81.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2733 SdHoareTripleChecker+Valid, 23660 SdHoareTripleChecker+Invalid, 12112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 12086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 82.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:41:41,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2733 Valid, 23660 Invalid, 12112 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [26 Valid, 12086 Invalid, 0 Unknown, 0 Unchecked, 82.8s Time] [2024-11-28 04:41:41,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4836 states. [2024-11-28 04:41:41,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4836 to 4799. [2024-11-28 04:41:41,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4799 states, 4066 states have (on average 1.6920806689621248) internal successors, (6880), 4769 states have internal predecessors, (6880), 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-28 04:41:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4799 states to 4799 states and 6936 transitions. [2024-11-28 04:41:41,971 INFO L78 Accepts]: Start accepts. Automaton has 4799 states and 6936 transitions. Word has length 114 [2024-11-28 04:41:41,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:41:41,972 INFO L471 AbstractCegarLoop]: Abstraction has 4799 states and 6936 transitions. [2024-11-28 04:41:41,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 7.466666666666667) internal successors, (112), 16 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:41:41,972 INFO L276 IsEmpty]: Start isEmpty. Operand 4799 states and 6936 transitions. [2024-11-28 04:41:41,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-28 04:41:41,972 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:41:41,973 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:41:41,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-28 04:41:41,973 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:41:41,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:41:41,973 INFO L85 PathProgramCache]: Analyzing trace with hash -752390842, now seen corresponding path program 1 times [2024-11-28 04:41:41,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:41:41,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668110839] [2024-11-28 04:41:41,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:41:41,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:41:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:41:46,175 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-28 04:41:46,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:41:46,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668110839] [2024-11-28 04:41:46,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668110839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:41:46,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:41:46,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 04:41:46,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456012719] [2024-11-28 04:41:46,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:41:46,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 04:41:46,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:41:46,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 04:41:46,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-28 04:41:46,177 INFO L87 Difference]: Start difference. First operand 4799 states and 6936 transitions. Second operand has 12 states, 11 states have (on average 10.272727272727273) internal successors, (113), 12 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:42:28,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:42:28,645 INFO L93 Difference]: Finished difference Result 4798 states and 6934 transitions. [2024-11-28 04:42:28,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 04:42:28,646 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 10.272727272727273) internal successors, (113), 12 states have internal predecessors, (113), 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 115 [2024-11-28 04:42:28,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:42:28,652 INFO L225 Difference]: With dead ends: 4798 [2024-11-28 04:42:28,652 INFO L226 Difference]: Without dead ends: 4798 [2024-11-28 04:42:28,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2024-11-28 04:42:28,653 INFO L435 NwaCegarLoop]: 1917 mSDtfsCounter, 5247 mSDsluCounter, 8655 mSDsCounter, 0 mSdLazyCounter, 5718 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5255 SdHoareTripleChecker+Valid, 10572 SdHoareTripleChecker+Invalid, 5738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:42:28,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5255 Valid, 10572 Invalid, 5738 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 5718 Invalid, 0 Unknown, 0 Unchecked, 41.0s Time] [2024-11-28 04:42:28,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4798 states. [2024-11-28 04:42:28,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4798 to 4751. [2024-11-28 04:42:28,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4751 states, 4020 states have (on average 1.6992537313432836) internal successors, (6831), 4723 states have internal predecessors, (6831), 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-28 04:42:28,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4751 states to 4751 states and 6885 transitions. [2024-11-28 04:42:28,714 INFO L78 Accepts]: Start accepts. Automaton has 4751 states and 6885 transitions. Word has length 115 [2024-11-28 04:42:28,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:42:28,714 INFO L471 AbstractCegarLoop]: Abstraction has 4751 states and 6885 transitions. [2024-11-28 04:42:28,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 10.272727272727273) internal successors, (113), 12 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:42:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 4751 states and 6885 transitions. [2024-11-28 04:42:28,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-28 04:42:28,715 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:42:28,715 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:42:28,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-28 04:42:28,715 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:42:28,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:42:28,716 INFO L85 PathProgramCache]: Analyzing trace with hash -999587262, now seen corresponding path program 1 times [2024-11-28 04:42:28,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:42:28,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302188167] [2024-11-28 04:42:28,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:42:28,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:42:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:42:32,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-28 04:42:32,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:42:32,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302188167] [2024-11-28 04:42:32,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302188167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:42:32,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:42:32,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 04:42:32,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190870714] [2024-11-28 04:42:32,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:42:32,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 04:42:32,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:42:32,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 04:42:32,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-28 04:42:32,805 INFO L87 Difference]: Start difference. First operand 4751 states and 6885 transitions. Second operand has 18 states, 17 states have (on average 6.764705882352941) internal successors, (115), 18 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-28 04:43:37,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:43:37,135 INFO L93 Difference]: Finished difference Result 4834 states and 6993 transitions. [2024-11-28 04:43:37,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 04:43:37,135 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.764705882352941) internal successors, (115), 18 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-28 04:43:37,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:43:37,141 INFO L225 Difference]: With dead ends: 4834 [2024-11-28 04:43:37,141 INFO L226 Difference]: Without dead ends: 4834 [2024-11-28 04:43:37,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2024-11-28 04:43:37,141 INFO L435 NwaCegarLoop]: 1889 mSDtfsCounter, 2742 mSDsluCounter, 13937 mSDsCounter, 0 mSdLazyCounter, 9037 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2760 SdHoareTripleChecker+Valid, 15826 SdHoareTripleChecker+Invalid, 9065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 9037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 62.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:43:37,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2760 Valid, 15826 Invalid, 9065 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 9037 Invalid, 0 Unknown, 0 Unchecked, 62.4s Time] [2024-11-28 04:43:37,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4834 states. [2024-11-28 04:43:37,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4834 to 4804. [2024-11-28 04:43:37,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4804 states, 4072 states have (on average 1.6910609037328095) internal successors, (6886), 4774 states have internal predecessors, (6886), 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-28 04:43:37,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4804 states to 4804 states and 6942 transitions. [2024-11-28 04:43:37,200 INFO L78 Accepts]: Start accepts. Automaton has 4804 states and 6942 transitions. Word has length 117 [2024-11-28 04:43:37,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:43:37,201 INFO L471 AbstractCegarLoop]: Abstraction has 4804 states and 6942 transitions. [2024-11-28 04:43:37,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.764705882352941) internal successors, (115), 18 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-28 04:43:37,201 INFO L276 IsEmpty]: Start isEmpty. Operand 4804 states and 6942 transitions. [2024-11-28 04:43:37,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-28 04:43:37,202 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:43:37,202 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:43:37,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-28 04:43:37,202 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 04:43:37,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:43:37,203 INFO L85 PathProgramCache]: Analyzing trace with hash -999587263, now seen corresponding path program 1 times [2024-11-28 04:43:37,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:43:37,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370868580] [2024-11-28 04:43:37,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:43:37,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:43:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:43:37,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:43:37,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:43:37,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370868580] [2024-11-28 04:43:37,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370868580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:43:37,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:43:37,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:43:37,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557292808] [2024-11-28 04:43:37,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:43:37,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:43:37,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:43:37,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:43:37,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:43:37,462 INFO L87 Difference]: Start difference. First operand 4804 states and 6942 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-28 04:43:51,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:43:51,126 INFO L93 Difference]: Finished difference Result 4803 states and 6938 transitions. [2024-11-28 04:43:51,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:43:51,127 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-28 04:43:51,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:43:51,132 INFO L225 Difference]: With dead ends: 4803 [2024-11-28 04:43:51,132 INFO L226 Difference]: Without dead ends: 4803 [2024-11-28 04:43:51,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:43:51,133 INFO L435 NwaCegarLoop]: 2727 mSDtfsCounter, 5 mSDsluCounter, 6290 mSDsCounter, 0 mSdLazyCounter, 1902 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 9017 SdHoareTripleChecker+Invalid, 1902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:43:51,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 9017 Invalid, 1902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1902 Invalid, 0 Unknown, 0 Unchecked, 13.5s Time] [2024-11-28 04:43:51,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4803 states. [2024-11-28 04:43:51,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4803 to 4803. [2024-11-28 04:43:51,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4803 states, 4072 states have (on average 1.6900785854616895) internal successors, (6882), 4773 states have internal predecessors, (6882), 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-28 04:43:51,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4803 states to 4803 states and 6938 transitions. [2024-11-28 04:43:51,177 INFO L78 Accepts]: Start accepts. Automaton has 4803 states and 6938 transitions. Word has length 117 [2024-11-28 04:43:51,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:43:51,177 INFO L471 AbstractCegarLoop]: Abstraction has 4803 states and 6938 transitions. [2024-11-28 04:43:51,177 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-28 04:43:51,177 INFO L276 IsEmpty]: Start isEmpty. Operand 4803 states and 6938 transitions. [2024-11-28 04:43:51,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-28 04:43:51,178 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:43:51,178 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:43:51,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-28 04:43:51,178 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-28 04:43:51,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:43:51,179 INFO L85 PathProgramCache]: Analyzing trace with hash 959440923, now seen corresponding path program 1 times [2024-11-28 04:43:51,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:43:51,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503099663] [2024-11-28 04:43:51,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:43:51,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:43:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:43:51,804 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-28 04:43:51,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:43:51,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503099663] [2024-11-28 04:43:51,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503099663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:43:51,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:43:51,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:43:51,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534928742] [2024-11-28 04:43:51,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:43:51,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:43:51,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:43:51,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:43:51,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:43:51,806 INFO L87 Difference]: Start difference. First operand 4803 states and 6938 transitions. Second operand has 5 states, 4 states have (on average 29.0) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:44:06,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:44:06,158 INFO L93 Difference]: Finished difference Result 4802 states and 6936 transitions. [2024-11-28 04:44:06,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:44:06,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 29.0) internal successors, (116), 5 states have internal predecessors, (116), 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 118 [2024-11-28 04:44:06,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:44:06,163 INFO L225 Difference]: With dead ends: 4802 [2024-11-28 04:44:06,163 INFO L226 Difference]: Without dead ends: 4802 [2024-11-28 04:44:06,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:44:06,164 INFO L435 NwaCegarLoop]: 2727 mSDtfsCounter, 4 mSDsluCounter, 6272 mSDsCounter, 0 mSdLazyCounter, 1917 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 8999 SdHoareTripleChecker+Invalid, 1917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:44:06,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 8999 Invalid, 1917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1917 Invalid, 0 Unknown, 0 Unchecked, 14.2s Time] [2024-11-28 04:44:06,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4802 states. [2024-11-28 04:44:06,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4802 to 4749. [2024-11-28 04:44:06,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4749 states, 4020 states have (on average 1.6982587064676617) internal successors, (6827), 4721 states have internal predecessors, (6827), 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-28 04:44:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4749 states to 4749 states and 6881 transitions. [2024-11-28 04:44:06,223 INFO L78 Accepts]: Start accepts. Automaton has 4749 states and 6881 transitions. Word has length 118 [2024-11-28 04:44:06,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:44:06,224 INFO L471 AbstractCegarLoop]: Abstraction has 4749 states and 6881 transitions. [2024-11-28 04:44:06,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 29.0) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:44:06,224 INFO L276 IsEmpty]: Start isEmpty. Operand 4749 states and 6881 transitions. [2024-11-28 04:44:06,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-28 04:44:06,225 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:44:06,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:44:06,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-28 04:44:06,225 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-28 04:44:06,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:44:06,225 INFO L85 PathProgramCache]: Analyzing trace with hash -922433342, now seen corresponding path program 1 times [2024-11-28 04:44:06,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:44:06,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767719524] [2024-11-28 04:44:06,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:44:06,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:44:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:44:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:44:10,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:44:10,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767719524] [2024-11-28 04:44:10,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767719524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:44:10,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:44:10,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-28 04:44:10,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627929385] [2024-11-28 04:44:10,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:44:10,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 04:44:10,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:44:10,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 04:44:10,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-11-28 04:44:10,641 INFO L87 Difference]: Start difference. First operand 4749 states and 6881 transitions. Second operand has 21 states, 20 states have (on average 5.8) internal successors, (116), 21 states have internal predecessors, (116), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:45:54,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:45:54,973 INFO L93 Difference]: Finished difference Result 4832 states and 6987 transitions. [2024-11-28 04:45:54,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 04:45:54,973 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.8) internal successors, (116), 21 states have internal predecessors, (116), 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 118 [2024-11-28 04:45:54,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:45:54,977 INFO L225 Difference]: With dead ends: 4832 [2024-11-28 04:45:54,977 INFO L226 Difference]: Without dead ends: 4832 [2024-11-28 04:45:54,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=147, Invalid=975, Unknown=0, NotChecked=0, Total=1122 [2024-11-28 04:45:54,978 INFO L435 NwaCegarLoop]: 1891 mSDtfsCounter, 2756 mSDsluCounter, 29850 mSDsCounter, 0 mSdLazyCounter, 14691 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 99.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2774 SdHoareTripleChecker+Valid, 31741 SdHoareTripleChecker+Invalid, 14726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 14691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 101.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:45:54,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2774 Valid, 31741 Invalid, 14726 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [35 Valid, 14691 Invalid, 0 Unknown, 0 Unchecked, 101.8s Time] [2024-11-28 04:45:54,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4832 states. [2024-11-28 04:45:55,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4832 to 4804. [2024-11-28 04:45:55,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4804 states, 4074 states have (on average 1.6892488954344624) internal successors, (6882), 4774 states have internal predecessors, (6882), 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-28 04:45:55,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4804 states to 4804 states and 6942 transitions. [2024-11-28 04:45:55,023 INFO L78 Accepts]: Start accepts. Automaton has 4804 states and 6942 transitions. Word has length 118 [2024-11-28 04:45:55,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:45:55,024 INFO L471 AbstractCegarLoop]: Abstraction has 4804 states and 6942 transitions. [2024-11-28 04:45:55,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.8) internal successors, (116), 21 states have internal predecessors, (116), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:45:55,024 INFO L276 IsEmpty]: Start isEmpty. Operand 4804 states and 6942 transitions. [2024-11-28 04:45:55,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-28 04:45:55,024 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:45:55,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:45:55,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-28 04:45:55,025 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-28 04:45:55,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:45:55,025 INFO L85 PathProgramCache]: Analyzing trace with hash -922433341, now seen corresponding path program 1 times [2024-11-28 04:45:55,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:45:55,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322342636] [2024-11-28 04:45:55,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:45:55,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:45:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:45:58,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:45:58,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:45:58,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322342636] [2024-11-28 04:45:58,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322342636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:45:58,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:45:58,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 04:45:58,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823548579] [2024-11-28 04:45:58,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:45:58,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 04:45:58,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:45:58,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 04:45:58,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-11-28 04:45:58,932 INFO L87 Difference]: Start difference. First operand 4804 states and 6942 transitions. Second operand has 19 states, 18 states have (on average 6.444444444444445) internal successors, (116), 19 states have internal predecessors, (116), 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)