./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_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_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/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_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/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_4e88e0d6-593d-4768-92b8-5ce4ca5af362/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 b06fba6fbf61d996c1af57497d908c6dba492febf0212a36ee7b28f5806d365e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:06:50,431 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:06:50,501 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 02:06:50,507 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:06:50,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:06:50,547 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:06:50,548 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:06:50,548 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:06:50,548 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:06:50,548 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:06:50,549 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:06:50,549 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:06:50,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:06:50,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:06:50,549 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:06:50,549 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:06:50,549 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:06:50,550 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:06:50,551 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:06:50,551 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:06:50,551 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 02:06:50,551 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 02:06:50,552 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 02:06:50,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:06:50,552 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 02:06:50,552 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 02:06:50,552 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:06:50,552 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:06:50,552 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:06:50,553 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:06:50,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:06:50,553 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:06:50,553 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:06:50,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:06:50,553 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:06:50,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:06:50,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:06:50,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:06:50,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:06:50,554 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:06:50,554 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:06:50,554 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:06:50,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:06:50,554 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:06:50,555 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:06:50,555 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:06:50,555 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:06:50,555 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_4e88e0d6-593d-4768-92b8-5ce4ca5af362/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 -> b06fba6fbf61d996c1af57497d908c6dba492febf0212a36ee7b28f5806d365e [2024-11-28 02:06:50,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:06:50,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:06:50,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:06:50,913 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:06:50,913 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:06:50,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-1.i [2024-11-28 02:06:54,061 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/data/469a7814a/6b52cf8ae80e479a8895771cae05f0e3/FLAG1d9d7dd37 [2024-11-28 02:06:54,448 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:06:54,449 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-1.i [2024-11-28 02:06:54,479 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/data/469a7814a/6b52cf8ae80e479a8895771cae05f0e3/FLAG1d9d7dd37 [2024-11-28 02:06:54,501 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/data/469a7814a/6b52cf8ae80e479a8895771cae05f0e3 [2024-11-28 02:06:54,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:06:54,505 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:06:54,506 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:06:54,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:06:54,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:06:54,516 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:06:54" (1/1) ... [2024-11-28 02:06:54,517 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f1bc1d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:54, skipping insertion in model container [2024-11-28 02:06:54,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:06:54" (1/1) ... [2024-11-28 02:06:54,587 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:06:55,196 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 02:06:55,244 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 02:06:55,250 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 02:06:55,262 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 02:06:55,271 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 02:06:55,308 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 02:06:55,310 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 02:06:55,314 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 02:06:55,320 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 02:06:55,374 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 02:06:55,374 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 02:06:55,380 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 02:06:55,381 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 02:06:55,414 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 02:06:55,414 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 02:06:55,420 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 02:06:55,421 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 02:06:55,457 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 02:06:55,458 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 02:06:55,460 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 02:06:55,465 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 02:06:55,493 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 02:06:55,496 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 02:06:55,499 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 02:06:55,499 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 02:06:55,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:06:55,541 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:06:55,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:06:55,794 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:06:55,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55 WrapperNode [2024-11-28 02:06:55,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:06:55,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:06:55,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:06:55,797 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:06:55,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:55,852 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:56,008 INFO L138 Inliner]: procedures = 177, calls = 507, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3362 [2024-11-28 02:06:56,009 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:06:56,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:06:56,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:06:56,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:06:56,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:56,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:56,061 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:56,281 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [2, 372, 106]. 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, 82, 4]. [2024-11-28 02:06:56,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:56,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:56,361 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:56,365 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:56,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:56,398 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:56,407 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:56,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:06:56,433 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:06:56,433 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:06:56,434 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:06:56,435 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:56,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:06:56,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:06:56,479 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:06:56,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:06:56,515 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-11-28 02:06:56,516 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-11-28 02:06:56,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 02:06:56,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 02:06:56,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 02:06:56,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-28 02:06:56,516 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-28 02:06:56,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 02:06:56,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 02:06:56,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 02:06:56,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-28 02:06:56,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-28 02:06:56,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-28 02:06:56,520 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-28 02:06:56,520 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-28 02:06:56,520 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-28 02:06:56,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 02:06:56,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:06:56,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 02:06:56,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 02:06:56,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 02:06:56,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 02:06:56,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 02:06:56,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 02:06:56,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 02:06:56,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 02:06:56,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 02:06:56,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 02:06:56,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 02:06:56,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:06:56,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:06:56,942 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:06:56,945 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:06:57,041 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 02:06:57,087 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 02:06:57,117 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 02:07:02,895 INFO L? ?]: Removed 2487 outVars from TransFormulas that were not future-live. [2024-11-28 02:07:02,895 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:07:02,976 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:07:02,978 INFO L312 CfgBuilder]: Removed 85 assume(true) statements. [2024-11-28 02:07:02,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:07:02 BoogieIcfgContainer [2024-11-28 02:07:02,979 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:07:02,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:07:02,981 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:07:02,987 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:07:02,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:06:54" (1/3) ... [2024-11-28 02:07:02,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69abd25c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:07:02, skipping insertion in model container [2024-11-28 02:07:02,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55" (2/3) ... [2024-11-28 02:07:02,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69abd25c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:07:02, skipping insertion in model container [2024-11-28 02:07:02,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:07:02" (3/3) ... [2024-11-28 02:07:02,992 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test10-1.i [2024-11-28 02:07:03,010 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:07:03,012 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test10-1.i that has 6 procedures, 2661 locations, 1 initial locations, 84 loop locations, and 986 error locations. [2024-11-28 02:07:03,122 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:07:03,141 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;@11d1844a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:07:03,141 INFO L334 AbstractCegarLoop]: Starting to check reachability of 986 error locations. [2024-11-28 02:07:03,154 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 02:07:03,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 02:07:03,160 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:03,161 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 02:07:03,161 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 02:07:03,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:03,167 INFO L85 PathProgramCache]: Analyzing trace with hash 84472, now seen corresponding path program 1 times [2024-11-28 02:07:03,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:03,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522008758] [2024-11-28 02:07:03,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:03,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:03,422 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 02:07:03,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:03,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522008758] [2024-11-28 02:07:03,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522008758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:03,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:03,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:07:03,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678616384] [2024-11-28 02:07:03,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:03,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:07:03,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:03,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:07:03,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:03,470 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 02:07:05,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:05,886 INFO L93 Difference]: Finished difference Result 3237 states and 3808 transitions. [2024-11-28 02:07:05,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:07:05,888 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 02:07:05,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:05,933 INFO L225 Difference]: With dead ends: 3237 [2024-11-28 02:07:05,933 INFO L226 Difference]: Without dead ends: 3235 [2024-11-28 02:07:05,936 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 02:07:05,941 INFO L435 NwaCegarLoop]: 2198 mSDtfsCounter, 2870 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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, 2.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:05,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2880 Valid, 2735 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-28 02:07:05,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3235 states. [2024-11-28 02:07:06,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3235 to 2888. [2024-11-28 02:07:06,139 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 02:07:06,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 3612 transitions. [2024-11-28 02:07:06,163 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 3612 transitions. Word has length 3 [2024-11-28 02:07:06,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:06,164 INFO L471 AbstractCegarLoop]: Abstraction has 2888 states and 3612 transitions. [2024-11-28 02:07:06,164 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 02:07:06,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 3612 transitions. [2024-11-28 02:07:06,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 02:07:06,164 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:06,164 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 02:07:06,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 02:07:06,165 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 02:07:06,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:06,167 INFO L85 PathProgramCache]: Analyzing trace with hash 84473, now seen corresponding path program 1 times [2024-11-28 02:07:06,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:06,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702897681] [2024-11-28 02:07:06,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:06,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:06,353 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 02:07:06,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:06,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702897681] [2024-11-28 02:07:06,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702897681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:06,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:06,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:07:06,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170042190] [2024-11-28 02:07:06,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:06,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:07:06,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:06,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:07:06,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:06,358 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 02:07:09,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:09,096 INFO L93 Difference]: Finished difference Result 4958 states and 6135 transitions. [2024-11-28 02:07:09,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:07:09,096 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 02:07:09,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:09,113 INFO L225 Difference]: With dead ends: 4958 [2024-11-28 02:07:09,114 INFO L226 Difference]: Without dead ends: 4958 [2024-11-28 02:07:09,114 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 02:07:09,115 INFO L435 NwaCegarLoop]: 2400 mSDtfsCounter, 2503 mSDsluCounter, 2109 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:09,115 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.6s Time] [2024-11-28 02:07:09,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2024-11-28 02:07:09,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 4282. [2024-11-28 02:07:09,221 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 02:07:09,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4282 states to 4282 states and 6119 transitions. [2024-11-28 02:07:09,239 INFO L78 Accepts]: Start accepts. Automaton has 4282 states and 6119 transitions. Word has length 3 [2024-11-28 02:07:09,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:09,239 INFO L471 AbstractCegarLoop]: Abstraction has 4282 states and 6119 transitions. [2024-11-28 02:07:09,239 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 02:07:09,239 INFO L276 IsEmpty]: Start isEmpty. Operand 4282 states and 6119 transitions. [2024-11-28 02:07:09,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 02:07:09,239 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:09,239 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:09,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 02:07:09,240 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 02:07:09,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:09,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1567526949, now seen corresponding path program 1 times [2024-11-28 02:07:09,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:09,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102179343] [2024-11-28 02:07:09,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:09,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:09,376 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 02:07:09,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:09,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102179343] [2024-11-28 02:07:09,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102179343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:09,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:09,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:07:09,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695804689] [2024-11-28 02:07:09,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:09,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:07:09,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:09,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:07:09,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:09,378 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 02:07:11,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:11,391 INFO L93 Difference]: Finished difference Result 5367 states and 7441 transitions. [2024-11-28 02:07:11,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:07:11,392 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 02:07:11,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:11,430 INFO L225 Difference]: With dead ends: 5367 [2024-11-28 02:07:11,431 INFO L226 Difference]: Without dead ends: 5367 [2024-11-28 02:07:11,431 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 02:07:11,431 INFO L435 NwaCegarLoop]: 3530 mSDtfsCounter, 2841 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:11,432 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.9s Time] [2024-11-28 02:07:11,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5367 states. [2024-11-28 02:07:11,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5367 to 4190. [2024-11-28 02:07:11,548 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 02:07:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 5959 transitions. [2024-11-28 02:07:11,564 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 5959 transitions. Word has length 9 [2024-11-28 02:07:11,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:11,565 INFO L471 AbstractCegarLoop]: Abstraction has 4190 states and 5959 transitions. [2024-11-28 02:07:11,565 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 02:07:11,565 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 5959 transitions. [2024-11-28 02:07:11,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 02:07:11,566 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:11,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:11,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:07:11,566 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 02:07:11,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:11,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1567526950, now seen corresponding path program 1 times [2024-11-28 02:07:11,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:11,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897053102] [2024-11-28 02:07:11,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:11,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:11,767 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 02:07:11,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:11,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897053102] [2024-11-28 02:07:11,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897053102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:11,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:11,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:07:11,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665608340] [2024-11-28 02:07:11,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:11,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:07:11,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:11,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:07:11,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:11,770 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 02:07:13,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:13,766 INFO L93 Difference]: Finished difference Result 6927 states and 9910 transitions. [2024-11-28 02:07:13,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:07:13,767 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 02:07:13,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:13,785 INFO L225 Difference]: With dead ends: 6927 [2024-11-28 02:07:13,785 INFO L226 Difference]: Without dead ends: 6927 [2024-11-28 02:07:13,786 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 02:07:13,786 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 02:07:13,786 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 02:07:13,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6927 states. [2024-11-28 02:07:13,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6927 to 4722. [2024-11-28 02:07:13,882 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 02:07:13,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4722 states to 4722 states and 6903 transitions. [2024-11-28 02:07:13,894 INFO L78 Accepts]: Start accepts. Automaton has 4722 states and 6903 transitions. Word has length 9 [2024-11-28 02:07:13,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:13,894 INFO L471 AbstractCegarLoop]: Abstraction has 4722 states and 6903 transitions. [2024-11-28 02:07:13,894 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 02:07:13,894 INFO L276 IsEmpty]: Start isEmpty. Operand 4722 states and 6903 transitions. [2024-11-28 02:07:13,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 02:07:13,895 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:13,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:13,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 02:07:13,895 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 02:07:13,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:13,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1797781972, now seen corresponding path program 1 times [2024-11-28 02:07:13,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:13,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578351576] [2024-11-28 02:07:13,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:13,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:14,079 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 02:07:14,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:14,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578351576] [2024-11-28 02:07:14,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578351576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:14,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:14,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:07:14,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472038055] [2024-11-28 02:07:14,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:14,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:07:14,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:14,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:07:14,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:07:14,081 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 02:07:14,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:14,419 INFO L93 Difference]: Finished difference Result 6560 states and 9346 transitions. [2024-11-28 02:07:14,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:07:14,419 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 02:07:14,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:14,447 INFO L225 Difference]: With dead ends: 6560 [2024-11-28 02:07:14,451 INFO L226 Difference]: Without dead ends: 6560 [2024-11-28 02:07:14,451 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 02:07:14,452 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 02:07:14,452 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 02:07:14,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6560 states. [2024-11-28 02:07:14,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6560 to 4724. [2024-11-28 02:07:14,533 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 02:07:14,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4724 states to 4724 states and 6905 transitions. [2024-11-28 02:07:14,543 INFO L78 Accepts]: Start accepts. Automaton has 4724 states and 6905 transitions. Word has length 11 [2024-11-28 02:07:14,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:14,544 INFO L471 AbstractCegarLoop]: Abstraction has 4724 states and 6905 transitions. [2024-11-28 02:07:14,544 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 02:07:14,544 INFO L276 IsEmpty]: Start isEmpty. Operand 4724 states and 6905 transitions. [2024-11-28 02:07:14,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-28 02:07:14,545 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:14,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] [2024-11-28 02:07:14,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 02:07:14,545 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 02:07:14,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:14,545 INFO L85 PathProgramCache]: Analyzing trace with hash 494071061, now seen corresponding path program 1 times [2024-11-28 02:07:14,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:14,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573418453] [2024-11-28 02:07:14,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:14,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:14,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:07:14,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:14,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573418453] [2024-11-28 02:07:14,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573418453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:14,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:14,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:07:14,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980494989] [2024-11-28 02:07:14,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:14,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:07:14,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:14,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:07:14,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:07:14,745 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 02:07:15,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:15,054 INFO L93 Difference]: Finished difference Result 6560 states and 9345 transitions. [2024-11-28 02:07:15,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:07:15,055 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 02:07:15,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:15,076 INFO L225 Difference]: With dead ends: 6560 [2024-11-28 02:07:15,077 INFO L226 Difference]: Without dead ends: 6560 [2024-11-28 02:07:15,077 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 02:07:15,078 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 02:07:15,079 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 02:07:15,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6560 states. [2024-11-28 02:07:15,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6560 to 4735. [2024-11-28 02:07:15,227 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 02:07:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4735 states to 4735 states and 6916 transitions. [2024-11-28 02:07:15,244 INFO L78 Accepts]: Start accepts. Automaton has 4735 states and 6916 transitions. Word has length 21 [2024-11-28 02:07:15,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:15,245 INFO L471 AbstractCegarLoop]: Abstraction has 4735 states and 6916 transitions. [2024-11-28 02:07:15,245 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 02:07:15,245 INFO L276 IsEmpty]: Start isEmpty. Operand 4735 states and 6916 transitions. [2024-11-28 02:07:15,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-28 02:07:15,246 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:15,246 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 02:07:15,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 02:07:15,246 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 02:07:15,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:15,247 INFO L85 PathProgramCache]: Analyzing trace with hash -2007176747, now seen corresponding path program 1 times [2024-11-28 02:07:15,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:15,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682838754] [2024-11-28 02:07:15,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:15,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:15,391 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 02:07:15,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:15,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682838754] [2024-11-28 02:07:15,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682838754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:15,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:15,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:07:15,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998014813] [2024-11-28 02:07:15,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:15,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:07:15,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:15,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:07:15,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:07:15,395 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 02:07:17,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:17,565 INFO L93 Difference]: Finished difference Result 4810 states and 7022 transitions. [2024-11-28 02:07:17,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:07:17,566 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 02:07:17,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:17,578 INFO L225 Difference]: With dead ends: 4810 [2024-11-28 02:07:17,578 INFO L226 Difference]: Without dead ends: 4810 [2024-11-28 02:07:17,579 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 02:07:17,580 INFO L435 NwaCegarLoop]: 2027 mSDtfsCounter, 3104 mSDsluCounter, 1903 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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, 2.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:17,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3114 Valid, 3930 Invalid, 2041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2009 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-28 02:07:17,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2024-11-28 02:07:17,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4712. [2024-11-28 02:07:17,744 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 02:07:17,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4712 states to 4712 states and 6870 transitions. [2024-11-28 02:07:17,771 INFO L78 Accepts]: Start accepts. Automaton has 4712 states and 6870 transitions. Word has length 21 [2024-11-28 02:07:17,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:17,771 INFO L471 AbstractCegarLoop]: Abstraction has 4712 states and 6870 transitions. [2024-11-28 02:07:17,771 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 02:07:17,771 INFO L276 IsEmpty]: Start isEmpty. Operand 4712 states and 6870 transitions. [2024-11-28 02:07:17,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-28 02:07:17,772 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:17,772 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 02:07:17,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 02:07:17,772 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 02:07:17,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:17,773 INFO L85 PathProgramCache]: Analyzing trace with hash -2007176746, now seen corresponding path program 1 times [2024-11-28 02:07:17,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:17,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505874136] [2024-11-28 02:07:17,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:17,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:07:17,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:17,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505874136] [2024-11-28 02:07:17,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505874136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:17,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:17,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:07:17,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088611087] [2024-11-28 02:07:17,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:17,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:07:17,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:17,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:07:17,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:17,953 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 02:07:18,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:18,024 INFO L93 Difference]: Finished difference Result 4574 states and 6664 transitions. [2024-11-28 02:07:18,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:07:18,025 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 02:07:18,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:18,038 INFO L225 Difference]: With dead ends: 4574 [2024-11-28 02:07:18,039 INFO L226 Difference]: Without dead ends: 4574 [2024-11-28 02:07:18,040 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 02:07:18,040 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 02:07:18,041 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 02:07:18,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2024-11-28 02:07:18,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 4574. [2024-11-28 02:07:18,111 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 02:07:18,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4574 states to 4574 states and 6664 transitions. [2024-11-28 02:07:18,125 INFO L78 Accepts]: Start accepts. Automaton has 4574 states and 6664 transitions. Word has length 21 [2024-11-28 02:07:18,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:18,126 INFO L471 AbstractCegarLoop]: Abstraction has 4574 states and 6664 transitions. [2024-11-28 02:07:18,127 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 02:07:18,127 INFO L276 IsEmpty]: Start isEmpty. Operand 4574 states and 6664 transitions. [2024-11-28 02:07:18,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-28 02:07:18,127 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:18,128 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 02:07:18,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 02:07:18,128 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 02:07:18,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:18,128 INFO L85 PathProgramCache]: Analyzing trace with hash -456258833, now seen corresponding path program 1 times [2024-11-28 02:07:18,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:18,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228957252] [2024-11-28 02:07:18,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:18,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:18,258 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 02:07:18,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:18,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228957252] [2024-11-28 02:07:18,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228957252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:18,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:18,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:07:18,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281170367] [2024-11-28 02:07:18,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:18,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:07:18,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:18,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:07:18,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:07:18,261 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 02:07:18,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:18,373 INFO L93 Difference]: Finished difference Result 4545 states and 6614 transitions. [2024-11-28 02:07:18,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:07:18,374 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 02:07:18,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:18,387 INFO L225 Difference]: With dead ends: 4545 [2024-11-28 02:07:18,387 INFO L226 Difference]: Without dead ends: 4545 [2024-11-28 02:07:18,387 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 02:07:18,388 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.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:18,389 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.1s Time] [2024-11-28 02:07:18,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4545 states. [2024-11-28 02:07:18,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4545 to 4539. [2024-11-28 02:07:18,457 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 02:07:18,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4539 states to 4539 states and 6608 transitions. [2024-11-28 02:07:18,468 INFO L78 Accepts]: Start accepts. Automaton has 4539 states and 6608 transitions. Word has length 23 [2024-11-28 02:07:18,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:18,468 INFO L471 AbstractCegarLoop]: Abstraction has 4539 states and 6608 transitions. [2024-11-28 02:07:18,469 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 02:07:18,469 INFO L276 IsEmpty]: Start isEmpty. Operand 4539 states and 6608 transitions. [2024-11-28 02:07:18,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 02:07:18,470 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:18,470 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 02:07:18,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 02:07:18,470 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 02:07:18,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:18,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1116825789, now seen corresponding path program 1 times [2024-11-28 02:07:18,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:18,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956028239] [2024-11-28 02:07:18,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:18,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:18,843 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 02:07:18,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:18,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956028239] [2024-11-28 02:07:18,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956028239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:18,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:18,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:07:18,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944942667] [2024-11-28 02:07:18,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:18,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:07:18,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:18,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:07:18,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:07:18,846 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 02:07:22,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:22,059 INFO L93 Difference]: Finished difference Result 6838 states and 9759 transitions. [2024-11-28 02:07:22,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:07:22,060 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 02:07:22,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:22,078 INFO L225 Difference]: With dead ends: 6838 [2024-11-28 02:07:22,078 INFO L226 Difference]: Without dead ends: 6838 [2024-11-28 02:07:22,079 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 02:07:22,079 INFO L435 NwaCegarLoop]: 2293 mSDtfsCounter, 2319 mSDsluCounter, 3652 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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, 3.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:22,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2323 Valid, 5945 Invalid, 2386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2383 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-28 02:07:22,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6838 states. [2024-11-28 02:07:22,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6838 to 4535. [2024-11-28 02:07:22,178 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 02:07:22,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4535 states to 4535 states and 6600 transitions. [2024-11-28 02:07:22,193 INFO L78 Accepts]: Start accepts. Automaton has 4535 states and 6600 transitions. Word has length 37 [2024-11-28 02:07:22,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:22,193 INFO L471 AbstractCegarLoop]: Abstraction has 4535 states and 6600 transitions. [2024-11-28 02:07:22,193 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 02:07:22,194 INFO L276 IsEmpty]: Start isEmpty. Operand 4535 states and 6600 transitions. [2024-11-28 02:07:22,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-28 02:07:22,196 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:22,196 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 02:07:22,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 02:07:22,196 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 02:07:22,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:22,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1260687181, now seen corresponding path program 1 times [2024-11-28 02:07:22,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:22,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603031325] [2024-11-28 02:07:22,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:22,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:22,477 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 02:07:22,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:22,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603031325] [2024-11-28 02:07:22,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603031325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:22,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:22,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:07:22,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360139369] [2024-11-28 02:07:22,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:22,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:07:22,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:22,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:07:22,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:07:22,480 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 02:07:22,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:22,586 INFO L93 Difference]: Finished difference Result 4535 states and 6592 transitions. [2024-11-28 02:07:22,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:07:22,587 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 02:07:22,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:22,599 INFO L225 Difference]: With dead ends: 4535 [2024-11-28 02:07:22,600 INFO L226 Difference]: Without dead ends: 4535 [2024-11-28 02:07:22,600 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 02:07:22,601 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.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:22,601 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.1s Time] [2024-11-28 02:07:22,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4535 states. [2024-11-28 02:07:22,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4535 to 4535. [2024-11-28 02:07:22,662 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 02:07:22,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4535 states to 4535 states and 6592 transitions. [2024-11-28 02:07:22,673 INFO L78 Accepts]: Start accepts. Automaton has 4535 states and 6592 transitions. Word has length 71 [2024-11-28 02:07:22,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:22,674 INFO L471 AbstractCegarLoop]: Abstraction has 4535 states and 6592 transitions. [2024-11-28 02:07:22,675 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 02:07:22,675 INFO L276 IsEmpty]: Start isEmpty. Operand 4535 states and 6592 transitions. [2024-11-28 02:07:22,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-28 02:07:22,677 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:22,677 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 02:07:22,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 02:07:22,677 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 02:07:22,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:22,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1330640513, now seen corresponding path program 1 times [2024-11-28 02:07:22,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:22,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990545208] [2024-11-28 02:07:22,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:22,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:22,877 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 02:07:22,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:22,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990545208] [2024-11-28 02:07:22,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990545208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:22,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:22,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:07:22,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031462838] [2024-11-28 02:07:22,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:22,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:07:22,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:22,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:07:22,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:22,879 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 02:07:23,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:23,043 INFO L93 Difference]: Finished difference Result 6039 states and 8771 transitions. [2024-11-28 02:07:23,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:07:23,044 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 02:07:23,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:23,057 INFO L225 Difference]: With dead ends: 6039 [2024-11-28 02:07:23,057 INFO L226 Difference]: Without dead ends: 6039 [2024-11-28 02:07:23,058 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 02:07:23,058 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 02:07:23,059 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 02:07:23,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6039 states. [2024-11-28 02:07:23,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6039 to 5388. [2024-11-28 02:07:23,130 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 02:07:23,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5388 states to 5388 states and 8018 transitions. [2024-11-28 02:07:23,144 INFO L78 Accepts]: Start accepts. Automaton has 5388 states and 8018 transitions. Word has length 79 [2024-11-28 02:07:23,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:23,145 INFO L471 AbstractCegarLoop]: Abstraction has 5388 states and 8018 transitions. [2024-11-28 02:07:23,145 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 02:07:23,146 INFO L276 IsEmpty]: Start isEmpty. Operand 5388 states and 8018 transitions. [2024-11-28 02:07:23,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-28 02:07:23,149 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:23,149 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 02:07:23,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 02:07:23,149 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 02:07:23,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:23,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1327628103, now seen corresponding path program 1 times [2024-11-28 02:07:23,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:23,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114198089] [2024-11-28 02:07:23,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:23,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:23,819 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 02:07:23,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:23,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114198089] [2024-11-28 02:07:23,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114198089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:23,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:23,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:07:23,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680157249] [2024-11-28 02:07:23,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:23,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:07:23,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:23,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:07:23,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:07:23,822 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 02:07:26,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:26,303 INFO L93 Difference]: Finished difference Result 5304 states and 7876 transitions. [2024-11-28 02:07:26,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:07:26,304 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 02:07:26,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:26,318 INFO L225 Difference]: With dead ends: 5304 [2024-11-28 02:07:26,318 INFO L226 Difference]: Without dead ends: 5304 [2024-11-28 02:07:26,319 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 02:07:26,319 INFO L435 NwaCegarLoop]: 1551 mSDtfsCounter, 2658 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 2463 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:26,320 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.4s Time] [2024-11-28 02:07:26,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5304 states. [2024-11-28 02:07:26,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5304 to 4762. [2024-11-28 02:07:26,388 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 02:07:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4762 states to 4762 states and 6912 transitions. [2024-11-28 02:07:26,398 INFO L78 Accepts]: Start accepts. Automaton has 4762 states and 6912 transitions. Word has length 82 [2024-11-28 02:07:26,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:26,398 INFO L471 AbstractCegarLoop]: Abstraction has 4762 states and 6912 transitions. [2024-11-28 02:07:26,399 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 02:07:26,399 INFO L276 IsEmpty]: Start isEmpty. Operand 4762 states and 6912 transitions. [2024-11-28 02:07:26,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-28 02:07:26,400 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:26,400 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 02:07:26,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 02:07:26,401 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 02:07:26,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:26,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1108578542, now seen corresponding path program 1 times [2024-11-28 02:07:26,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:26,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172715726] [2024-11-28 02:07:26,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:26,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:26,823 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 02:07:26,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:26,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172715726] [2024-11-28 02:07:26,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172715726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:26,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:26,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:07:26,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495485893] [2024-11-28 02:07:26,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:26,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:07:26,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:26,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:07:26,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:07:26,826 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 02:07:28,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:28,662 INFO L93 Difference]: Finished difference Result 4761 states and 6910 transitions. [2024-11-28 02:07:28,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:07:28,662 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 02:07:28,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:28,673 INFO L225 Difference]: With dead ends: 4761 [2024-11-28 02:07:28,673 INFO L226 Difference]: Without dead ends: 4761 [2024-11-28 02:07:28,673 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 02:07:28,674 INFO L435 NwaCegarLoop]: 2744 mSDtfsCounter, 2 mSDsluCounter, 5747 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:28,674 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.7s Time] [2024-11-28 02:07:28,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4761 states. [2024-11-28 02:07:28,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4761 to 4761. [2024-11-28 02:07:28,746 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 02:07:28,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4761 states to 4761 states and 6910 transitions. [2024-11-28 02:07:28,758 INFO L78 Accepts]: Start accepts. Automaton has 4761 states and 6910 transitions. Word has length 87 [2024-11-28 02:07:28,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:28,758 INFO L471 AbstractCegarLoop]: Abstraction has 4761 states and 6910 transitions. [2024-11-28 02:07:28,758 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 02:07:28,758 INFO L276 IsEmpty]: Start isEmpty. Operand 4761 states and 6910 transitions. [2024-11-28 02:07:28,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-28 02:07:28,759 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:28,760 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 02:07:28,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 02:07:28,760 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 02:07:28,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:28,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1108578541, now seen corresponding path program 1 times [2024-11-28 02:07:28,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:28,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936306500] [2024-11-28 02:07:28,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:28,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:29,328 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 02:07:29,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:29,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936306500] [2024-11-28 02:07:29,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936306500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:29,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:29,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:07:29,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443282557] [2024-11-28 02:07:29,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:29,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:07:29,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:29,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:07:29,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:07:29,330 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 02:07:31,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:31,699 INFO L93 Difference]: Finished difference Result 4760 states and 6908 transitions. [2024-11-28 02:07:31,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:07:31,699 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 02:07:31,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:31,710 INFO L225 Difference]: With dead ends: 4760 [2024-11-28 02:07:31,710 INFO L226 Difference]: Without dead ends: 4760 [2024-11-28 02:07:31,710 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 02:07:31,711 INFO L435 NwaCegarLoop]: 2744 mSDtfsCounter, 1 mSDsluCounter, 5721 mSDsCounter, 0 mSdLazyCounter, 2515 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:31,711 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.3s Time] [2024-11-28 02:07:31,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4760 states. [2024-11-28 02:07:31,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4760 to 4760. [2024-11-28 02:07:31,767 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 02:07:31,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4760 states to 4760 states and 6908 transitions. [2024-11-28 02:07:31,776 INFO L78 Accepts]: Start accepts. Automaton has 4760 states and 6908 transitions. Word has length 87 [2024-11-28 02:07:31,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:31,776 INFO L471 AbstractCegarLoop]: Abstraction has 4760 states and 6908 transitions. [2024-11-28 02:07:31,776 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 02:07:31,776 INFO L276 IsEmpty]: Start isEmpty. Operand 4760 states and 6908 transitions. [2024-11-28 02:07:31,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-28 02:07:31,777 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:31,777 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 02:07:31,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 02:07:31,778 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 02:07:31,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:31,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1173745657, now seen corresponding path program 1 times [2024-11-28 02:07:31,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:31,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120235946] [2024-11-28 02:07:31,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:31,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:32,133 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 02:07:32,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:32,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120235946] [2024-11-28 02:07:32,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120235946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:32,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:32,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:07:32,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542666697] [2024-11-28 02:07:32,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:32,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:07:32,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:32,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:07:32,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:07:32,137 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 02:07:34,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:34,369 INFO L93 Difference]: Finished difference Result 4778 states and 6941 transitions. [2024-11-28 02:07:34,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:07:34,369 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 02:07:34,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:34,383 INFO L225 Difference]: With dead ends: 4778 [2024-11-28 02:07:34,383 INFO L226 Difference]: Without dead ends: 4778 [2024-11-28 02:07:34,383 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 02:07:34,384 INFO L435 NwaCegarLoop]: 2708 mSDtfsCounter, 27 mSDsluCounter, 8674 mSDsCounter, 0 mSdLazyCounter, 2350 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 11382 SdHoareTripleChecker+Invalid, 2361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:34,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 11382 Invalid, 2361 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [11 Valid, 2350 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-28 02:07:34,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4778 states. [2024-11-28 02:07:34,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4778 to 4769. [2024-11-28 02:07:34,457 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 02:07:34,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4769 states to 4769 states and 6931 transitions. [2024-11-28 02:07:34,466 INFO L78 Accepts]: Start accepts. Automaton has 4769 states and 6931 transitions. Word has length 95 [2024-11-28 02:07:34,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:34,467 INFO L471 AbstractCegarLoop]: Abstraction has 4769 states and 6931 transitions. [2024-11-28 02:07:34,467 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 02:07:34,467 INFO L276 IsEmpty]: Start isEmpty. Operand 4769 states and 6931 transitions. [2024-11-28 02:07:34,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-28 02:07:34,468 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:34,468 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 02:07:34,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 02:07:34,468 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 02:07:34,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:34,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1173745658, now seen corresponding path program 1 times [2024-11-28 02:07:34,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:34,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352608518] [2024-11-28 02:07:34,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:34,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:35,129 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 02:07:35,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:35,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352608518] [2024-11-28 02:07:35,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352608518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:35,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:35,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:07:35,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248216754] [2024-11-28 02:07:35,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:35,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:07:35,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:35,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:07:35,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:07:35,133 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 02:07:37,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:37,892 INFO L93 Difference]: Finished difference Result 4769 states and 6929 transitions. [2024-11-28 02:07:37,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:07:37,893 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 02:07:37,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:37,906 INFO L225 Difference]: With dead ends: 4769 [2024-11-28 02:07:37,906 INFO L226 Difference]: Without dead ends: 4769 [2024-11-28 02:07:37,906 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 02:07:37,907 INFO L435 NwaCegarLoop]: 2715 mSDtfsCounter, 22 mSDsluCounter, 8085 mSDsCounter, 0 mSdLazyCounter, 2892 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 10800 SdHoareTripleChecker+Invalid, 2901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:37,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 10800 Invalid, 2901 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9 Valid, 2892 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-28 02:07:37,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states. [2024-11-28 02:07:37,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 4769. [2024-11-28 02:07:37,977 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 02:07:37,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4769 states to 4769 states and 6929 transitions. [2024-11-28 02:07:37,987 INFO L78 Accepts]: Start accepts. Automaton has 4769 states and 6929 transitions. Word has length 95 [2024-11-28 02:07:37,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:37,988 INFO L471 AbstractCegarLoop]: Abstraction has 4769 states and 6929 transitions. [2024-11-28 02:07:37,988 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 02:07:37,988 INFO L276 IsEmpty]: Start isEmpty. Operand 4769 states and 6929 transitions. [2024-11-28 02:07:37,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-28 02:07:37,989 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:37,989 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 02:07:37,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 02:07:37,990 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 02:07:37,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:37,990 INFO L85 PathProgramCache]: Analyzing trace with hash -535531392, now seen corresponding path program 1 times [2024-11-28 02:07:37,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:37,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233934658] [2024-11-28 02:07:37,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:37,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:38,817 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 02:07:38,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:38,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233934658] [2024-11-28 02:07:38,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233934658] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:07:38,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217047272] [2024-11-28 02:07:38,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:38,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:38,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:07:38,824 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:07:38,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:07:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:39,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-28 02:07:39,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:07:39,290 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 02:07:39,539 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:07:39,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 02:07:39,596 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 02:07:39,738 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 02:07:40,004 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:07:40,004 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 02:07:40,071 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 02:07:40,133 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 02:07:40,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:07:40,195 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_661 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_661) |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 02:07:40,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217047272] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:07:40,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:07:40,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-28 02:07:40,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890729757] [2024-11-28 02:07:40,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:07:40,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 02:07:40,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:40,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 02:07:40,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2024-11-28 02:07:40,200 INFO L87 Difference]: Start difference. First operand 4769 states and 6929 transitions. Second operand has 19 states, 16 states have (on average 9.5) internal successors, (152), 18 states have internal predecessors, (152), 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 02:07:46,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:46,928 INFO L93 Difference]: Finished difference Result 4776 states and 6935 transitions. [2024-11-28 02:07:46,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:07:46,929 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.5) internal successors, (152), 18 states have internal predecessors, (152), 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 02:07:46,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:46,942 INFO L225 Difference]: With dead ends: 4776 [2024-11-28 02:07:46,942 INFO L226 Difference]: Without dead ends: 4776 [2024-11-28 02:07:46,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=427, Unknown=1, NotChecked=42, Total=552 [2024-11-28 02:07:46,943 INFO L435 NwaCegarLoop]: 1893 mSDtfsCounter, 2650 mSDsluCounter, 18713 mSDsCounter, 0 mSdLazyCounter, 9612 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2668 SdHoareTripleChecker+Valid, 20606 SdHoareTripleChecker+Invalid, 9639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 9612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:46,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2668 Valid, 20606 Invalid, 9639 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 9612 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-11-28 02:07:46,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4776 states. [2024-11-28 02:07:47,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4776 to 4773. [2024-11-28 02:07:47,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4773 states, 4028 states have (on average 1.7045680238331677) internal successors, (6866), 4743 states have internal predecessors, (6866), 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 02:07:47,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4773 states to 4773 states and 6922 transitions. [2024-11-28 02:07:47,027 INFO L78 Accepts]: Start accepts. Automaton has 4773 states and 6922 transitions. Word has length 96 [2024-11-28 02:07:47,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:47,028 INFO L471 AbstractCegarLoop]: Abstraction has 4773 states and 6922 transitions. [2024-11-28 02:07:47,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.5) internal successors, (152), 18 states have internal predecessors, (152), 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 02:07:47,028 INFO L276 IsEmpty]: Start isEmpty. Operand 4773 states and 6922 transitions. [2024-11-28 02:07:47,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-28 02:07:47,029 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:47,030 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 02:07:47,045 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 02:07:47,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-28 02:07:47,231 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 02:07:47,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:47,232 INFO L85 PathProgramCache]: Analyzing trace with hash -535531391, now seen corresponding path program 1 times [2024-11-28 02:07:47,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:47,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429225819] [2024-11-28 02:07:47,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:47,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:48,383 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 02:07:48,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:48,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429225819] [2024-11-28 02:07:48,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429225819] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:07:48,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841507376] [2024-11-28 02:07:48,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:48,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:48,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:07:48,387 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:07:48,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:07:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:48,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-28 02:07:48,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:07:48,794 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 02:07:48,995 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:07:48,996 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 02:07:49,004 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 02:07:49,025 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 02:07:49,035 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 02:07:49,134 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 02:07:49,140 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 02:07:49,298 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:07:49,298 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 02:07:49,304 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 02:07:49,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:07:49,357 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 02:07:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:07:49,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:07:49,486 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$#1.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$#1.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$#1.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 02:07:49,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841507376] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:07:49,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:07:49,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2024-11-28 02:07:49,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96039022] [2024-11-28 02:07:49,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:07:49,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 02:07:49,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:49,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 02:07:49,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2024-11-28 02:07:49,491 INFO L87 Difference]: Start difference. First operand 4773 states and 6922 transitions. Second operand has 15 states, 12 states have (on average 12.166666666666666) internal successors, (146), 15 states have internal predecessors, (146), 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 02:07:58,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:58,707 INFO L93 Difference]: Finished difference Result 4775 states and 6933 transitions. [2024-11-28 02:07:58,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 02:07:58,707 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 12.166666666666666) internal successors, (146), 15 states have internal predecessors, (146), 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 02:07:58,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:58,713 INFO L225 Difference]: With dead ends: 4775 [2024-11-28 02:07:58,713 INFO L226 Difference]: Without dead ends: 4775 [2024-11-28 02:07:58,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=345, Unknown=1, NotChecked=38, Total=462 [2024-11-28 02:07:58,714 INFO L435 NwaCegarLoop]: 1899 mSDtfsCounter, 2648 mSDsluCounter, 16491 mSDsCounter, 0 mSdLazyCounter, 11686 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2666 SdHoareTripleChecker+Valid, 18390 SdHoareTripleChecker+Invalid, 11710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 11686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:58,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2666 Valid, 18390 Invalid, 11710 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 11686 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2024-11-28 02:07:58,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4775 states. [2024-11-28 02:07:58,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4775 to 4763. [2024-11-28 02:07:58,776 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 02:07:58,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4763 states to 4763 states and 6909 transitions. [2024-11-28 02:07:58,786 INFO L78 Accepts]: Start accepts. Automaton has 4763 states and 6909 transitions. Word has length 96 [2024-11-28 02:07:58,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:58,786 INFO L471 AbstractCegarLoop]: Abstraction has 4763 states and 6909 transitions. [2024-11-28 02:07:58,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 12.166666666666666) internal successors, (146), 15 states have internal predecessors, (146), 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 02:07:58,787 INFO L276 IsEmpty]: Start isEmpty. Operand 4763 states and 6909 transitions. [2024-11-28 02:07:58,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-28 02:07:58,788 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:58,788 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 02:07:58,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 02:07:58,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:58,990 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 02:07:58,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:58,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1728782254, now seen corresponding path program 1 times [2024-11-28 02:07:58,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:58,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792304169] [2024-11-28 02:07:58,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:58,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:59,750 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 02:07:59,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:59,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792304169] [2024-11-28 02:07:59,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792304169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:59,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:59,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 02:07:59,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232778102] [2024-11-28 02:07:59,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:59,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 02:07:59,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:59,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 02:07:59,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-28 02:07:59,755 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 02:08:05,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:05,226 INFO L93 Difference]: Finished difference Result 4782 states and 6941 transitions. [2024-11-28 02:08:05,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:08:05,226 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 02:08:05,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:05,234 INFO L225 Difference]: With dead ends: 4782 [2024-11-28 02:08:05,234 INFO L226 Difference]: Without dead ends: 4782 [2024-11-28 02:08:05,235 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 02:08:05,235 INFO L435 NwaCegarLoop]: 1893 mSDtfsCounter, 2682 mSDsluCounter, 16811 mSDsCounter, 0 mSdLazyCounter, 8718 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2700 SdHoareTripleChecker+Valid, 18704 SdHoareTripleChecker+Invalid, 8741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 8718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:05,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2700 Valid, 18704 Invalid, 8741 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 8718 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-28 02:08:05,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4782 states. [2024-11-28 02:08:05,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4782 to 4778. [2024-11-28 02:08:05,294 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 02:08:05,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4778 states to 4778 states and 6928 transitions. [2024-11-28 02:08:05,303 INFO L78 Accepts]: Start accepts. Automaton has 4778 states and 6928 transitions. Word has length 98 [2024-11-28 02:08:05,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:05,304 INFO L471 AbstractCegarLoop]: Abstraction has 4778 states and 6928 transitions. [2024-11-28 02:08:05,304 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 02:08:05,304 INFO L276 IsEmpty]: Start isEmpty. Operand 4778 states and 6928 transitions. [2024-11-28 02:08:05,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-28 02:08:05,305 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:05,305 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 02:08:05,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 02:08:05,306 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 02:08:05,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:05,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1728782255, now seen corresponding path program 1 times [2024-11-28 02:08:05,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:05,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611252779] [2024-11-28 02:08:05,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:05,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:06,296 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 02:08:06,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:06,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611252779] [2024-11-28 02:08:06,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611252779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:08:06,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:08:06,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 02:08:06,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463076713] [2024-11-28 02:08:06,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:08:06,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 02:08:06,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:06,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 02:08:06,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-28 02:08:06,299 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 02:08:11,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:11,657 INFO L93 Difference]: Finished difference Result 4781 states and 6939 transitions. [2024-11-28 02:08:11,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:08:11,657 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 02:08:11,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:11,666 INFO L225 Difference]: With dead ends: 4781 [2024-11-28 02:08:11,666 INFO L226 Difference]: Without dead ends: 4781 [2024-11-28 02:08:11,667 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 02:08:11,669 INFO L435 NwaCegarLoop]: 1900 mSDtfsCounter, 2663 mSDsluCounter, 10112 mSDsCounter, 0 mSdLazyCounter, 7182 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s 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, 5.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:11,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2681 Valid, 12012 Invalid, 7204 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 7182 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-28 02:08:11,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4781 states. [2024-11-28 02:08:11,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4781 to 4778. [2024-11-28 02:08:11,735 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 02:08:11,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4778 states to 4778 states and 6926 transitions. [2024-11-28 02:08:11,745 INFO L78 Accepts]: Start accepts. Automaton has 4778 states and 6926 transitions. Word has length 98 [2024-11-28 02:08:11,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:11,746 INFO L471 AbstractCegarLoop]: Abstraction has 4778 states and 6926 transitions. [2024-11-28 02:08:11,746 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 02:08:11,746 INFO L276 IsEmpty]: Start isEmpty. Operand 4778 states and 6926 transitions. [2024-11-28 02:08:11,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-28 02:08:11,747 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:11,748 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 02:08:11,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 02:08:11,749 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 02:08:11,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:11,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1788476871, now seen corresponding path program 1 times [2024-11-28 02:08:11,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:11,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194755793] [2024-11-28 02:08:11,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:11,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:12,524 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 02:08:12,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:12,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194755793] [2024-11-28 02:08:12,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194755793] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:08:12,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80762515] [2024-11-28 02:08:12,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:12,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:08:12,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:08:12,528 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:08:12,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 02:08:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:12,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-28 02:08:12,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:08:12,955 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 02:08:13,147 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:08:13,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 02:08:13,196 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 02:08:13,307 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 02:08:13,518 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:08:13,518 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 02:08:13,657 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:08:13,657 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 02:08:13,680 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 02:08:13,726 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 02:08:13,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:08:13,742 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1086 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.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 02:08:13,752 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$#1.base| (select (select |c_#memory_$Pointer$#1.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 02:08:13,825 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1086 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~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))) 1)) is different from false [2024-11-28 02:08:13,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80762515] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:08:13,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:08:13,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-11-28 02:08:13,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780698913] [2024-11-28 02:08:13,827 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:08:13,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 02:08:13,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:13,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 02:08:13,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=395, Unknown=3, NotChecked=126, Total=600 [2024-11-28 02:08:13,829 INFO L87 Difference]: Start difference. First operand 4778 states and 6926 transitions. Second operand has 22 states, 19 states have (on average 8.31578947368421) internal successors, (158), 21 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 02:08:22,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:22,347 INFO L93 Difference]: Finished difference Result 4780 states and 6937 transitions. [2024-11-28 02:08:22,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:08:22,348 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.31578947368421) internal successors, (158), 21 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 02:08:22,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:22,354 INFO L225 Difference]: With dead ends: 4780 [2024-11-28 02:08:22,354 INFO L226 Difference]: Without dead ends: 4780 [2024-11-28 02:08:22,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=512, Unknown=3, NotChecked=144, Total=756 [2024-11-28 02:08:22,356 INFO L435 NwaCegarLoop]: 1892 mSDtfsCounter, 2639 mSDsluCounter, 24291 mSDsCounter, 0 mSdLazyCounter, 12133 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2657 SdHoareTripleChecker+Valid, 26183 SdHoareTripleChecker+Invalid, 12157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 12133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:22,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2657 Valid, 26183 Invalid, 12157 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 12133 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2024-11-28 02:08:22,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4780 states. [2024-11-28 02:08:22,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4780 to 4777. [2024-11-28 02:08:22,406 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 02:08:22,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4777 states to 4777 states and 6924 transitions. [2024-11-28 02:08:22,415 INFO L78 Accepts]: Start accepts. Automaton has 4777 states and 6924 transitions. Word has length 99 [2024-11-28 02:08:22,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:22,416 INFO L471 AbstractCegarLoop]: Abstraction has 4777 states and 6924 transitions. [2024-11-28 02:08:22,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.31578947368421) internal successors, (158), 21 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 02:08:22,416 INFO L276 IsEmpty]: Start isEmpty. Operand 4777 states and 6924 transitions. [2024-11-28 02:08:22,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-28 02:08:22,417 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:08:22,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 02:08:22,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:08:22,622 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 02:08:22,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:22,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1788476872, now seen corresponding path program 1 times [2024-11-28 02:08:22,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:22,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762775367] [2024-11-28 02:08:22,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:22,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:23,717 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 02:08:23,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:23,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762775367] [2024-11-28 02:08:23,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762775367] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:08:23,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591936720] [2024-11-28 02:08:23,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:23,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:08:23,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:08:23,721 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:08:23,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 02:08:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:24,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-28 02:08:24,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:08:24,136 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 02:08:24,294 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 02:08:24,303 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:08:24,304 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 02:08:24,342 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 02:08:24,347 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 02:08:24,469 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 02:08:24,476 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 02:08:24,646 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:08:24,647 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 02:08:24,656 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 02:08:24,772 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:08:24,773 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 02:08:24,779 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 02:08:24,809 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 02:08:24,815 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 02:08:24,841 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 02:08:24,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:08:24,931 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1240 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1240) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1240 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1240) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1241) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 02:08:24,946 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1240 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1240) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1241) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1240 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1240) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2024-11-28 02:08:25,018 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1247 (Array Int Int)) (v_ArrVal_1246 (Array Int Int)) (v_ArrVal_1240 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1246) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1247) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1240) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1247 (Array Int Int)) (v_ArrVal_1246 (Array Int Int)) (v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1240 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1247))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1246) .cse1 v_ArrVal_1240) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1241) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-28 02:08:25,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591936720] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:08:25,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:08:25,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-11-28 02:08:25,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131966225] [2024-11-28 02:08:25,020 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:08:25,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 02:08:25,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:25,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 02:08:25,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=398, Unknown=3, NotChecked=126, Total=600 [2024-11-28 02:08:25,022 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 02:08:37,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:37,446 INFO L93 Difference]: Finished difference Result 4779 states and 6935 transitions. [2024-11-28 02:08:37,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:08:37,447 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 02:08:37,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:37,452 INFO L225 Difference]: With dead ends: 4779 [2024-11-28 02:08:37,452 INFO L226 Difference]: Without dead ends: 4779 [2024-11-28 02:08:37,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=595, Unknown=3, NotChecked=156, Total=870 [2024-11-28 02:08:37,453 INFO L435 NwaCegarLoop]: 1898 mSDtfsCounter, 2664 mSDsluCounter, 22153 mSDsCounter, 0 mSdLazyCounter, 17072 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2682 SdHoareTripleChecker+Valid, 24051 SdHoareTripleChecker+Invalid, 17116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 17072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:37,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2682 Valid, 24051 Invalid, 17116 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [44 Valid, 17072 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2024-11-28 02:08:37,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4779 states. [2024-11-28 02:08:37,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4779 to 4761. [2024-11-28 02:08:37,510 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 02:08:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4761 states to 4761 states and 6905 transitions. [2024-11-28 02:08:37,519 INFO L78 Accepts]: Start accepts. Automaton has 4761 states and 6905 transitions. Word has length 99 [2024-11-28 02:08:37,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:37,520 INFO L471 AbstractCegarLoop]: Abstraction has 4761 states and 6905 transitions. [2024-11-28 02:08:37,520 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 02:08:37,520 INFO L276 IsEmpty]: Start isEmpty. Operand 4761 states and 6905 transitions. [2024-11-28 02:08:37,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-28 02:08:37,521 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:37,522 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 02:08:37,534 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 02:08:37,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-28 02:08:37,726 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 02:08:37,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:37,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1199960832, now seen corresponding path program 1 times [2024-11-28 02:08:37,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:37,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740778143] [2024-11-28 02:08:37,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:37,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:38,494 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 02:08:38,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:38,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740778143] [2024-11-28 02:08:38,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740778143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:08:38,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:08:38,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 02:08:38,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185164669] [2024-11-28 02:08:38,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:08:38,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 02:08:38,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:38,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 02:08:38,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-28 02:08:38,497 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 02:08:43,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:43,842 INFO L93 Difference]: Finished difference Result 4786 states and 6943 transitions. [2024-11-28 02:08:43,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:08:43,842 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 02:08:43,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:43,847 INFO L225 Difference]: With dead ends: 4786 [2024-11-28 02:08:43,847 INFO L226 Difference]: Without dead ends: 4786 [2024-11-28 02:08:43,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-28 02:08:43,848 INFO L435 NwaCegarLoop]: 1892 mSDtfsCounter, 2685 mSDsluCounter, 16842 mSDsCounter, 0 mSdLazyCounter, 8710 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2703 SdHoareTripleChecker+Valid, 18734 SdHoareTripleChecker+Invalid, 8733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 8710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:43,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2703 Valid, 18734 Invalid, 8733 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 8710 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-28 02:08:43,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4786 states. [2024-11-28 02:08:43,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4786 to 4782. [2024-11-28 02:08:43,902 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 02:08:43,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4782 states to 4782 states and 6930 transitions. [2024-11-28 02:08:43,912 INFO L78 Accepts]: Start accepts. Automaton has 4782 states and 6930 transitions. Word has length 101 [2024-11-28 02:08:43,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:43,912 INFO L471 AbstractCegarLoop]: Abstraction has 4782 states and 6930 transitions. [2024-11-28 02:08:43,912 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 02:08:43,913 INFO L276 IsEmpty]: Start isEmpty. Operand 4782 states and 6930 transitions. [2024-11-28 02:08:43,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-28 02:08:43,914 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:43,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, 1, 1, 1, 1, 1, 1] [2024-11-28 02:08:43,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-28 02:08:43,914 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 02:08:43,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:43,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1199960833, now seen corresponding path program 1 times [2024-11-28 02:08:43,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:43,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575451466] [2024-11-28 02:08:43,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:43,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:44,957 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 02:08:44,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:44,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575451466] [2024-11-28 02:08:44,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575451466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:08:44,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:08:44,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 02:08:44,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452455224] [2024-11-28 02:08:44,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:08:44,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 02:08:44,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:44,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 02:08:44,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-28 02:08:44,960 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 02:08:51,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:51,360 INFO L93 Difference]: Finished difference Result 4785 states and 6941 transitions. [2024-11-28 02:08:51,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 02:08:51,361 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 02:08:51,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:51,365 INFO L225 Difference]: With dead ends: 4785 [2024-11-28 02:08:51,365 INFO L226 Difference]: Without dead ends: 4785 [2024-11-28 02:08:51,365 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 02:08:51,366 INFO L435 NwaCegarLoop]: 1899 mSDtfsCounter, 2682 mSDsluCounter, 11278 mSDsCounter, 0 mSdLazyCounter, 8769 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2700 SdHoareTripleChecker+Valid, 13177 SdHoareTripleChecker+Invalid, 8791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 8769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:51,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2700 Valid, 13177 Invalid, 8791 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 8769 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-11-28 02:08:51,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4785 states. [2024-11-28 02:08:51,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4785 to 4782. [2024-11-28 02:08:51,413 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 02:08:51,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4782 states to 4782 states and 6928 transitions. [2024-11-28 02:08:51,423 INFO L78 Accepts]: Start accepts. Automaton has 4782 states and 6928 transitions. Word has length 101 [2024-11-28 02:08:51,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:51,423 INFO L471 AbstractCegarLoop]: Abstraction has 4782 states and 6928 transitions. [2024-11-28 02:08:51,423 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 02:08:51,423 INFO L276 IsEmpty]: Start isEmpty. Operand 4782 states and 6928 transitions. [2024-11-28 02:08:51,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-28 02:08:51,425 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:51,425 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 02:08:51,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-28 02:08:51,425 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 02:08:51,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:51,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1445835335, now seen corresponding path program 1 times [2024-11-28 02:08:51,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:51,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532975480] [2024-11-28 02:08:51,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:51,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:52,192 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 02:08:52,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:52,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532975480] [2024-11-28 02:08:52,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532975480] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:08:52,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415545185] [2024-11-28 02:08:52,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:52,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:08:52,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:08:52,195 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:08:52,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 02:08:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:52,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-28 02:08:52,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:08:52,644 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 02:08:52,812 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:08:52,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 02:08:52,861 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 02:08:52,974 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 02:08:53,146 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:08:53,146 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 02:08:53,278 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:08:53,278 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 02:08:53,362 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:08:53,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:08:53,387 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 02:08:53,443 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 02:08:53,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:08:53,458 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1553 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_1553) |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 02:08:53,517 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1553 (Array Int Int)) (v_ArrVal_1552 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1552))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1553)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:08:53,525 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1553 (Array Int Int)) (v_ArrVal_1552 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1552))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1553)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:08:53,568 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1553 (Array Int Int)) (v_ArrVal_1552 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1556))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1552)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1553)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:08:53,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415545185] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:08:53,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:08:53,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2024-11-28 02:08:53,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908334586] [2024-11-28 02:08:53,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:08:53,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 02:08:53,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:53,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 02:08:53,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=508, Unknown=9, NotChecked=196, Total=812 [2024-11-28 02:08:53,573 INFO L87 Difference]: Start difference. First operand 4782 states and 6928 transitions. Second operand has 24 states, 21 states have (on average 7.809523809523809) internal successors, (164), 23 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 02:09:00,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:00,169 INFO L93 Difference]: Finished difference Result 4784 states and 6939 transitions. [2024-11-28 02:09:00,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:09:00,169 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.809523809523809) internal successors, (164), 23 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 02:09:00,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:00,172 INFO L225 Difference]: With dead ends: 4784 [2024-11-28 02:09:00,173 INFO L226 Difference]: Without dead ends: 4784 [2024-11-28 02:09:00,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=121, Invalid=642, Unknown=9, NotChecked=220, Total=992 [2024-11-28 02:09:00,173 INFO L435 NwaCegarLoop]: 1891 mSDtfsCounter, 2638 mSDsluCounter, 18688 mSDsCounter, 0 mSdLazyCounter, 9658 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2656 SdHoareTripleChecker+Valid, 20579 SdHoareTripleChecker+Invalid, 9683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 9658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:00,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2656 Valid, 20579 Invalid, 9683 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 9658 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-28 02:09:00,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4784 states. [2024-11-28 02:09:00,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4784 to 4781. [2024-11-28 02:09:00,219 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 02:09:00,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4781 states to 4781 states and 6926 transitions. [2024-11-28 02:09:00,228 INFO L78 Accepts]: Start accepts. Automaton has 4781 states and 6926 transitions. Word has length 102 [2024-11-28 02:09:00,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:00,229 INFO L471 AbstractCegarLoop]: Abstraction has 4781 states and 6926 transitions. [2024-11-28 02:09:00,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.809523809523809) internal successors, (164), 23 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 02:09:00,229 INFO L276 IsEmpty]: Start isEmpty. Operand 4781 states and 6926 transitions. [2024-11-28 02:09:00,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-28 02:09:00,230 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:00,230 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 02:09:00,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 02:09:00,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-28 02:09:00,431 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 02:09:00,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:00,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1445835336, now seen corresponding path program 1 times [2024-11-28 02:09:00,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:00,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928791826] [2024-11-28 02:09:00,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:00,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:01,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:01,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:01,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928791826] [2024-11-28 02:09:01,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928791826] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:09:01,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365176177] [2024-11-28 02:09:01,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:01,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:09:01,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:09:01,574 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:09:01,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 02:09:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:01,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-28 02:09:01,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:09:01,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:09:02,052 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:09:02,052 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 02:09:02,062 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 02:09:02,091 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 02:09:02,097 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 02:09:02,189 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 02:09:02,193 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 02:09:02,312 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:02,312 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 02:09:02,319 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 02:09:02,401 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:02,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:09:02,408 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 02:09:02,491 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:02,492 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 02:09:02,499 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 02:09:02,521 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 02:09:02,528 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 02:09:02,553 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 02:09:02,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:09:02,633 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1722 (Array Int Int)) (v_ArrVal_1721 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_1721) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_1722) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1721 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_1721) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))))) is different from false [2024-11-28 02:09:02,646 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1722 (Array Int Int)) (v_ArrVal_1721 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1721) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1722) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1721 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1721) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-28 02:09:02,671 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1722 (Array Int Int)) (v_ArrVal_1721 (Array Int Int)) (v_ArrVal_1720 (Array Int Int)) (v_ArrVal_1719 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1720))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1719) .cse0 v_ArrVal_1721) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1722) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1721 (Array Int Int)) (v_ArrVal_1720 (Array Int Int)) (v_ArrVal_1719 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1719) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1720) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1721) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2024-11-28 02:09:02,694 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1721 (Array Int Int)) (v_ArrVal_1720 (Array Int Int)) (v_ArrVal_1719 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1719) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1720) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1721) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1722 (Array Int Int)) (v_ArrVal_1721 (Array Int Int)) (v_ArrVal_1720 (Array Int Int)) (v_ArrVal_1719 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1720))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1719) .cse2 v_ArrVal_1721) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1722) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-28 02:09:02,772 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1721 (Array Int Int)) (v_ArrVal_1720 (Array Int Int)) (v_ArrVal_1719 (Array Int Int)) (v_ArrVal_1728 (Array Int Int)) (v_ArrVal_1727 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1727))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1728) .cse0 v_ArrVal_1719) (select (select (store .cse1 .cse0 v_ArrVal_1720) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1721))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1722 (Array Int Int)) (v_ArrVal_1721 (Array Int Int)) (v_ArrVal_1720 (Array Int Int)) (v_ArrVal_1719 (Array Int Int)) (v_ArrVal_1728 (Array Int Int)) (v_ArrVal_1727 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1727))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1720))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1728) .cse3 v_ArrVal_1719) .cse4 v_ArrVal_1721) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1722) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-28 02:09:02,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365176177] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:09:02,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:09:02,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2024-11-28 02:09:02,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090295476] [2024-11-28 02:09:02,776 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:09:02,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 02:09:02,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:02,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 02:09:02,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=480, Unknown=5, NotChecked=240, Total=812 [2024-11-28 02:09:02,778 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 02:09:14,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:14,223 INFO L93 Difference]: Finished difference Result 4783 states and 6937 transitions. [2024-11-28 02:09:14,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:09:14,223 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 02:09:14,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:14,228 INFO L225 Difference]: With dead ends: 4783 [2024-11-28 02:09:14,228 INFO L226 Difference]: Without dead ends: 4783 [2024-11-28 02:09:14,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=745, Unknown=5, NotChecked=300, Total=1190 [2024-11-28 02:09:14,229 INFO L435 NwaCegarLoop]: 1897 mSDtfsCounter, 2646 mSDsluCounter, 20695 mSDsCounter, 0 mSdLazyCounter, 15833 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2664 SdHoareTripleChecker+Valid, 22592 SdHoareTripleChecker+Invalid, 15861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 15833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:14,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2664 Valid, 22592 Invalid, 15861 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 15833 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2024-11-28 02:09:14,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4783 states. [2024-11-28 02:09:14,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4783 to 4759. [2024-11-28 02:09:14,287 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 02:09:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4759 states to 4759 states and 6901 transitions. [2024-11-28 02:09:14,293 INFO L78 Accepts]: Start accepts. Automaton has 4759 states and 6901 transitions. Word has length 102 [2024-11-28 02:09:14,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:14,293 INFO L471 AbstractCegarLoop]: Abstraction has 4759 states and 6901 transitions. [2024-11-28 02:09:14,293 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 02:09:14,293 INFO L276 IsEmpty]: Start isEmpty. Operand 4759 states and 6901 transitions. [2024-11-28 02:09:14,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-28 02:09:14,294 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:14,294 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 02:09:14,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-28 02:09:14,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-28 02:09:14,495 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 02:09:14,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:14,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1021026709, now seen corresponding path program 1 times [2024-11-28 02:09:14,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:14,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891360596] [2024-11-28 02:09:14,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:14,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:15,348 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 02:09:15,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:15,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891360596] [2024-11-28 02:09:15,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891360596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:15,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:15,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 02:09:15,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906688495] [2024-11-28 02:09:15,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:15,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 02:09:15,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:15,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 02:09:15,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-28 02:09:15,351 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 02:09:21,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:21,782 INFO L93 Difference]: Finished difference Result 4790 states and 6945 transitions. [2024-11-28 02:09:21,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:09:21,783 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 02:09:21,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:21,791 INFO L225 Difference]: With dead ends: 4790 [2024-11-28 02:09:21,791 INFO L226 Difference]: Without dead ends: 4790 [2024-11-28 02:09:21,791 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 02:09:21,792 INFO L435 NwaCegarLoop]: 1891 mSDtfsCounter, 2666 mSDsluCounter, 18678 mSDsCounter, 0 mSdLazyCounter, 9621 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2684 SdHoareTripleChecker+Valid, 20569 SdHoareTripleChecker+Invalid, 9644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 9621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:21,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2684 Valid, 20569 Invalid, 9644 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 9621 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-11-28 02:09:21,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4790 states. [2024-11-28 02:09:21,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4790 to 4786. [2024-11-28 02:09:21,852 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 02:09:21,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4786 states to 4786 states and 6932 transitions. [2024-11-28 02:09:21,861 INFO L78 Accepts]: Start accepts. Automaton has 4786 states and 6932 transitions. Word has length 104 [2024-11-28 02:09:21,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:21,861 INFO L471 AbstractCegarLoop]: Abstraction has 4786 states and 6932 transitions. [2024-11-28 02:09:21,862 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 02:09:21,862 INFO L276 IsEmpty]: Start isEmpty. Operand 4786 states and 6932 transitions. [2024-11-28 02:09:21,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-28 02:09:21,863 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:21,863 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 02:09:21,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-28 02:09:21,863 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 02:09:21,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:21,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1021026710, now seen corresponding path program 1 times [2024-11-28 02:09:21,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:21,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535883687] [2024-11-28 02:09:21,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:21,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:22,923 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 02:09:22,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:22,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535883687] [2024-11-28 02:09:22,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535883687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:22,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:22,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 02:09:22,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050852732] [2024-11-28 02:09:22,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:22,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 02:09:22,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:22,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 02:09:22,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-28 02:09:22,925 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 02:09:29,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:29,886 INFO L93 Difference]: Finished difference Result 4789 states and 6943 transitions. [2024-11-28 02:09:29,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 02:09:29,886 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 02:09:29,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:29,891 INFO L225 Difference]: With dead ends: 4789 [2024-11-28 02:09:29,891 INFO L226 Difference]: Without dead ends: 4789 [2024-11-28 02:09:29,891 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 02:09:29,892 INFO L435 NwaCegarLoop]: 1898 mSDtfsCounter, 2682 mSDsluCounter, 13122 mSDsCounter, 0 mSdLazyCounter, 9600 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2700 SdHoareTripleChecker+Valid, 15020 SdHoareTripleChecker+Invalid, 9622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 9600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:29,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2700 Valid, 15020 Invalid, 9622 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 9600 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-11-28 02:09:29,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4789 states. [2024-11-28 02:09:29,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4789 to 4786. [2024-11-28 02:09:29,931 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 02:09:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4786 states to 4786 states and 6930 transitions. [2024-11-28 02:09:29,937 INFO L78 Accepts]: Start accepts. Automaton has 4786 states and 6930 transitions. Word has length 104 [2024-11-28 02:09:29,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:29,938 INFO L471 AbstractCegarLoop]: Abstraction has 4786 states and 6930 transitions. [2024-11-28 02:09:29,938 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 02:09:29,938 INFO L276 IsEmpty]: Start isEmpty. Operand 4786 states and 6930 transitions. [2024-11-28 02:09:29,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-28 02:09:29,938 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:29,939 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 02:09:29,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-28 02:09:29,939 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 02:09:29,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:29,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1345861394, now seen corresponding path program 1 times [2024-11-28 02:09:29,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:29,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418985361] [2024-11-28 02:09:29,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:29,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:30,917 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 02:09:30,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:30,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418985361] [2024-11-28 02:09:30,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418985361] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:09:30,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546391644] [2024-11-28 02:09:30,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:30,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:09:30,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:09:30,920 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:09:30,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 02:09:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:31,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-28 02:09:31,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:09:31,398 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 02:09:31,553 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:09:31,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 02:09:31,593 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 02:09:31,719 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 02:09:31,923 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:31,923 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 02:09:32,062 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:32,063 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 02:09:32,152 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:32,153 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 02:09:32,231 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:32,231 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 02:09:32,250 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 02:09:32,293 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 02:09:32,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:09:32,305 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2059 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_2059) |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 02:09:32,363 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2059 (Array Int Int)) (v_ArrVal_2058 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2058))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2059)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:09:32,370 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2059 (Array Int Int)) (v_ArrVal_2058 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2058))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2059)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:09:32,382 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2059 (Array Int Int)) (v_ArrVal_2058 (Array Int Int)) (v_ArrVal_2057 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2057))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2058)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2059)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:09:32,493 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2059 (Array Int Int)) (v_ArrVal_2058 (Array Int Int)) (v_ArrVal_2057 (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 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2062))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2057)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2058)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2059)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:09:32,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546391644] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:09:32,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:09:32,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2024-11-28 02:09:32,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696377605] [2024-11-28 02:09:32,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:09:32,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 02:09:32,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:32,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 02:09:32,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=633, Unknown=17, NotChecked=280, Total=1056 [2024-11-28 02:09:32,497 INFO L87 Difference]: Start difference. First operand 4786 states and 6930 transitions. Second operand has 26 states, 23 states have (on average 7.391304347826087) internal successors, (170), 25 states have internal predecessors, (170), 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 02:09:41,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:41,839 INFO L93 Difference]: Finished difference Result 4788 states and 6941 transitions. [2024-11-28 02:09:41,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 02:09:41,840 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.391304347826087) internal successors, (170), 25 states have internal predecessors, (170), 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 02:09:41,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:41,844 INFO L225 Difference]: With dead ends: 4788 [2024-11-28 02:09:41,844 INFO L226 Difference]: Without dead ends: 4788 [2024-11-28 02:09:41,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=784, Unknown=17, NotChecked=310, Total=1260 [2024-11-28 02:09:41,845 INFO L435 NwaCegarLoop]: 1890 mSDtfsCounter, 2635 mSDsluCounter, 24276 mSDsCounter, 0 mSdLazyCounter, 12253 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2653 SdHoareTripleChecker+Valid, 26166 SdHoareTripleChecker+Invalid, 12276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 12253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:41,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2653 Valid, 26166 Invalid, 12276 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 12253 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2024-11-28 02:09:41,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4788 states. [2024-11-28 02:09:41,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4788 to 4785. [2024-11-28 02:09:41,896 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 02:09:41,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4785 states to 4785 states and 6928 transitions. [2024-11-28 02:09:41,906 INFO L78 Accepts]: Start accepts. Automaton has 4785 states and 6928 transitions. Word has length 105 [2024-11-28 02:09:41,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:41,906 INFO L471 AbstractCegarLoop]: Abstraction has 4785 states and 6928 transitions. [2024-11-28 02:09:41,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.391304347826087) internal successors, (170), 25 states have internal predecessors, (170), 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 02:09:41,907 INFO L276 IsEmpty]: Start isEmpty. Operand 4785 states and 6928 transitions. [2024-11-28 02:09:41,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-28 02:09:41,907 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:41,908 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 02:09:41,922 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 02:09:42,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:09:42,112 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 02:09:42,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:42,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1345861393, now seen corresponding path program 1 times [2024-11-28 02:09:42,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:42,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110321827] [2024-11-28 02:09:42,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:42,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:43,328 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 02:09:43,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:43,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110321827] [2024-11-28 02:09:43,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110321827] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:09:43,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304320082] [2024-11-28 02:09:43,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:43,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:09:43,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:09:43,331 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:09:43,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 02:09:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:43,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-28 02:09:43,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:09:43,800 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 02:09:43,973 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:09:43,974 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 02:09:43,982 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 02:09:43,995 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 02:09:43,999 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 02:09:44,100 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 02:09:44,106 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 02:09:44,253 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:44,253 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 02:09:44,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 02:09:44,353 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:44,354 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 02:09:44,360 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 02:09:44,443 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:44,443 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 02:09:44,452 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 02:09:44,539 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:44,540 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 02:09:44,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 02:09:44,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:09:44,575 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 02:09:44,581 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 02:09:44,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:09:44,671 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2241 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_2241) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2242 (Array Int Int)) (v_ArrVal_2241 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_2241) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_2242) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 02:09:44,755 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2239 (Array Int Int)) (v_ArrVal_2242 (Array Int Int)) (v_ArrVal_2241 (Array Int Int)) (v_ArrVal_2240 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2240))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2239) .cse0 v_ArrVal_2241) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2242) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2239 (Array Int Int)) (v_ArrVal_2241 (Array Int Int)) (v_ArrVal_2240 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2239) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2240) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2241) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-11-28 02:09:44,897 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2239 (Array Int Int)) (v_ArrVal_2238 (Array Int Int)) (v_ArrVal_2237 (Array Int Int)) (v_ArrVal_2242 (Array Int Int)) (v_ArrVal_2241 (Array Int Int)) (v_ArrVal_2240 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2238))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2240))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2237) .cse0 v_ArrVal_2239) .cse1 v_ArrVal_2241) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2242) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2239 (Array Int Int)) (v_ArrVal_2238 (Array Int Int)) (v_ArrVal_2237 (Array Int Int)) (v_ArrVal_2241 (Array Int Int)) (v_ArrVal_2240 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2238))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2237) .cse5 v_ArrVal_2239) (select (select (store .cse6 .cse5 v_ArrVal_2240) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2241))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2024-11-28 02:09:45,998 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2239 (Array Int Int)) (v_ArrVal_2238 (Array Int Int)) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2237 (Array Int Int)) (v_ArrVal_2247 (Array Int Int)) (v_ArrVal_2241 (Array Int Int)) (v_ArrVal_2240 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2248))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2238))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2247) .cse0 v_ArrVal_2237) .cse1 v_ArrVal_2239) (select (select (store .cse2 .cse1 v_ArrVal_2240) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2241))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_2239 (Array Int Int)) (v_ArrVal_2238 (Array Int Int)) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2237 (Array Int Int)) (v_ArrVal_2247 (Array Int Int)) (v_ArrVal_2242 (Array Int Int)) (v_ArrVal_2241 (Array Int Int)) (v_ArrVal_2240 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2248))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2238))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2240))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2247) .cse5 v_ArrVal_2237) .cse6 v_ArrVal_2239) .cse7 v_ArrVal_2241) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2242) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-28 02:09:46,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304320082] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:09:46,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:09:46,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 20 [2024-11-28 02:09:46,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454511914] [2024-11-28 02:09:46,005 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:09:46,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 02:09:46,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:46,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 02:09:46,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=521, Unknown=26, NotChecked=204, Total=870 [2024-11-28 02:09:46,006 INFO L87 Difference]: Start difference. First operand 4785 states and 6928 transitions. Second operand has 21 states, 18 states have (on average 8.944444444444445) internal successors, (161), 21 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:10:04,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:10:04,058 INFO L93 Difference]: Finished difference Result 4787 states and 6939 transitions. [2024-11-28 02:10:04,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:10:04,058 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.944444444444445) internal successors, (161), 21 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 105 [2024-11-28 02:10:04,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:10:04,063 INFO L225 Difference]: With dead ends: 4787 [2024-11-28 02:10:04,063 INFO L226 Difference]: Without dead ends: 4787 [2024-11-28 02:10:04,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=192, Invalid=854, Unknown=26, NotChecked=260, Total=1332 [2024-11-28 02:10:04,064 INFO L435 NwaCegarLoop]: 1896 mSDtfsCounter, 2659 mSDsluCounter, 15791 mSDsCounter, 0 mSdLazyCounter, 12472 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2677 SdHoareTripleChecker+Valid, 17687 SdHoareTripleChecker+Invalid, 12514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 12472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:10:04,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2677 Valid, 17687 Invalid, 12514 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [42 Valid, 12472 Invalid, 0 Unknown, 0 Unchecked, 17.4s Time] [2024-11-28 02:10:04,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4787 states. [2024-11-28 02:10:04,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4787 to 4757. [2024-11-28 02:10:04,112 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 02:10:04,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4757 states to 4757 states and 6897 transitions. [2024-11-28 02:10:04,118 INFO L78 Accepts]: Start accepts. Automaton has 4757 states and 6897 transitions. Word has length 105 [2024-11-28 02:10:04,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:10:04,119 INFO L471 AbstractCegarLoop]: Abstraction has 4757 states and 6897 transitions. [2024-11-28 02:10:04,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.944444444444445) internal successors, (161), 21 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:10:04,119 INFO L276 IsEmpty]: Start isEmpty. Operand 4757 states and 6897 transitions. [2024-11-28 02:10:04,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-28 02:10:04,120 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:10:04,120 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 02:10:04,129 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-28 02:10:04,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-11-28 02:10:04,321 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 02:10:04,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:10:04,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1033779607, now seen corresponding path program 1 times [2024-11-28 02:10:04,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:10:04,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899073365] [2024-11-28 02:10:04,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:04,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:10:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:05,611 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 02:10:05,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:10:05,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899073365] [2024-11-28 02:10:05,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899073365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:10:05,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:10:05,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 02:10:05,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251558063] [2024-11-28 02:10:05,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:10:05,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 02:10:05,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:10:05,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 02:10:05,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-28 02:10:05,614 INFO L87 Difference]: Start difference. First operand 4757 states and 6897 transitions. Second operand has 14 states, 13 states have (on average 8.153846153846153) internal successors, (106), 14 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 02:10:14,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:10:14,561 INFO L93 Difference]: Finished difference Result 4796 states and 6949 transitions. [2024-11-28 02:10:14,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 02:10:14,562 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 8.153846153846153) internal successors, (106), 14 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 02:10:14,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:10:14,567 INFO L225 Difference]: With dead ends: 4796 [2024-11-28 02:10:14,567 INFO L226 Difference]: Without dead ends: 4796 [2024-11-28 02:10:14,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2024-11-28 02:10:14,568 INFO L435 NwaCegarLoop]: 1896 mSDtfsCounter, 2667 mSDsluCounter, 13054 mSDsCounter, 0 mSdLazyCounter, 7013 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2685 SdHoareTripleChecker+Valid, 14950 SdHoareTripleChecker+Invalid, 7037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 7013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:10:14,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2685 Valid, 14950 Invalid, 7037 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 7013 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2024-11-28 02:10:14,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4796 states. [2024-11-28 02:10:14,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4796 to 4792. [2024-11-28 02:10:14,624 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 02:10:14,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4792 states to 4792 states and 6936 transitions. [2024-11-28 02:10:14,634 INFO L78 Accepts]: Start accepts. Automaton has 4792 states and 6936 transitions. Word has length 108 [2024-11-28 02:10:14,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:10:14,634 INFO L471 AbstractCegarLoop]: Abstraction has 4792 states and 6936 transitions. [2024-11-28 02:10:14,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 8.153846153846153) internal successors, (106), 14 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 02:10:14,635 INFO L276 IsEmpty]: Start isEmpty. Operand 4792 states and 6936 transitions. [2024-11-28 02:10:14,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-28 02:10:14,635 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:10:14,636 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 02:10:14,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-28 02:10:14,636 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 02:10:14,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:10:14,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1033779608, now seen corresponding path program 1 times [2024-11-28 02:10:14,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:10:14,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843244278] [2024-11-28 02:10:14,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:14,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:10:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:16,490 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 02:10:16,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:10:16,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843244278] [2024-11-28 02:10:16,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843244278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:10:16,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:10:16,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 02:10:16,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796418813] [2024-11-28 02:10:16,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:10:16,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 02:10:16,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:10:16,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 02:10:16,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-28 02:10:16,492 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 02:10:27,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:10:27,754 INFO L93 Difference]: Finished difference Result 4795 states and 6947 transitions. [2024-11-28 02:10:27,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 02:10:27,754 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 02:10:27,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:10:27,760 INFO L225 Difference]: With dead ends: 4795 [2024-11-28 02:10:27,760 INFO L226 Difference]: Without dead ends: 4795 [2024-11-28 02:10:27,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-28 02:10:27,761 INFO L435 NwaCegarLoop]: 1890 mSDtfsCounter, 2670 mSDsluCounter, 12006 mSDsCounter, 0 mSdLazyCounter, 8132 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2688 SdHoareTripleChecker+Valid, 13896 SdHoareTripleChecker+Invalid, 8160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 8132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:10:27,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2688 Valid, 13896 Invalid, 8160 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 8132 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2024-11-28 02:10:27,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4795 states. [2024-11-28 02:10:27,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4795 to 4792. [2024-11-28 02:10:27,818 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 02:10:27,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4792 states to 4792 states and 6934 transitions. [2024-11-28 02:10:27,824 INFO L78 Accepts]: Start accepts. Automaton has 4792 states and 6934 transitions. Word has length 108 [2024-11-28 02:10:27,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:10:27,825 INFO L471 AbstractCegarLoop]: Abstraction has 4792 states and 6934 transitions. [2024-11-28 02:10:27,825 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 02:10:27,825 INFO L276 IsEmpty]: Start isEmpty. Operand 4792 states and 6934 transitions. [2024-11-28 02:10:27,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-28 02:10:27,826 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:10:27,826 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 02:10:27,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-28 02:10:27,826 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 02:10:27,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:10:27,827 INFO L85 PathProgramCache]: Analyzing trace with hash -2063266704, now seen corresponding path program 1 times [2024-11-28 02:10:27,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:10:27,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82138343] [2024-11-28 02:10:27,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:27,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:10:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:28,956 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 02:10:28,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:10:28,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82138343] [2024-11-28 02:10:28,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82138343] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:10:28,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726849217] [2024-11-28 02:10:28,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:28,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:10:28,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:10:28,959 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:10:28,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 02:10:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:29,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-28 02:10:29,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:10:29,464 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 02:10:29,809 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:10:29,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 02:10:29,881 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 02:10:30,048 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 02:10:30,308 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:30,308 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 02:10:30,481 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:30,481 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 02:10:30,617 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:30,618 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 02:10:30,741 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:30,741 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 02:10:30,866 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:30,866 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 02:10:30,920 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 02:10:31,049 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-28 02:10:31,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-11-28 02:10:31,061 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 02:10:31,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:10:32,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726849217] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:10:32,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:10:32,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2024-11-28 02:10:32,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809321135] [2024-11-28 02:10:32,635 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:10:32,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-28 02:10:32,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:10:32,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-28 02:10:32,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1234, Unknown=51, NotChecked=0, Total=1482 [2024-11-28 02:10:32,637 INFO L87 Difference]: Start difference. First operand 4792 states and 6934 transitions. Second operand has 28 states, 25 states have (on average 7.12) internal successors, (178), 27 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 02:10:57,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:10:57,500 INFO L93 Difference]: Finished difference Result 4794 states and 6945 transitions. [2024-11-28 02:10:57,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 02:10:57,500 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 7.12) internal successors, (178), 27 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 02:10:57,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:10:57,505 INFO L225 Difference]: With dead ends: 4794 [2024-11-28 02:10:57,505 INFO L226 Difference]: Without dead ends: 4794 [2024-11-28 02:10:57,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=224, Invalid=1447, Unknown=51, NotChecked=0, Total=1722 [2024-11-28 02:10:57,506 INFO L435 NwaCegarLoop]: 1889 mSDtfsCounter, 2628 mSDsluCounter, 37300 mSDsCounter, 0 mSdLazyCounter, 18217 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2646 SdHoareTripleChecker+Valid, 39189 SdHoareTripleChecker+Invalid, 18243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 18217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:10:57,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2646 Valid, 39189 Invalid, 18243 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [26 Valid, 18217 Invalid, 0 Unknown, 0 Unchecked, 24.1s Time] [2024-11-28 02:10:57,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4794 states. [2024-11-28 02:10:57,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4794 to 4791. [2024-11-28 02:10:57,549 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 02:10:57,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4791 states to 4791 states and 6932 transitions. [2024-11-28 02:10:57,555 INFO L78 Accepts]: Start accepts. Automaton has 4791 states and 6932 transitions. Word has length 109 [2024-11-28 02:10:57,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:10:57,555 INFO L471 AbstractCegarLoop]: Abstraction has 4791 states and 6932 transitions. [2024-11-28 02:10:57,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 7.12) internal successors, (178), 27 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 02:10:57,556 INFO L276 IsEmpty]: Start isEmpty. Operand 4791 states and 6932 transitions. [2024-11-28 02:10:57,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-28 02:10:57,556 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:10:57,557 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 02:10:57,569 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 02:10:57,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-28 02:10:57,757 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 02:10:57,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:10:57,758 INFO L85 PathProgramCache]: Analyzing trace with hash -2063266703, now seen corresponding path program 1 times [2024-11-28 02:10:57,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:10:57,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123288467] [2024-11-28 02:10:57,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:57,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:10:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:59,399 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 02:10:59,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:10:59,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123288467] [2024-11-28 02:10:59,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123288467] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:10:59,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357098360] [2024-11-28 02:10:59,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:59,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:10:59,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:10:59,402 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:10:59,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 02:10:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:59,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-28 02:10:59,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:10:59,902 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 02:11:00,129 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 02:11:00,171 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:11:00,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 02:11:00,257 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 02:11:00,272 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 02:11:00,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-28 02:11:00,517 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 02:11:00,875 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:11:00,875 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 02:11:00,885 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 02:11:01,109 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:11:01,110 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 02:11:01,120 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 02:11:01,288 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:11:01,289 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 02:11:01,297 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 02:11:01,486 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:11:01,486 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 02:11:01,494 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 02:11:01,658 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:11:01,659 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 02:11:01,669 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 02:11:01,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-28 02:11:01,717 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 02:11:01,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:11:01,815 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 02:11:01,845 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-28 02:11:01,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-28 02:11:01,852 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 02:11:01,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:11:02,861 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc62#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_7|) 0))) (forall ((v_ArrVal_2814 (Array Int Int)) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2812 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2812) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2814) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)))) (forall ((v_ArrVal_2814 (Array Int Int)) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2812 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_7| Int) (v_ArrVal_2815 (Array Int Int))) (or (forall ((v_ArrVal_2816 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2813))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2812) .cse2 v_ArrVal_2814) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_7| v_ArrVal_2816) (select (select (store .cse3 .cse2 v_ArrVal_2815) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_7|) 0))))))) is different from false [2024-11-28 02:11:15,146 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_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_7|) 0))) (forall ((v_ArrVal_2814 (Array Int Int)) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2812 (Array Int Int)) (v_ArrVal_2822 (Array Int Int)) (v_ArrVal_2811 (Array Int Int)) (v_ArrVal_2821 (Array Int Int)) (v_ArrVal_2810 (Array Int Int)) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2808 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2821))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2808))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2811))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2822) .cse0 v_ArrVal_2809) .cse1 v_ArrVal_2810) .cse2 v_ArrVal_2812) (select (select (store .cse3 .cse2 v_ArrVal_2813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2814))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1)))) (forall ((v_ArrVal_2814 (Array Int Int)) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2812 (Array Int Int)) (v_ArrVal_2822 (Array Int Int)) (v_ArrVal_2811 (Array Int Int)) (v_ArrVal_2821 (Array Int Int)) (v_ArrVal_2810 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_7| Int) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2815 (Array Int Int))) (or (forall ((v_ArrVal_2816 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2821))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2808))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2811))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2813))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2822) .cse7 v_ArrVal_2809) .cse8 v_ArrVal_2810) .cse9 v_ArrVal_2812) .cse10 v_ArrVal_2814) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_7| v_ArrVal_2816) (select (select (store .cse11 .cse10 v_ArrVal_2815) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_7|) 0)))))) is different from false [2024-11-28 02:11:15,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357098360] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:11:15,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:11:15,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 28 [2024-11-28 02:11:15,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938958422] [2024-11-28 02:11:15,153 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:11:15,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-28 02:11:15,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:11:15,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-28 02:11:15,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1262, Unknown=36, NotChecked=150, Total=1640 [2024-11-28 02:11:15,155 INFO L87 Difference]: Start difference. First operand 4791 states and 6932 transitions. Second operand has 29 states, 26 states have (on average 6.8076923076923075) internal successors, (177), 28 states have internal predecessors, (177), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:12:15,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:12:15,486 INFO L93 Difference]: Finished difference Result 4793 states and 6943 transitions. [2024-11-28 02:12:15,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 02:12:15,487 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 6.8076923076923075) internal successors, (177), 28 states have internal predecessors, (177), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 109 [2024-11-28 02:12:15,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:12:15,493 INFO L225 Difference]: With dead ends: 4793 [2024-11-28 02:12:15,493 INFO L226 Difference]: Without dead ends: 4793 [2024-11-28 02:12:15,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=220, Invalid=1474, Unknown=36, NotChecked=162, Total=1892 [2024-11-28 02:12:15,494 INFO L435 NwaCegarLoop]: 1888 mSDtfsCounter, 2627 mSDsluCounter, 21311 mSDsCounter, 0 mSdLazyCounter, 15210 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2645 SdHoareTripleChecker+Valid, 23199 SdHoareTripleChecker+Invalid, 15237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 15210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 59.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:12:15,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2645 Valid, 23199 Invalid, 15237 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [27 Valid, 15210 Invalid, 0 Unknown, 0 Unchecked, 59.3s Time] [2024-11-28 02:12:15,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4793 states. [2024-11-28 02:12:15,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4793 to 4755. [2024-11-28 02:12:15,547 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 02:12:15,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4755 states to 4755 states and 6893 transitions. [2024-11-28 02:12:15,557 INFO L78 Accepts]: Start accepts. Automaton has 4755 states and 6893 transitions. Word has length 109 [2024-11-28 02:12:15,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:12:15,558 INFO L471 AbstractCegarLoop]: Abstraction has 4755 states and 6893 transitions. [2024-11-28 02:12:15,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 6.8076923076923075) internal successors, (177), 28 states have internal predecessors, (177), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:12:15,558 INFO L276 IsEmpty]: Start isEmpty. Operand 4755 states and 6893 transitions. [2024-11-28 02:12:15,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-28 02:12:15,559 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:12:15,559 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 02:12:15,577 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 02:12:15,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:12:15,760 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 02:12:15,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:12:15,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1881507379, now seen corresponding path program 1 times [2024-11-28 02:12:15,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:12:15,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995947605] [2024-11-28 02:12:15,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:12:15,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:12:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:12:16,572 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 02:12:16,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:12:16,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995947605] [2024-11-28 02:12:16,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995947605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:12:16,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:12:16,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:12:16,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230816160] [2024-11-28 02:12:16,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:12:16,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:12:16,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:12:16,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:12:16,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:12:16,575 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 02:12:29,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:12:29,183 INFO L93 Difference]: Finished difference Result 4754 states and 6891 transitions. [2024-11-28 02:12:29,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:12:29,184 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 02:12:29,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:12:29,191 INFO L225 Difference]: With dead ends: 4754 [2024-11-28 02:12:29,192 INFO L226 Difference]: Without dead ends: 4754 [2024-11-28 02:12:29,192 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 02:12:29,192 INFO L435 NwaCegarLoop]: 2731 mSDtfsCounter, 2 mSDsluCounter, 10697 mSDsCounter, 0 mSdLazyCounter, 2979 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 13428 SdHoareTripleChecker+Invalid, 2979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:12:29,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 13428 Invalid, 2979 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 2979 Invalid, 0 Unknown, 0 Unchecked, 12.4s Time] [2024-11-28 02:12:29,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4754 states. [2024-11-28 02:12:29,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4754 to 4754. [2024-11-28 02:12:29,264 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 02:12:29,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4754 states to 4754 states and 6891 transitions. [2024-11-28 02:12:29,270 INFO L78 Accepts]: Start accepts. Automaton has 4754 states and 6891 transitions. Word has length 111 [2024-11-28 02:12:29,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:12:29,271 INFO L471 AbstractCegarLoop]: Abstraction has 4754 states and 6891 transitions. [2024-11-28 02:12:29,271 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 02:12:29,271 INFO L276 IsEmpty]: Start isEmpty. Operand 4754 states and 6891 transitions. [2024-11-28 02:12:29,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-28 02:12:29,271 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:12:29,272 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 02:12:29,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-28 02:12:29,272 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 02:12:29,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:12:29,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1881507378, now seen corresponding path program 1 times [2024-11-28 02:12:29,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:12:29,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493154391] [2024-11-28 02:12:29,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:12:29,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:12:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:12:32,576 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 02:12:32,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:12:32,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493154391] [2024-11-28 02:12:32,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493154391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:12:32,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:12:32,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 02:12:32,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242877181] [2024-11-28 02:12:32,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:12:32,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 02:12:32,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:12:32,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 02:12:32,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-28 02:12:32,578 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 02:13:07,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:13:07,891 INFO L93 Difference]: Finished difference Result 4798 states and 6947 transitions. [2024-11-28 02:13:07,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 02:13:07,892 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 02:13:07,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:13:07,900 INFO L225 Difference]: With dead ends: 4798 [2024-11-28 02:13:07,900 INFO L226 Difference]: Without dead ends: 4798 [2024-11-28 02:13:07,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-11-28 02:13:07,901 INFO L435 NwaCegarLoop]: 1890 mSDtfsCounter, 2665 mSDsluCounter, 11279 mSDsCounter, 0 mSdLazyCounter, 8853 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2683 SdHoareTripleChecker+Valid, 13169 SdHoareTripleChecker+Invalid, 8879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 8853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:13:07,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2683 Valid, 13169 Invalid, 8879 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 8853 Invalid, 0 Unknown, 0 Unchecked, 34.0s Time] [2024-11-28 02:13:07,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4798 states. [2024-11-28 02:13:07,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4798 to 4795. [2024-11-28 02:13:07,961 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 02:13:07,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4795 states to 4795 states and 6934 transitions. [2024-11-28 02:13:07,971 INFO L78 Accepts]: Start accepts. Automaton has 4795 states and 6934 transitions. Word has length 111 [2024-11-28 02:13:07,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:13:07,971 INFO L471 AbstractCegarLoop]: Abstraction has 4795 states and 6934 transitions. [2024-11-28 02:13:07,971 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 02:13:07,972 INFO L276 IsEmpty]: Start isEmpty. Operand 4795 states and 6934 transitions. [2024-11-28 02:13:07,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-28 02:13:07,972 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:13:07,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] [2024-11-28 02:13:07,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-28 02:13:07,973 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 02:13:07,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:13:07,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1500705707, now seen corresponding path program 1 times [2024-11-28 02:13:07,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:13:07,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950208337] [2024-11-28 02:13:07,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:13:07,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:13:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:13:11,800 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 02:13:11,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:13:11,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950208337] [2024-11-28 02:13:11,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950208337] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:13:11,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105615726] [2024-11-28 02:13:11,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:13:11,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:13:11,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:13:11,805 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:13:11,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 02:13:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:13:12,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-28 02:13:12,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:13:12,285 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 02:13:12,935 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 02:13:13,075 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:13:13,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 02:13:13,312 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 02:13:13,323 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 02:13:13,861 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 33 treesize of output 15 [2024-11-28 02:13:13,877 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 02:13:14,667 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:13:14,668 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 02:13:14,683 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 02:13:15,238 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:13:15,239 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 02:13:15,251 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 02:13:15,636 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:13:15,636 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 02:13:15,679 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 02:13:16,046 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:13:16,047 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 02:13:16,067 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 02:13:16,448 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:13:16,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 73 treesize of output 66 [2024-11-28 02:13:16,499 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 02:13:16,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:13:16,877 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 20 treesize of output 15 [2024-11-28 02:13:16,959 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-28 02:13:16,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2024-11-28 02:13:17,214 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:13:17,214 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 02:13:17,236 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 02:13:17,410 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 02:13:17,420 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 02:13:17,587 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 02:13:17,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:13:19,038 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_3216 (Array Int Int)) (v_ArrVal_3217 (Array Int Int)) (v_ArrVal_3219 (Array Int Int))) (<= 0 (+ 40 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3217) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3219) |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_ULTIMATE.start_main_#t~malloc62#1.base_9| Int) (v_ArrVal_3216 (Array Int Int)) (v_ArrVal_3217 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_9|) 0)) (forall ((v_ArrVal_3218 Int) (v_ArrVal_3220 (Array Int Int)) (v_ArrVal_3219 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3216))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 44 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3217) .cse1 v_ArrVal_3219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_9| v_ArrVal_3218) (select (select (store .cse2 .cse1 v_ArrVal_3220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))))) is different from false [2024-11-28 02:13:20,730 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |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_3212 (Array Int Int)) (v_ArrVal_3213 (Array Int Int)) (v_ArrVal_3214 (Array Int Int)) (v_ArrVal_3215 (Array Int Int)) (v_ArrVal_3216 (Array Int Int)) (v_ArrVal_3217 (Array Int Int)) (v_ArrVal_3219 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3212))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_3215))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3213) .cse0 v_ArrVal_3214) .cse1 v_ArrVal_3217) (select (select (store .cse2 .cse1 v_ArrVal_3216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3219))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (forall ((v_ArrVal_3212 (Array Int Int)) (v_ArrVal_3213 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_9| Int) (v_ArrVal_3214 (Array Int Int)) (v_ArrVal_3215 (Array Int Int)) (v_ArrVal_3216 (Array Int Int)) (v_ArrVal_3217 (Array Int Int))) (or (forall ((v_ArrVal_3218 Int) (v_ArrVal_3220 (Array Int Int)) (v_ArrVal_3219 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3212))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_3215))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3216))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3213) .cse5 v_ArrVal_3214) .cse6 v_ArrVal_3217) .cse7 v_ArrVal_3219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_9| v_ArrVal_3218) (select (select (store .cse8 .cse7 v_ArrVal_3220) |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 02:13:36,911 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_3210 (Array Int Int)) (v_ArrVal_3211 (Array Int Int)) (v_ArrVal_3212 (Array Int Int)) (v_ArrVal_3213 (Array Int Int)) (v_ArrVal_3214 (Array Int Int)) (v_ArrVal_3215 (Array Int Int)) (v_ArrVal_3216 (Array Int Int)) (v_ArrVal_3217 (Array Int Int)) (v_ArrVal_3219 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3210))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_3212))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3215))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3211) .cse0 v_ArrVal_3213) .cse1 v_ArrVal_3214) .cse2 v_ArrVal_3217) (select (select (store .cse3 .cse2 v_ArrVal_3216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3219))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 40)))) (forall ((v_ArrVal_3210 (Array Int Int)) (v_ArrVal_3211 (Array Int Int)) (v_ArrVal_3212 (Array Int Int)) (v_ArrVal_3213 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_9| Int) (v_ArrVal_3214 (Array Int Int)) (v_ArrVal_3215 (Array Int Int)) (v_ArrVal_3216 (Array Int Int)) (v_ArrVal_3217 (Array Int Int))) (or (forall ((v_ArrVal_3218 Int) (v_ArrVal_3220 (Array Int Int)) (v_ArrVal_3219 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3210))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_3212))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_3215))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_3216))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3211) .cse7 v_ArrVal_3213) .cse8 v_ArrVal_3214) .cse9 v_ArrVal_3217) .cse10 v_ArrVal_3219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_9| v_ArrVal_3218) (select (select (store .cse11 .cse10 v_ArrVal_3220) |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 02:13:36,995 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (or (forall ((v_ArrVal_3210 (Array Int Int)) (v_ArrVal_3211 (Array Int Int)) (v_ArrVal_3212 (Array Int Int)) (v_ArrVal_3213 (Array Int Int)) (v_ArrVal_3214 (Array Int Int)) (v_ArrVal_3215 (Array Int Int)) (v_ArrVal_3216 (Array Int Int)) (v_ArrVal_3217 (Array Int Int)) (v_ArrVal_3219 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3210))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3212))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3215))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3211) .cse1 v_ArrVal_3213) .cse2 v_ArrVal_3214) .cse3 v_ArrVal_3217) (select (select (store .cse4 .cse3 v_ArrVal_3216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3219))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 40))) (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_3210 (Array Int Int)) (v_ArrVal_3211 (Array Int Int)) (v_ArrVal_3212 (Array Int Int)) (v_ArrVal_3213 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_9| Int) (v_ArrVal_3214 (Array Int Int)) (v_ArrVal_3215 (Array Int Int)) (v_ArrVal_3216 (Array Int Int)) (v_ArrVal_3217 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc62#1.base_9|) 0)) (forall ((v_ArrVal_3218 Int) (v_ArrVal_3220 (Array Int Int)) (v_ArrVal_3219 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3210))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_3212))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_3215))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_3216))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3211) .cse8 v_ArrVal_3213) .cse9 v_ArrVal_3214) .cse10 v_ArrVal_3217) .cse11 v_ArrVal_3219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_9| v_ArrVal_3218) (select (select (store .cse12 .cse11 v_ArrVal_3220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))))))))))) is different from false [2024-11-28 02:13:37,366 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_3210 (Array Int Int)) (v_ArrVal_3211 (Array Int Int)) (v_ArrVal_3212 (Array Int Int)) (v_ArrVal_3213 (Array Int Int)) (v_ArrVal_3225 (Array Int Int)) (v_ArrVal_3214 (Array Int Int)) (v_ArrVal_3226 (Array Int Int)) (v_ArrVal_3215 (Array Int Int)) (v_ArrVal_3216 (Array Int Int)) (v_ArrVal_3217 (Array Int Int)) (v_ArrVal_3219 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3226))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_3210))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3212))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3215))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3225) .cse0 v_ArrVal_3211) .cse1 v_ArrVal_3213) .cse2 v_ArrVal_3214) .cse3 v_ArrVal_3217) (select (select (store .cse4 .cse3 v_ArrVal_3216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3219))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))) (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_3210 (Array Int Int)) (v_ArrVal_3211 (Array Int Int)) (v_ArrVal_3212 (Array Int Int)) (v_ArrVal_3213 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc62#1.base_9| Int) (v_ArrVal_3225 (Array Int Int)) (v_ArrVal_3214 (Array Int Int)) (v_ArrVal_3226 (Array Int Int)) (v_ArrVal_3215 (Array Int Int)) (v_ArrVal_3216 (Array Int Int)) (v_ArrVal_3217 (Array Int Int))) (or (forall ((v_ArrVal_3218 Int) (v_ArrVal_3220 (Array Int Int)) (v_ArrVal_3219 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3226))) (let ((.cse9 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse9 v_ArrVal_3210))) (let ((.cse10 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse10 v_ArrVal_3212))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_3215))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_3216))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (<= (+ 44 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3225) .cse9 v_ArrVal_3211) .cse10 v_ArrVal_3213) .cse11 v_ArrVal_3214) .cse12 v_ArrVal_3217) .cse13 v_ArrVal_3219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc62#1.base_9| v_ArrVal_3218) (select (select (store .cse14 .cse13 v_ArrVal_3220) |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 02:13:37,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105615726] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:13:37,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:13:37,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 34 [2024-11-28 02:13:37,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505385018] [2024-11-28 02:13:37,376 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:13:37,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-28 02:13:37,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:13:37,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-28 02:13:37,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1635, Unknown=55, NotChecked=440, Total=2352 [2024-11-28 02:13:37,377 INFO L87 Difference]: Start difference. First operand 4795 states and 6934 transitions. Second operand has 35 states, 32 states have (on average 6.71875) internal successors, (215), 34 states have internal predecessors, (215), 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 02:15:18,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:15:18,323 INFO L93 Difference]: Finished difference Result 4827 states and 6981 transitions. [2024-11-28 02:15:18,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 02:15:18,323 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 6.71875) internal successors, (215), 34 states have internal predecessors, (215), 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 112 [2024-11-28 02:15:18,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:15:18,328 INFO L225 Difference]: With dead ends: 4827 [2024-11-28 02:15:18,328 INFO L226 Difference]: Without dead ends: 4827 [2024-11-28 02:15:18,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=388, Invalid=2545, Unknown=57, NotChecked=550, Total=3540 [2024-11-28 02:15:18,330 INFO L435 NwaCegarLoop]: 1879 mSDtfsCounter, 5370 mSDsluCounter, 27355 mSDsCounter, 0 mSdLazyCounter, 20120 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 94.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5386 SdHoareTripleChecker+Valid, 29234 SdHoareTripleChecker+Invalid, 20187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 20120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 97.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:15:18,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5386 Valid, 29234 Invalid, 20187 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [67 Valid, 20120 Invalid, 0 Unknown, 0 Unchecked, 97.9s Time] [2024-11-28 02:15:18,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4827 states. [2024-11-28 02:15:18,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4827 to 4758. [2024-11-28 02:15:18,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4758 states, 4024 states have (on average 1.6998011928429424) internal successors, (6840), 4729 states have internal predecessors, (6840), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-28 02:15:18,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4758 states to 4758 states and 6894 transitions. [2024-11-28 02:15:18,376 INFO L78 Accepts]: Start accepts. Automaton has 4758 states and 6894 transitions. Word has length 112 [2024-11-28 02:15:18,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:15:18,377 INFO L471 AbstractCegarLoop]: Abstraction has 4758 states and 6894 transitions. [2024-11-28 02:15:18,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 6.71875) internal successors, (215), 34 states have internal predecessors, (215), 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 02:15:18,377 INFO L276 IsEmpty]: Start isEmpty. Operand 4758 states and 6894 transitions. [2024-11-28 02:15:18,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-28 02:15:18,377 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:15:18,378 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 02:15:18,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 02:15:18,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-28 02:15:18,578 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 02:15:18,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:15:18,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1632559358, now seen corresponding path program 1 times [2024-11-28 02:15:18,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:15:18,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152389440] [2024-11-28 02:15:18,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:15:18,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:15:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:15:20,621 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 02:15:20,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:15:20,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152389440] [2024-11-28 02:15:20,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152389440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:15:20,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:15:20,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-28 02:15:20,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349260545] [2024-11-28 02:15:20,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:15:20,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 02:15:20,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:15:20,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 02:15:20,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-11-28 02:15:20,624 INFO L87 Difference]: Start difference. First operand 4758 states and 6894 transitions. Second operand has 17 states, 16 states have (on average 7.0) internal successors, (112), 17 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 02:16:04,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:16:04,436 INFO L93 Difference]: Finished difference Result 4846 states and 7009 transitions. [2024-11-28 02:16:04,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:16:04,437 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 7.0) internal successors, (112), 17 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 02:16:04,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:16:04,443 INFO L225 Difference]: With dead ends: 4846 [2024-11-28 02:16:04,443 INFO L226 Difference]: Without dead ends: 4846 [2024-11-28 02:16:04,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2024-11-28 02:16:04,444 INFO L435 NwaCegarLoop]: 1901 mSDtfsCounter, 2761 mSDsluCounter, 18781 mSDsCounter, 0 mSdLazyCounter, 9662 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2779 SdHoareTripleChecker+Valid, 20682 SdHoareTripleChecker+Invalid, 9700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 9662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:16:04,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2779 Valid, 20682 Invalid, 9700 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [38 Valid, 9662 Invalid, 0 Unknown, 0 Unchecked, 42.6s Time] [2024-11-28 02:16:04,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4846 states. [2024-11-28 02:16:04,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4846 to 4805. [2024-11-28 02:16:04,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4805 states, 4070 states have (on average 1.6926289926289926) internal successors, (6889), 4774 states have internal predecessors, (6889), 27 states have call successors, (27), 5 states have call predecessors, (27), 6 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-28 02:16:04,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4805 states to 4805 states and 6945 transitions. [2024-11-28 02:16:04,498 INFO L78 Accepts]: Start accepts. Automaton has 4805 states and 6945 transitions. Word has length 114 [2024-11-28 02:16:04,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:16:04,498 INFO L471 AbstractCegarLoop]: Abstraction has 4805 states and 6945 transitions. [2024-11-28 02:16:04,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 7.0) internal successors, (112), 17 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 02:16:04,498 INFO L276 IsEmpty]: Start isEmpty. Operand 4805 states and 6945 transitions. [2024-11-28 02:16:04,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-28 02:16:04,499 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:16:04,499 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 02:16:04,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-28 02:16:04,500 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 02:16:04,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:16:04,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1632559359, now seen corresponding path program 1 times [2024-11-28 02:16:04,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:16:04,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358992191] [2024-11-28 02:16:04,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:16:04,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:16:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:16:07,227 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 02:16:07,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:16:07,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358992191] [2024-11-28 02:16:07,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358992191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:16:07,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:16:07,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 02:16:07,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763105047] [2024-11-28 02:16:07,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:16:07,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 02:16:07,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:16:07,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 02:16:07,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-28 02:16:07,229 INFO L87 Difference]: Start difference. First operand 4805 states and 6945 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 02:17:02,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:17:02,253 INFO L93 Difference]: Finished difference Result 4845 states and 7007 transitions. [2024-11-28 02:17:02,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:17:02,253 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 02:17:02,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:17:02,258 INFO L225 Difference]: With dead ends: 4845 [2024-11-28 02:17:02,258 INFO L226 Difference]: Without dead ends: 4845 [2024-11-28 02:17:02,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2024-11-28 02:17:02,259 INFO L435 NwaCegarLoop]: 1889 mSDtfsCounter, 2730 mSDsluCounter, 19836 mSDsCounter, 0 mSdLazyCounter, 11177 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2748 SdHoareTripleChecker+Valid, 21725 SdHoareTripleChecker+Invalid, 11205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 11177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:17:02,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2748 Valid, 21725 Invalid, 11205 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [28 Valid, 11177 Invalid, 0 Unknown, 0 Unchecked, 53.7s Time] [2024-11-28 02:17:02,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4845 states. [2024-11-28 02:17:02,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4845 to 4805. [2024-11-28 02:17:02,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4805 states, 4070 states have (on average 1.692137592137592) internal successors, (6887), 4774 states have internal predecessors, (6887), 27 states have call successors, (27), 5 states have call predecessors, (27), 6 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-28 02:17:02,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4805 states to 4805 states and 6943 transitions. [2024-11-28 02:17:02,311 INFO L78 Accepts]: Start accepts. Automaton has 4805 states and 6943 transitions. Word has length 114 [2024-11-28 02:17:02,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:17:02,312 INFO L471 AbstractCegarLoop]: Abstraction has 4805 states and 6943 transitions. [2024-11-28 02:17:02,312 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 02:17:02,312 INFO L276 IsEmpty]: Start isEmpty. Operand 4805 states and 6943 transitions. [2024-11-28 02:17:02,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-28 02:17:02,312 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:17:02,312 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 02:17:02,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-28 02:17:02,313 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 02:17:02,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:17:02,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1208455913, now seen corresponding path program 1 times [2024-11-28 02:17:02,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:17:02,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483270306] [2024-11-28 02:17:02,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:17:02,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:17:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:17:04,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 02:17:04,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:17:04,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483270306] [2024-11-28 02:17:04,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483270306] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:17:04,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461165248] [2024-11-28 02:17:04,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:17:04,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:17:04,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:17:04,717 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:17:04,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 02:17:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:17:05,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-28 02:17:05,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:17:05,312 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 02:17:06,089 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:17:06,089 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 02:17:06,112 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 02:17:06,347 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:17:06,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 02:17:06,618 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:17:06,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 02:17:06,897 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:17:06,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 02:17:07,179 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:17:07,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 02:17:07,449 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:17:07,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 31 treesize of output 32 [2024-11-28 02:17:07,570 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:17:07,570 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 02:17:07,889 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:17:07,889 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 02:17:07,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:17:07,962 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 02:17:07,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:17:08,013 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3639 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem63#1.base| v_ArrVal_3639) |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 02:17:08,038 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3639 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3639) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-28 02:17:08,106 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-28 02:17:08,106 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 02:17:08,128 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3638 (Array Int Int)) (v_ArrVal_3639 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem61#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem61#1.base| v_ArrVal_3638))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3639)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-28 02:17:08,166 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3638 (Array Int Int)) (v_ArrVal_3639 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_3638))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3639)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse2)))) is different from false [2024-11-28 02:17:08,218 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3637 (Array Int Int)) (v_ArrVal_3638 (Array Int Int)) (v_ArrVal_3639 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3637)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3638))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3639)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-28 02:17:08,796 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3636 (Array Int Int)) (v_ArrVal_3637 (Array Int Int)) (v_ArrVal_3638 (Array Int Int)) (v_ArrVal_3639 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3636))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3637)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3638))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3639)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-28 02:17:09,238 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3635 (Array Int Int)) (v_ArrVal_3636 (Array Int Int)) (v_ArrVal_3637 (Array Int Int)) (v_ArrVal_3638 (Array Int Int)) (v_ArrVal_3639 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3635))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3636)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3637)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3638))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3639)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-28 02:17:09,294 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3634 (Array Int Int)) (v_ArrVal_3635 (Array Int Int)) (v_ArrVal_3636 (Array Int Int)) (v_ArrVal_3637 (Array Int Int)) (v_ArrVal_3638 (Array Int Int)) (v_ArrVal_3639 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3634))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3635)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3636)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3637)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3638))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3639)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 02:17:10,117 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3642 (Array Int Int)) (v_ArrVal_3634 (Array Int Int)) (v_ArrVal_3635 (Array Int Int)) (v_ArrVal_3636 (Array Int Int)) (v_ArrVal_3637 (Array Int Int)) (v_ArrVal_3638 (Array Int Int)) (v_ArrVal_3639 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3642))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3634)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3635)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3636)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3637)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3638))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3639)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 02:17:10,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461165248] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:17:10,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:17:10,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 23 [2024-11-28 02:17:10,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740763711] [2024-11-28 02:17:10,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:17:10,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 02:17:10,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:17:10,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 02:17:10,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=627, Unknown=40, NotChecked=540, Total=1332 [2024-11-28 02:17:10,125 INFO L87 Difference]: Start difference. First operand 4805 states and 6943 transitions. Second operand has 24 states, 22 states have (on average 7.681818181818182) internal successors, (169), 24 states have internal predecessors, (169), 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 02:18:06,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:18:06,850 INFO L93 Difference]: Finished difference Result 4832 states and 6985 transitions. [2024-11-28 02:18:06,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 02:18:06,851 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 7.681818181818182) internal successors, (169), 24 states have internal predecessors, (169), 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 02:18:06,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:18:06,856 INFO L225 Difference]: With dead ends: 4832 [2024-11-28 02:18:06,856 INFO L226 Difference]: Without dead ends: 4832 [2024-11-28 02:18:06,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=233, Invalid=1245, Unknown=40, NotChecked=738, Total=2256 [2024-11-28 02:18:06,857 INFO L435 NwaCegarLoop]: 1893 mSDtfsCounter, 2717 mSDsluCounter, 24302 mSDsCounter, 0 mSdLazyCounter, 12058 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2733 SdHoareTripleChecker+Valid, 26195 SdHoareTripleChecker+Invalid, 12107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 12058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:18:06,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2733 Valid, 26195 Invalid, 12107 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [49 Valid, 12058 Invalid, 0 Unknown, 0 Unchecked, 55.1s Time] [2024-11-28 02:18:06,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4832 states. [2024-11-28 02:18:06,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4832 to 4804. [2024-11-28 02:18:06,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4804 states, 4070 states have (on average 1.6916461916461916) internal successors, (6885), 4773 states have internal predecessors, (6885), 27 states have call successors, (27), 5 states have call predecessors, (27), 6 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-28 02:18:06,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4804 states to 4804 states and 6941 transitions. [2024-11-28 02:18:06,914 INFO L78 Accepts]: Start accepts. Automaton has 4804 states and 6941 transitions. Word has length 115 [2024-11-28 02:18:06,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:18:06,914 INFO L471 AbstractCegarLoop]: Abstraction has 4804 states and 6941 transitions. [2024-11-28 02:18:06,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 7.681818181818182) internal successors, (169), 24 states have internal predecessors, (169), 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 02:18:06,915 INFO L276 IsEmpty]: Start isEmpty. Operand 4804 states and 6941 transitions. [2024-11-28 02:18:06,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-28 02:18:06,915 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:18:06,916 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 02:18:06,927 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 02:18:07,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:18:07,116 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 02:18:07,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:18:07,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1208455912, now seen corresponding path program 1 times [2024-11-28 02:18:07,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:18:07,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051425870] [2024-11-28 02:18:07,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:18:07,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:18:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:18:10,280 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 02:18:10,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:18:10,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051425870] [2024-11-28 02:18:10,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051425870] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:18:10,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463171174] [2024-11-28 02:18:10,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:18:10,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:18:10,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:18:10,284 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:18:10,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 02:18:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:18:10,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-28 02:18:10,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:18:10,928 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 02:18:11,682 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:18:11,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:18:11,828 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 02:18:11,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:18:12,348 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:18:12,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:18:12,359 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 02:18:12,649 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:18:12,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:18:12,661 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 02:18:12,943 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:18:12,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:18:12,953 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 02:18:13,237 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:18:13,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:18:13,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 02:18:13,545 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:18:13,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:18:13,556 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 02:18:13,889 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:18:13,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:18:13,900 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 02:18:14,250 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:18:14,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2024-11-28 02:18:14,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-11-28 02:18:14,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-28 02:18:14,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-28 02:18:14,757 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 02:18:14,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:18:15,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:18:15,201 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 46 treesize of output 50 [2024-11-28 02:18:15,780 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_prenex_39 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3867 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ 41 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_3866 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse0))))) is different from false [2024-11-28 02:18:15,863 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3864 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem61#1.base| v_ArrVal_3864) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem61#1.base| v_ArrVal_3865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_ArrVal_3864 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_ArrVal_3867 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem61#1.base| v_ArrVal_3864))) (< (select (select (store .cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem61#1.base| v_ArrVal_3865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ 41 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_3865 (Array Int Int)) (v_ArrVal_3866 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem61#1.base| v_ArrVal_3865))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (= .cse2 (select (select (store .cse3 .cse2 v_ArrVal_3866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))))) is different from false [2024-11-28 02:18:15,954 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_3864 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_ArrVal_3867 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_3864))) (< (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_3865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ 41 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3864 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_3864) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_3865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (forall ((v_ArrVal_3865 (Array Int Int)) (v_ArrVal_3866 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_3865))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse3 (select (select (store .cse4 .cse3 v_ArrVal_3866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) is different from false [2024-11-28 02:18:16,039 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3862 (Array Int Int)) (v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3864 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_ArrVal_3867 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3862))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3863) .cse2 v_ArrVal_3864))) (< (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_3865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ 41 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) (forall ((v_ArrVal_3862 (Array Int Int)) (v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3864 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3862))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3863) .cse4 v_ArrVal_3864) (select (select (store .cse5 .cse4 v_ArrVal_3865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_39))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3862 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_ArrVal_3866 (Array Int Int))) (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3862))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3865)))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= .cse6 (select (select (store .cse7 .cse6 v_ArrVal_3866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2024-11-28 02:18:16,103 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_3862 (Array Int Int)) (v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3864 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3862))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3863) .cse1 v_ArrVal_3864) (select (select (store .cse2 .cse1 v_ArrVal_3865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_39))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3862 (Array Int Int)) (v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3864 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_ArrVal_3867 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3862))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3863) .cse6 v_ArrVal_3864))) (< (select (select (store .cse4 (select (select (store .cse5 .cse6 v_ArrVal_3865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ 41 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) (forall ((v_ArrVal_3862 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_ArrVal_3866 (Array Int Int))) (let ((.cse7 (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3862))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3865)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (store .cse7 .cse8 v_ArrVal_3866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse8))))))) is different from false [2024-11-28 02:18:16,205 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3860 (Array Int Int)) (v_ArrVal_3861 (Array Int Int)) (v_ArrVal_3862 (Array Int Int)) (v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3864 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3861))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_3862))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3860) .cse0 v_ArrVal_3863) .cse1 v_ArrVal_3864) (select (select (store .cse2 .cse1 v_ArrVal_3865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_39))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3861 (Array Int Int)) (v_ArrVal_3862 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_ArrVal_3866 (Array Int Int))) (let ((.cse6 (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3861))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3862)))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3865)))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= .cse5 (select (select (store .cse6 .cse5 v_ArrVal_3866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (forall ((v_ArrVal_3860 (Array Int Int)) (v_ArrVal_3861 (Array Int Int)) (v_ArrVal_3862 (Array Int Int)) (v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3864 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_ArrVal_3867 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3861))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse13 .cse12 v_ArrVal_3862))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3860) .cse12 v_ArrVal_3863) .cse11 v_ArrVal_3864))) (< (select (select (store .cse9 (select (select (store .cse10 .cse11 v_ArrVal_3865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ 41 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2024-11-28 02:18:16,423 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_3860 (Array Int Int)) (v_ArrVal_3861 (Array Int Int)) (v_ArrVal_3862 (Array Int Int)) (v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3864 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3861))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3862))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3860) .cse1 v_ArrVal_3863) .cse2 v_ArrVal_3864) (select (select (store .cse3 .cse2 v_ArrVal_3865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_39))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (forall ((v_ArrVal_3860 (Array Int Int)) (v_ArrVal_3861 (Array Int Int)) (v_ArrVal_3862 (Array Int Int)) (v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3864 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_ArrVal_3867 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3861))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse10 .cse9 v_ArrVal_3862))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3860) .cse9 v_ArrVal_3863) .cse8 v_ArrVal_3864))) (< (select (select (store .cse6 (select (select (store .cse7 .cse8 v_ArrVal_3865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (+ 41 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))) (forall ((v_ArrVal_3861 (Array Int Int)) (v_ArrVal_3862 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_ArrVal_3866 (Array Int Int))) (let ((.cse12 (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3861))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3862)))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3865)))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (= .cse11 (select (select (store .cse12 .cse11 v_ArrVal_3866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))) is different from false [2024-11-28 02:18:17,521 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3860 (Array Int Int)) (v_ArrVal_3861 (Array Int Int)) (v_ArrVal_3862 (Array Int Int)) (v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3864 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_ArrVal_3867 (Array Int Int)) (v_ArrVal_3858 (Array Int Int)) (v_ArrVal_3859 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3858))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_3861))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse1 (store .cse6 .cse5 v_ArrVal_3862))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3859) .cse4 v_ArrVal_3860) .cse5 v_ArrVal_3863) .cse2 v_ArrVal_3864))) (< (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_3865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ 41 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) (forall ((v_ArrVal_3861 (Array Int Int)) (v_ArrVal_3862 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_ArrVal_3866 (Array Int Int)) (v_ArrVal_3858 (Array Int Int))) (let ((.cse9 (let ((.cse10 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3858))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3861)))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3862)))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3865)))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= .cse8 (select (select (store .cse9 .cse8 v_ArrVal_3866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (forall ((v_ArrVal_3860 (Array Int Int)) (v_ArrVal_3861 (Array Int Int)) (v_ArrVal_3862 (Array Int Int)) (v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3864 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3858 (Array Int Int)) (v_ArrVal_3859 (Array Int Int))) (<= 0 (select (select (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3858))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_3861))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_3862))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3859) .cse13 v_ArrVal_3860) .cse14 v_ArrVal_3863) .cse15 v_ArrVal_3864) (select (select (store .cse16 .cse15 v_ArrVal_3865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_39))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) is different from false [2024-11-28 02:18:17,790 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (forall ((v_ArrVal_3860 (Array Int Int)) (v_ArrVal_3861 (Array Int Int)) (v_ArrVal_3862 (Array Int Int)) (v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3864 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3858 (Array Int Int)) (v_ArrVal_3859 (Array Int Int))) (<= 0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3858))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3861))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3862))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3859) .cse1 v_ArrVal_3860) .cse2 v_ArrVal_3863) .cse3 v_ArrVal_3864) (select (select (store .cse4 .cse3 v_ArrVal_3865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_39))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (forall ((v_ArrVal_3860 (Array Int Int)) (v_ArrVal_3861 (Array Int Int)) (v_ArrVal_3862 (Array Int Int)) (v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3864 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_ArrVal_3867 (Array Int Int)) (v_ArrVal_3858 (Array Int Int)) (v_ArrVal_3859 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3858))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_3861))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse9 (store .cse13 .cse12 v_ArrVal_3862))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse8 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3859) .cse11 v_ArrVal_3860) .cse12 v_ArrVal_3863) .cse10 v_ArrVal_3864))) (< (select (select (store .cse8 (select (select (store .cse9 .cse10 v_ArrVal_3865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) (+ 41 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))))) (forall ((v_ArrVal_3861 (Array Int Int)) (v_ArrVal_3862 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_ArrVal_3866 (Array Int Int)) (v_ArrVal_3858 (Array Int Int))) (let ((.cse16 (let ((.cse17 (let ((.cse18 (let ((.cse19 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3858))) (store .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3861)))) (store .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3862)))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3865)))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (= .cse15 (select (select (store .cse16 .cse15 v_ArrVal_3866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))) is different from false [2024-11-28 02:18:22,140 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3861 (Array Int Int)) (v_ArrVal_3862 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_ArrVal_3866 (Array Int Int)) (v_ArrVal_3856 (Array Int Int)) (v_ArrVal_3858 (Array Int Int))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3856))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3858)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3861)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3862)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3865)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_3866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) (forall ((v_ArrVal_3860 (Array Int Int)) (v_ArrVal_3861 (Array Int Int)) (v_ArrVal_3862 (Array Int Int)) (v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3864 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_ArrVal_3856 (Array Int Int)) (v_ArrVal_3867 (Array Int Int)) (v_ArrVal_3857 (Array Int Int)) (v_ArrVal_3858 (Array Int Int)) (v_ArrVal_3859 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3856))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_3858))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_3861))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_3862))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse7 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3857) .cse10 v_ArrVal_3859) .cse11 v_ArrVal_3860) .cse12 v_ArrVal_3863) .cse9 v_ArrVal_3864))) (< (select (select (store .cse7 (select (select (store .cse8 .cse9 v_ArrVal_3865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ 41 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))))))) (forall ((v_ArrVal_3860 (Array Int Int)) (v_ArrVal_3861 (Array Int Int)) (v_ArrVal_3862 (Array Int Int)) (v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3864 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_ArrVal_3856 (Array Int Int)) (v_ArrVal_3857 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3858 (Array Int Int)) (v_ArrVal_3859 (Array Int Int))) (<= 0 (select (select (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3856))) (let ((.cse16 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse22 (store .cse23 .cse16 v_ArrVal_3858))) (let ((.cse17 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse21 (store .cse22 .cse17 v_ArrVal_3861))) (let ((.cse18 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse20 (store .cse21 .cse18 v_ArrVal_3862))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3857) .cse16 v_ArrVal_3859) .cse17 v_ArrVal_3860) .cse18 v_ArrVal_3863) .cse19 v_ArrVal_3864) (select (select (store .cse20 .cse19 v_ArrVal_3865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_39))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-28 02:18:26,324 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (and (forall ((v_ArrVal_3860 (Array Int Int)) (v_ArrVal_3861 (Array Int Int)) (v_ArrVal_3862 (Array Int Int)) (v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3864 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_ArrVal_3856 (Array Int Int)) (v_ArrVal_3857 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3858 (Array Int Int)) (v_ArrVal_3859 (Array Int Int))) (<= 0 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3856))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_3858))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_3861))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_3862))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3857) .cse1 v_ArrVal_3859) .cse2 v_ArrVal_3860) .cse3 v_ArrVal_3863) .cse4 v_ArrVal_3864) (select (select (store .cse5 .cse4 v_ArrVal_3865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_prenex_39))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (forall ((v_ArrVal_3861 (Array Int Int)) (v_ArrVal_3862 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_ArrVal_3866 (Array Int Int)) (v_ArrVal_3856 (Array Int Int)) (v_ArrVal_3858 (Array Int Int))) (let ((.cse11 (let ((.cse12 (let ((.cse13 (let ((.cse14 (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3856))) (store .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3858)))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3861)))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3862)))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3865)))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (= .cse10 (select (select (store .cse11 .cse10 v_ArrVal_3866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))) (forall ((v_ArrVal_3860 (Array Int Int)) (v_ArrVal_3861 (Array Int Int)) (v_ArrVal_3862 (Array Int Int)) (v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3864 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_ArrVal_3856 (Array Int Int)) (v_ArrVal_3867 (Array Int Int)) (v_ArrVal_3857 (Array Int Int)) (v_ArrVal_3858 (Array Int Int)) (v_ArrVal_3859 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3856))) (let ((.cse19 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse23 (store .cse24 .cse19 v_ArrVal_3858))) (let ((.cse20 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse22 (store .cse23 .cse20 v_ArrVal_3861))) (let ((.cse21 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse17 (store .cse22 .cse21 v_ArrVal_3862))) (let ((.cse18 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse16 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3857) .cse19 v_ArrVal_3859) .cse20 v_ArrVal_3860) .cse21 v_ArrVal_3863) .cse18 v_ArrVal_3864))) (< (select (select (store .cse16 (select (select (store .cse17 .cse18 v_ArrVal_3865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) (+ 41 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)))))))))))))))) is different from false [2024-11-28 02:18:30,955 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3861 (Array Int Int)) (v_ArrVal_3873 (Array Int Int)) (v_ArrVal_3862 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_ArrVal_3866 (Array Int Int)) (v_ArrVal_3856 (Array Int Int)) (v_ArrVal_3858 (Array Int Int))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3873))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3856)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3858)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3861)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3862)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3865)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_3866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) (forall ((v_ArrVal_3860 (Array Int Int)) (v_ArrVal_3872 (Array Int Int)) (v_ArrVal_3861 (Array Int Int)) (v_ArrVal_3873 (Array Int Int)) (v_ArrVal_3862 (Array Int Int)) (v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3864 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_ArrVal_3856 (Array Int Int)) (v_ArrVal_3867 (Array Int Int)) (v_ArrVal_3857 (Array Int Int)) (v_ArrVal_3858 (Array Int Int)) (v_ArrVal_3859 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3873))) (let ((.cse11 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse17 (store .cse18 .cse11 v_ArrVal_3856))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse16 (store .cse17 .cse12 v_ArrVal_3858))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_3861))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse9 (store .cse15 .cse14 v_ArrVal_3862))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3872) .cse11 v_ArrVal_3857) .cse12 v_ArrVal_3859) .cse13 v_ArrVal_3860) .cse14 v_ArrVal_3863) .cse10 v_ArrVal_3864))) (< (select (select (store .cse8 (select (select (store .cse9 .cse10 v_ArrVal_3865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ 41 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))))))))) (forall ((v_ArrVal_3860 (Array Int Int)) (v_ArrVal_3872 (Array Int Int)) (v_ArrVal_3861 (Array Int Int)) (v_ArrVal_3873 (Array Int Int)) (v_ArrVal_3862 (Array Int Int)) (v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3864 (Array Int Int)) (v_ArrVal_3865 (Array Int Int)) (v_ArrVal_3856 (Array Int Int)) (v_ArrVal_3857 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3858 (Array Int Int)) (v_ArrVal_3859 (Array Int Int))) (<= 0 (select (select (let ((.cse28 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3873))) (let ((.cse19 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse27 (store .cse28 .cse19 v_ArrVal_3856))) (let ((.cse20 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse26 (store .cse27 .cse20 v_ArrVal_3858))) (let ((.cse21 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse25 (store .cse26 .cse21 v_ArrVal_3861))) (let ((.cse22 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse24 (store .cse25 .cse22 v_ArrVal_3862))) (let ((.cse23 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3872) .cse19 v_ArrVal_3857) .cse20 v_ArrVal_3859) .cse21 v_ArrVal_3860) .cse22 v_ArrVal_3863) .cse23 v_ArrVal_3864) (select (select (store .cse24 .cse23 v_ArrVal_3865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_39))))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-28 02:18:31,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463171174] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:18:31,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:18:31,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 28 [2024-11-28 02:18:31,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739876054] [2024-11-28 02:18:31,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:18:31,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-28 02:18:31,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:18:31,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-28 02:18:31,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=893, Unknown=30, NotChecked=852, Total=1892 [2024-11-28 02:18:31,038 INFO L87 Difference]: Start difference. First operand 4804 states and 6941 transitions. Second operand has 29 states, 26 states have (on average 7.115384615384615) internal successors, (185), 29 states have internal predecessors, (185), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:19:58,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:19:58,776 INFO L93 Difference]: Finished difference Result 4831 states and 6983 transitions. [2024-11-28 02:19:58,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 02:19:58,777 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 7.115384615384615) internal successors, (185), 29 states have internal predecessors, (185), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 115 [2024-11-28 02:19:58,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:19:58,782 INFO L225 Difference]: With dead ends: 4831 [2024-11-28 02:19:58,782 INFO L226 Difference]: Without dead ends: 4831 [2024-11-28 02:19:58,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=231, Invalid=1678, Unknown=31, NotChecked=1140, Total=3080 [2024-11-28 02:19:58,783 INFO L435 NwaCegarLoop]: 1888 mSDtfsCounter, 2761 mSDsluCounter, 15886 mSDsCounter, 0 mSdLazyCounter, 10099 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 82.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2777 SdHoareTripleChecker+Valid, 17774 SdHoareTripleChecker+Invalid, 10154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 10099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 83.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:19:58,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2777 Valid, 17774 Invalid, 10154 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [55 Valid, 10099 Invalid, 0 Unknown, 0 Unchecked, 83.9s Time] [2024-11-28 02:19:58,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4831 states. [2024-11-28 02:19:58,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4831 to 4756. [2024-11-28 02:19:58,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4756 states, 4024 states have (on average 1.6988071570576542) internal successors, (6836), 4727 states have internal predecessors, (6836), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-28 02:19:58,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4756 states to 4756 states and 6890 transitions. [2024-11-28 02:19:58,827 INFO L78 Accepts]: Start accepts. Automaton has 4756 states and 6890 transitions. Word has length 115 [2024-11-28 02:19:58,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:19:58,827 INFO L471 AbstractCegarLoop]: Abstraction has 4756 states and 6890 transitions. [2024-11-28 02:19:58,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 7.115384615384615) internal successors, (185), 29 states have internal predecessors, (185), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:19:58,827 INFO L276 IsEmpty]: Start isEmpty. Operand 4756 states and 6890 transitions. [2024-11-28 02:19:58,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-28 02:19:58,828 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:19:58,828 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 02:19:58,841 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-28 02:19:59,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e88e0d6-593d-4768-92b8-5ce4ca5af362/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2024-11-28 02:19:59,029 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-28 02:19:59,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:19:59,029 INFO L85 PathProgramCache]: Analyzing trace with hash -633098814, now seen corresponding path program 1 times [2024-11-28 02:19:59,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:19:59,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99206404] [2024-11-28 02:19:59,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:19:59,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:19:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:20:03,118 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 02:20:03,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:20:03,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99206404] [2024-11-28 02:20:03,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99206404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:20:03,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:20:03,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 02:20:03,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675108714] [2024-11-28 02:20:03,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:20:03,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 02:20:03,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:20:03,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 02:20:03,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-28 02:20:03,120 INFO L87 Difference]: Start difference. First operand 4756 states and 6890 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)