./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-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_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/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_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/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_f2741b7d-2b91-49dc-b98b-649b6ed05b00/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 b9bf0bad0cbe69b5d3c479fc9571d5ea3a755c149f856a4942bf9e49854dfec3 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:40:38,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:40:38,477 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 02:40:38,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:40:38,484 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:40:38,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:40:38,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:40:38,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:40:38,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:40:38,513 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:40:38,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:40:38,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:40:38,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:40:38,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:40:38,514 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:40:38,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:40:38,515 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:40:38,515 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:40:38,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:40:38,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:40:38,516 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 02:40:38,516 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 02:40:38,516 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 02:40:38,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:40:38,516 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 02:40:38,516 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 02:40:38,517 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:40:38,517 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:40:38,517 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:40:38,517 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:40:38,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:40:38,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:40:38,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:40:38,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:40:38,518 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:40:38,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:40:38,518 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:40:38,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:40:38,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:40:38,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:40:38,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:40:38,518 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:40:38,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:40:38,518 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:40:38,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:40:38,519 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:40:38,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:40:38,519 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_f2741b7d-2b91-49dc-b98b-649b6ed05b00/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 -> b9bf0bad0cbe69b5d3c479fc9571d5ea3a755c149f856a4942bf9e49854dfec3 [2024-11-28 02:40:38,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:40:38,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:40:38,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:40:38,874 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:40:38,874 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:40:38,875 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i [2024-11-28 02:40:42,114 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/data/8379191eb/dca36548cbf14fc2b8c81da2cb585026/FLAG3e10fa0b1 [2024-11-28 02:40:42,577 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:40:42,578 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i [2024-11-28 02:40:42,605 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/data/8379191eb/dca36548cbf14fc2b8c81da2cb585026/FLAG3e10fa0b1 [2024-11-28 02:40:42,621 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/data/8379191eb/dca36548cbf14fc2b8c81da2cb585026 [2024-11-28 02:40:42,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:40:42,625 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:40:42,626 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:40:42,626 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:40:42,631 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:40:42,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:40:42" (1/1) ... [2024-11-28 02:40:42,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6112abf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:40:42, skipping insertion in model container [2024-11-28 02:40:42,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:40:42" (1/1) ... [2024-11-28 02:40:42,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:40:43,141 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:40:43,184 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:40:43,189 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:40:43,195 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:40:43,204 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:40:43,256 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:40:43,264 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:40:43,272 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:40:43,285 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:40:43,300 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:40:43,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:40:43,326 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:40:43,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:40:43,574 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:40:43,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:40:43 WrapperNode [2024-11-28 02:40:43,575 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:40:43,576 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:40:43,576 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:40:43,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:40:43,586 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:40:43" (1/1) ... [2024-11-28 02:40:43,626 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:40:43" (1/1) ... [2024-11-28 02:40:43,710 INFO L138 Inliner]: procedures = 176, calls = 336, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1569 [2024-11-28 02:40:43,711 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:40:43,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:40:43,711 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:40:43,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:40:43,722 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:40:43" (1/1) ... [2024-11-28 02:40:43,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:40:43" (1/1) ... [2024-11-28 02:40:43,734 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:40:43" (1/1) ... [2024-11-28 02:40:43,864 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2024-11-28 02:40:43,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:40:43" (1/1) ... [2024-11-28 02:40:43,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:40:43" (1/1) ... [2024-11-28 02:40:43,906 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:40:43" (1/1) ... [2024-11-28 02:40:43,909 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:40:43" (1/1) ... [2024-11-28 02:40:43,923 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:40:43" (1/1) ... [2024-11-28 02:40:43,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:40:43" (1/1) ... [2024-11-28 02:40:43,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:40:43" (1/1) ... [2024-11-28 02:40:43,960 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:40:43,961 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:40:43,961 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:40:43,966 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:40:43,968 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:40:43" (1/1) ... [2024-11-28 02:40:43,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:40:43,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:40:44,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/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:40:44,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/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:40:44,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 02:40:44,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 02:40:44,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-28 02:40:44,063 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-28 02:40:44,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 02:40:44,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 02:40:44,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-28 02:40:44,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-28 02:40:44,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-28 02:40:44,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-28 02:40:44,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 02:40:44,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:40:44,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 02:40:44,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 02:40:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 02:40:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 02:40:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 02:40:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 02:40:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 02:40:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:40:44,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:40:44,423 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:40:44,424 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:40:44,428 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 02:40:44,492 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 02:40:48,399 INFO L? ?]: Removed 1502 outVars from TransFormulas that were not future-live. [2024-11-28 02:40:48,399 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:40:48,469 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:40:48,469 INFO L312 CfgBuilder]: Removed 34 assume(true) statements. [2024-11-28 02:40:48,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:40:48 BoogieIcfgContainer [2024-11-28 02:40:48,474 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:40:48,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:40:48,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:40:48,484 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:40:48,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:40:42" (1/3) ... [2024-11-28 02:40:48,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373400dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:40:48, skipping insertion in model container [2024-11-28 02:40:48,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:40:43" (2/3) ... [2024-11-28 02:40:48,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373400dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:40:48, skipping insertion in model container [2024-11-28 02:40:48,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:40:48" (3/3) ... [2024-11-28 02:40:48,487 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test4-1.i [2024-11-28 02:40:48,511 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:40:48,514 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test4-1.i that has 4 procedures, 1458 locations, 1 initial locations, 36 loop locations, and 628 error locations. [2024-11-28 02:40:48,617 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:40:48,637 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;@76764560, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:40:48,637 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2024-11-28 02:40:48,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 1453 states, 812 states have (on average 2.0738916256157633) internal successors, (1684), 1444 states have internal predecessors, (1684), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-28 02:40:48,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 02:40:48,654 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:40:48,655 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 02:40:48,656 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:40:48,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:40:48,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1499246090, now seen corresponding path program 1 times [2024-11-28 02:40:48,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:40:48,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538650940] [2024-11-28 02:40:48,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:40:48,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:40:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:40:48,829 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:40:48,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:40:48,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538650940] [2024-11-28 02:40:48,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538650940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:40:48,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:40:48,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:40:48,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276385584] [2024-11-28 02:40:48,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:40:48,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 02:40:48,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:40:48,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 02:40:48,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 02:40:48,879 INFO L87 Difference]: Start difference. First operand has 1453 states, 812 states have (on average 2.0738916256157633) internal successors, (1684), 1444 states have internal predecessors, (1684), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:40:49,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:40:49,006 INFO L93 Difference]: Finished difference Result 1434 states and 1628 transitions. [2024-11-28 02:40:49,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 02:40:49,009 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 02:40:49,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:40:49,031 INFO L225 Difference]: With dead ends: 1434 [2024-11-28 02:40:49,031 INFO L226 Difference]: Without dead ends: 1432 [2024-11-28 02:40:49,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 02:40:49,040 INFO L435 NwaCegarLoop]: 1628 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:40:49,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1628 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:40:49,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2024-11-28 02:40:49,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1432. [2024-11-28 02:40:49,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 802 states have (on average 1.9875311720698254) internal successors, (1594), 1423 states have internal predecessors, (1594), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-28 02:40:49,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1626 transitions. [2024-11-28 02:40:49,184 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1626 transitions. Word has length 6 [2024-11-28 02:40:49,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:40:49,184 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 1626 transitions. [2024-11-28 02:40:49,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:40:49,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1626 transitions. [2024-11-28 02:40:49,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 02:40:49,185 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:40:49,185 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 02:40:49,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 02:40:49,186 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:40:49,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:40:49,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103338, now seen corresponding path program 1 times [2024-11-28 02:40:49,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:40:49,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467417478] [2024-11-28 02:40:49,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:40:49,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:40:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:40:49,359 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:40:49,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:40:49,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467417478] [2024-11-28 02:40:49,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467417478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:40:49,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:40:49,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:40:49,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028236262] [2024-11-28 02:40:49,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:40:49,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:40:49,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:40:49,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:40:49,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:40:49,363 INFO L87 Difference]: Start difference. First operand 1432 states and 1626 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:40:50,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:40:50,845 INFO L93 Difference]: Finished difference Result 1341 states and 1536 transitions. [2024-11-28 02:40:50,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:40:50,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 02:40:50,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:40:50,853 INFO L225 Difference]: With dead ends: 1341 [2024-11-28 02:40:50,853 INFO L226 Difference]: Without dead ends: 1341 [2024-11-28 02:40:50,853 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:40:50,857 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 1367 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1383 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:40:50,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1383 Valid, 935 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 02:40:50,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2024-11-28 02:40:50,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1338. [2024-11-28 02:40:50,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1338 states, 802 states have (on average 1.8703241895261846) internal successors, (1500), 1329 states have internal predecessors, (1500), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-28 02:40:50,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1532 transitions. [2024-11-28 02:40:50,902 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 1532 transitions. Word has length 6 [2024-11-28 02:40:50,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:40:50,902 INFO L471 AbstractCegarLoop]: Abstraction has 1338 states and 1532 transitions. [2024-11-28 02:40:50,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:40:50,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1532 transitions. [2024-11-28 02:40:50,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 02:40:50,903 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:40:50,903 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 02:40:50,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 02:40:50,905 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:40:50,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:40:50,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103339, now seen corresponding path program 1 times [2024-11-28 02:40:50,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:40:50,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546086797] [2024-11-28 02:40:50,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:40:50,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:40:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:40:51,108 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:40:51,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:40:51,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546086797] [2024-11-28 02:40:51,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546086797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:40:51,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:40:51,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:40:51,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338416075] [2024-11-28 02:40:51,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:40:51,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:40:51,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:40:51,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:40:51,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:40:51,110 INFO L87 Difference]: Start difference. First operand 1338 states and 1532 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:40:52,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:40:52,617 INFO L93 Difference]: Finished difference Result 1755 states and 2027 transitions. [2024-11-28 02:40:52,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:40:52,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 02:40:52,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:40:52,626 INFO L225 Difference]: With dead ends: 1755 [2024-11-28 02:40:52,626 INFO L226 Difference]: Without dead ends: 1755 [2024-11-28 02:40:52,627 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:40:52,631 INFO L435 NwaCegarLoop]: 1288 mSDtfsCounter, 821 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:40:52,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 1950 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 02:40:52,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2024-11-28 02:40:52,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1601. [2024-11-28 02:40:52,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1075 states have (on average 1.8362790697674418) internal successors, (1974), 1592 states have internal predecessors, (1974), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-28 02:40:52,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2006 transitions. [2024-11-28 02:40:52,691 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2006 transitions. Word has length 6 [2024-11-28 02:40:52,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:40:52,692 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2006 transitions. [2024-11-28 02:40:52,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:40:52,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2006 transitions. [2024-11-28 02:40:52,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 02:40:52,693 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:40:52,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 02:40:52,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:40:52,694 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:40:52,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:40:52,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1424649426, now seen corresponding path program 1 times [2024-11-28 02:40:52,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:40:52,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84333638] [2024-11-28 02:40:52,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:40:52,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:40:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:40:52,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:40:52,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:40:52,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84333638] [2024-11-28 02:40:52,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84333638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:40:52,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:40:52,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:40:52,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607174343] [2024-11-28 02:40:52,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:40:52,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:40:52,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:40:52,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:40:52,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:40:52,769 INFO L87 Difference]: Start difference. First operand 1601 states and 2006 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:40:52,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:40:52,868 INFO L93 Difference]: Finished difference Result 3152 states and 3942 transitions. [2024-11-28 02:40:52,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:40:52,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 02:40:52,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:40:52,885 INFO L225 Difference]: With dead ends: 3152 [2024-11-28 02:40:52,885 INFO L226 Difference]: Without dead ends: 3152 [2024-11-28 02:40:52,885 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:40:52,889 INFO L435 NwaCegarLoop]: 1803 mSDtfsCounter, 1439 mSDsluCounter, 1517 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1445 SdHoareTripleChecker+Valid, 3320 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:40:52,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1445 Valid, 3320 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:40:52,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3152 states. [2024-11-28 02:40:52,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3152 to 1602. [2024-11-28 02:40:52,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1076 states have (on average 1.8355018587360594) internal successors, (1975), 1593 states have internal predecessors, (1975), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-28 02:40:52,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2007 transitions. [2024-11-28 02:40:52,956 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2007 transitions. Word has length 6 [2024-11-28 02:40:52,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:40:52,956 INFO L471 AbstractCegarLoop]: Abstraction has 1602 states and 2007 transitions. [2024-11-28 02:40:52,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:40:52,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2007 transitions. [2024-11-28 02:40:52,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 02:40:52,957 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:40:52,957 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:40:52,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 02:40:52,957 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:40:52,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:40:52,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1783262039, now seen corresponding path program 1 times [2024-11-28 02:40:52,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:40:52,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019089155] [2024-11-28 02:40:52,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:40:52,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:40:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:40:53,096 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:40:53,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:40:53,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019089155] [2024-11-28 02:40:53,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019089155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:40:53,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:40:53,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:40:53,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127893231] [2024-11-28 02:40:53,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:40:53,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:40:53,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:40:53,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:40:53,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:40:53,098 INFO L87 Difference]: Start difference. First operand 1602 states and 2007 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:40:54,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:40:54,770 INFO L93 Difference]: Finished difference Result 1629 states and 2061 transitions. [2024-11-28 02:40:54,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:40:54,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2024-11-28 02:40:54,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:40:54,779 INFO L225 Difference]: With dead ends: 1629 [2024-11-28 02:40:54,779 INFO L226 Difference]: Without dead ends: 1629 [2024-11-28 02:40:54,780 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:40:54,781 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 1635 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1651 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:40:54,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1651 Valid, 1638 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1347 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-28 02:40:54,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2024-11-28 02:40:54,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1579. [2024-11-28 02:40:54,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1579 states, 1076 states have (on average 1.8141263940520447) internal successors, (1952), 1570 states have internal predecessors, (1952), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-28 02:40:54,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 1984 transitions. [2024-11-28 02:40:54,837 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 1984 transitions. Word has length 12 [2024-11-28 02:40:54,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:40:54,838 INFO L471 AbstractCegarLoop]: Abstraction has 1579 states and 1984 transitions. [2024-11-28 02:40:54,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:40:54,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 1984 transitions. [2024-11-28 02:40:54,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 02:40:54,838 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:40:54,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:40:54,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 02:40:54,839 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:40:54,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:40:54,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1783262040, now seen corresponding path program 1 times [2024-11-28 02:40:54,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:40:54,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671221237] [2024-11-28 02:40:54,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:40:54,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:40:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:40:54,942 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:40:54,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:40:54,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671221237] [2024-11-28 02:40:54,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671221237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:40:54,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:40:54,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:40:54,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274216516] [2024-11-28 02:40:54,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:40:54,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:40:54,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:40:54,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:40:54,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:40:54,944 INFO L87 Difference]: Start difference. First operand 1579 states and 1984 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:40:54,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:40:54,999 INFO L93 Difference]: Finished difference Result 1504 states and 1881 transitions. [2024-11-28 02:40:55,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:40:55,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2024-11-28 02:40:55,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:40:55,007 INFO L225 Difference]: With dead ends: 1504 [2024-11-28 02:40:55,007 INFO L226 Difference]: Without dead ends: 1504 [2024-11-28 02:40:55,008 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:40:55,008 INFO L435 NwaCegarLoop]: 1384 mSDtfsCounter, 61 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 2715 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:40:55,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 2715 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:40:55,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2024-11-28 02:40:55,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1504. [2024-11-28 02:40:55,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1013 states have (on average 1.8252714708785784) internal successors, (1849), 1495 states have internal predecessors, (1849), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-28 02:40:55,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1881 transitions. [2024-11-28 02:40:55,050 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1881 transitions. Word has length 12 [2024-11-28 02:40:55,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:40:55,050 INFO L471 AbstractCegarLoop]: Abstraction has 1504 states and 1881 transitions. [2024-11-28 02:40:55,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:40:55,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1881 transitions. [2024-11-28 02:40:55,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-28 02:40:55,051 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:40:55,051 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:40:55,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 02:40:55,051 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:40:55,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:40:55,052 INFO L85 PathProgramCache]: Analyzing trace with hash 23145585, now seen corresponding path program 1 times [2024-11-28 02:40:55,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:40:55,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875499773] [2024-11-28 02:40:55,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:40:55,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:40:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:40:55,139 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:40:55,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:40:55,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875499773] [2024-11-28 02:40:55,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875499773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:40:55,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:40:55,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:40:55,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530844994] [2024-11-28 02:40:55,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:40:55,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:40:55,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:40:55,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:40:55,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:40:55,142 INFO L87 Difference]: Start difference. First operand 1504 states and 1881 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:40:55,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:40:55,244 INFO L93 Difference]: Finished difference Result 1486 states and 1856 transitions. [2024-11-28 02:40:55,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:40:55,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2024-11-28 02:40:55,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:40:55,250 INFO L225 Difference]: With dead ends: 1486 [2024-11-28 02:40:55,250 INFO L226 Difference]: Without dead ends: 1486 [2024-11-28 02:40:55,251 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:40:55,252 INFO L435 NwaCegarLoop]: 1349 mSDtfsCounter, 41 mSDsluCounter, 2670 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 4019 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:40:55,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 4019 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:40:55,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2024-11-28 02:40:55,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1483. [2024-11-28 02:40:55,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1483 states, 999 states have (on average 1.822822822822823) internal successors, (1821), 1474 states have internal predecessors, (1821), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-28 02:40:55,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 1853 transitions. [2024-11-28 02:40:55,292 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 1853 transitions. Word has length 14 [2024-11-28 02:40:55,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:40:55,292 INFO L471 AbstractCegarLoop]: Abstraction has 1483 states and 1853 transitions. [2024-11-28 02:40:55,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:40:55,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1853 transitions. [2024-11-28 02:40:55,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 02:40:55,293 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:40:55,293 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] [2024-11-28 02:40:55,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 02:40:55,293 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:40:55,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:40:55,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1739855297, now seen corresponding path program 1 times [2024-11-28 02:40:55,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:40:55,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027812780] [2024-11-28 02:40:55,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:40:55,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:40:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:40:55,612 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:40:55,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:40:55,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027812780] [2024-11-28 02:40:55,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027812780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:40:55,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:40:55,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:40:55,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996285099] [2024-11-28 02:40:55,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:40:55,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:40:55,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:40:55,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:40:55,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:40:55,615 INFO L87 Difference]: Start difference. First operand 1483 states and 1853 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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:40:57,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:40:57,388 INFO L93 Difference]: Finished difference Result 1682 states and 1946 transitions. [2024-11-28 02:40:57,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:40:57,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 28 [2024-11-28 02:40:57,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:40:57,394 INFO L225 Difference]: With dead ends: 1682 [2024-11-28 02:40:57,395 INFO L226 Difference]: Without dead ends: 1682 [2024-11-28 02:40:57,395 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:40:57,396 INFO L435 NwaCegarLoop]: 1170 mSDtfsCounter, 826 mSDsluCounter, 1431 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 2601 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:40:57,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 2601 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-28 02:40:57,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2024-11-28 02:40:57,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1479. [2024-11-28 02:40:57,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 999 states have (on average 1.8188188188188188) internal successors, (1817), 1470 states have internal predecessors, (1817), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-28 02:40:57,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 1849 transitions. [2024-11-28 02:40:57,439 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 1849 transitions. Word has length 28 [2024-11-28 02:40:57,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:40:57,441 INFO L471 AbstractCegarLoop]: Abstraction has 1479 states and 1849 transitions. [2024-11-28 02:40:57,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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:40:57,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 1849 transitions. [2024-11-28 02:40:57,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-28 02:40:57,443 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:40:57,445 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] [2024-11-28 02:40:57,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 02:40:57,445 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:40:57,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:40:57,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1055550923, now seen corresponding path program 1 times [2024-11-28 02:40:57,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:40:57,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479135825] [2024-11-28 02:40:57,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:40:57,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:40:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:40:57,651 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:40:57,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:40:57,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479135825] [2024-11-28 02:40:57,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479135825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:40:57,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:40:57,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:40:57,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611162314] [2024-11-28 02:40:57,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:40:57,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:40:57,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:40:57,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:40:57,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:40:57,655 INFO L87 Difference]: Start difference. First operand 1479 states and 1849 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:40:57,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:40:57,743 INFO L93 Difference]: Finished difference Result 1479 states and 1845 transitions. [2024-11-28 02:40:57,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:40:57,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2024-11-28 02:40:57,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:40:57,749 INFO L225 Difference]: With dead ends: 1479 [2024-11-28 02:40:57,749 INFO L226 Difference]: Without dead ends: 1479 [2024-11-28 02:40:57,750 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:40:57,751 INFO L435 NwaCegarLoop]: 1344 mSDtfsCounter, 21 mSDsluCounter, 2657 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4001 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:40:57,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4001 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:40:57,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2024-11-28 02:40:57,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1479. [2024-11-28 02:40:57,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 999 states have (on average 1.8148148148148149) internal successors, (1813), 1470 states have internal predecessors, (1813), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-28 02:40:57,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 1845 transitions. [2024-11-28 02:40:57,791 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 1845 transitions. Word has length 62 [2024-11-28 02:40:57,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:40:57,793 INFO L471 AbstractCegarLoop]: Abstraction has 1479 states and 1845 transitions. [2024-11-28 02:40:57,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:40:57,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 1845 transitions. [2024-11-28 02:40:57,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 02:40:57,798 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:40:57,798 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] [2024-11-28 02:40:57,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 02:40:57,799 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:40:57,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:40:57,799 INFO L85 PathProgramCache]: Analyzing trace with hash -680482047, now seen corresponding path program 1 times [2024-11-28 02:40:57,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:40:57,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268779547] [2024-11-28 02:40:57,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:40:57,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:40:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:40:58,038 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:40:58,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:40:58,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268779547] [2024-11-28 02:40:58,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268779547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:40:58,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:40:58,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:40:58,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454093331] [2024-11-28 02:40:58,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:40:58,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:40:58,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:40:58,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:40:58,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:40:58,041 INFO L87 Difference]: Start difference. First operand 1479 states and 1845 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:40:58,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:40:58,117 INFO L93 Difference]: Finished difference Result 1572 states and 1965 transitions. [2024-11-28 02:40:58,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:40:58,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-28 02:40:58,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:40:58,125 INFO L225 Difference]: With dead ends: 1572 [2024-11-28 02:40:58,125 INFO L226 Difference]: Without dead ends: 1572 [2024-11-28 02:40:58,125 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:40:58,127 INFO L435 NwaCegarLoop]: 1359 mSDtfsCounter, 54 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2691 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:40:58,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2691 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:40:58,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2024-11-28 02:40:58,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1572. [2024-11-28 02:40:58,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1092 states have (on average 1.77014652014652) internal successors, (1933), 1563 states have internal predecessors, (1933), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-28 02:40:58,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 1965 transitions. [2024-11-28 02:40:58,167 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 1965 transitions. Word has length 70 [2024-11-28 02:40:58,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:40:58,168 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 1965 transitions. [2024-11-28 02:40:58,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:40:58,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 1965 transitions. [2024-11-28 02:40:58,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-28 02:40:58,170 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:40:58,170 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] [2024-11-28 02:40:58,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 02:40:58,172 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:40:58,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:40:58,172 INFO L85 PathProgramCache]: Analyzing trace with hash -104075831, now seen corresponding path program 1 times [2024-11-28 02:40:58,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:40:58,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740549094] [2024-11-28 02:40:58,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:40:58,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:40:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:40:58,958 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:40:58,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:40:58,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740549094] [2024-11-28 02:40:58,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740549094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:40:58,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:40:58,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:40:58,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443815912] [2024-11-28 02:40:58,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:40:58,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:40:58,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:40:58,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:40:58,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:40:58,960 INFO L87 Difference]: Start difference. First operand 1572 states and 1965 transitions. Second operand has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 7 states have internal predecessors, (73), 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:41:00,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:41:00,827 INFO L93 Difference]: Finished difference Result 1488 states and 1881 transitions. [2024-11-28 02:41:00,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:41:00,828 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 7 states have internal predecessors, (73), 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 73 [2024-11-28 02:41:00,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:41:00,833 INFO L225 Difference]: With dead ends: 1488 [2024-11-28 02:41:00,833 INFO L226 Difference]: Without dead ends: 1488 [2024-11-28 02:41:00,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:41:00,834 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 3375 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3381 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:41:00,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3381 Valid, 1228 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-28 02:41:00,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2024-11-28 02:41:00,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1215. [2024-11-28 02:41:00,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 819 states have (on average 1.6666666666666667) internal successors, (1365), 1206 states have internal predecessors, (1365), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-28 02:41:00,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1397 transitions. [2024-11-28 02:41:00,864 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1397 transitions. Word has length 73 [2024-11-28 02:41:00,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:41:00,864 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1397 transitions. [2024-11-28 02:41:00,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 7 states have internal predecessors, (73), 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:41:00,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1397 transitions. [2024-11-28 02:41:00,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-28 02:41:00,866 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:41:00,866 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] [2024-11-28 02:41:00,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 02:41:00,866 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:41:00,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:41:00,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1353945236, now seen corresponding path program 1 times [2024-11-28 02:41:00,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:41:00,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153265920] [2024-11-28 02:41:00,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:41:00,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:41:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:41:01,285 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:41:01,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:41:01,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153265920] [2024-11-28 02:41:01,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153265920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:41:01,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:41:01,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:41:01,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082160640] [2024-11-28 02:41:01,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:41:01,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:41:01,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:41:01,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:41:01,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:41:01,287 INFO L87 Difference]: Start difference. First operand 1215 states and 1397 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:41:02,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:41:02,679 INFO L93 Difference]: Finished difference Result 1214 states and 1396 transitions. [2024-11-28 02:41:02,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:41:02,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-28 02:41:02,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:41:02,684 INFO L225 Difference]: With dead ends: 1214 [2024-11-28 02:41:02,684 INFO L226 Difference]: Without dead ends: 1214 [2024-11-28 02:41:02,685 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:41:02,685 INFO L435 NwaCegarLoop]: 1271 mSDtfsCounter, 2 mSDsluCounter, 2353 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3624 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:41:02,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3624 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-28 02:41:02,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2024-11-28 02:41:02,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1214. [2024-11-28 02:41:02,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 819 states have (on average 1.6654456654456655) internal successors, (1364), 1205 states have internal predecessors, (1364), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-28 02:41:02,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1396 transitions. [2024-11-28 02:41:02,717 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1396 transitions. Word has length 78 [2024-11-28 02:41:02,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:41:02,718 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 1396 transitions. [2024-11-28 02:41:02,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:41:02,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1396 transitions. [2024-11-28 02:41:02,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-28 02:41:02,719 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:41:02,720 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] [2024-11-28 02:41:02,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 02:41:02,720 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:41:02,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:41:02,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1353945237, now seen corresponding path program 1 times [2024-11-28 02:41:02,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:41:02,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965956170] [2024-11-28 02:41:02,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:41:02,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:41:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:41:03,463 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:41:03,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:41:03,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965956170] [2024-11-28 02:41:03,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965956170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:41:03,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:41:03,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:41:03,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581355887] [2024-11-28 02:41:03,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:41:03,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:41:03,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:41:03,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:41:03,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:41:03,467 INFO L87 Difference]: Start difference. First operand 1214 states and 1396 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:41:04,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:41:04,965 INFO L93 Difference]: Finished difference Result 1213 states and 1395 transitions. [2024-11-28 02:41:04,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:41:04,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-28 02:41:04,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:41:04,969 INFO L225 Difference]: With dead ends: 1213 [2024-11-28 02:41:04,969 INFO L226 Difference]: Without dead ends: 1213 [2024-11-28 02:41:04,969 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:41:04,969 INFO L435 NwaCegarLoop]: 1271 mSDtfsCounter, 1 mSDsluCounter, 2368 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3639 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:41:04,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3639 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 02:41:04,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2024-11-28 02:41:04,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1213. [2024-11-28 02:41:04,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 818 states have (on average 1.6662591687041566) internal successors, (1363), 1204 states have internal predecessors, (1363), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-28 02:41:04,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1395 transitions. [2024-11-28 02:41:04,992 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1395 transitions. Word has length 78 [2024-11-28 02:41:04,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:41:04,993 INFO L471 AbstractCegarLoop]: Abstraction has 1213 states and 1395 transitions. [2024-11-28 02:41:04,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:41:04,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1395 transitions. [2024-11-28 02:41:04,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-28 02:41:04,994 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:41:04,994 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] [2024-11-28 02:41:04,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 02:41:04,995 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:41:04,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:41:04,995 INFO L85 PathProgramCache]: Analyzing trace with hash -834999973, now seen corresponding path program 1 times [2024-11-28 02:41:04,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:41:04,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766895668] [2024-11-28 02:41:04,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:41:04,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:41:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:41:05,351 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:41:05,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:41:05,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766895668] [2024-11-28 02:41:05,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766895668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:41:05,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:41:05,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:41:05,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305117274] [2024-11-28 02:41:05,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:41:05,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:41:05,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:41:05,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:41:05,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:41:05,355 INFO L87 Difference]: Start difference. First operand 1213 states and 1395 transitions. Second operand has 7 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 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:41:07,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:41:07,122 INFO L93 Difference]: Finished difference Result 1225 states and 1413 transitions. [2024-11-28 02:41:07,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:41:07,122 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 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 86 [2024-11-28 02:41:07,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:41:07,127 INFO L225 Difference]: With dead ends: 1225 [2024-11-28 02:41:07,127 INFO L226 Difference]: Without dead ends: 1225 [2024-11-28 02:41:07,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:41:07,128 INFO L435 NwaCegarLoop]: 1254 mSDtfsCounter, 12 mSDsluCounter, 3593 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4847 SdHoareTripleChecker+Invalid, 1537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:41:07,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4847 Invalid, 1537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1520 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-28 02:41:07,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2024-11-28 02:41:07,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1219. [2024-11-28 02:41:07,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 823 states have (on average 1.6646415552855407) internal successors, (1370), 1209 states have internal predecessors, (1370), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-28 02:41:07,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1408 transitions. [2024-11-28 02:41:07,155 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1408 transitions. Word has length 86 [2024-11-28 02:41:07,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:41:07,155 INFO L471 AbstractCegarLoop]: Abstraction has 1219 states and 1408 transitions. [2024-11-28 02:41:07,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 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:41:07,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1408 transitions. [2024-11-28 02:41:07,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-28 02:41:07,156 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:41:07,156 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] [2024-11-28 02:41:07,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 02:41:07,157 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:41:07,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:41:07,157 INFO L85 PathProgramCache]: Analyzing trace with hash -834999972, now seen corresponding path program 1 times [2024-11-28 02:41:07,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:41:07,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359249997] [2024-11-28 02:41:07,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:41:07,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:41:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:41:07,932 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:41:07,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:41:07,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359249997] [2024-11-28 02:41:07,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359249997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:41:07,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:41:07,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:41:07,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571982637] [2024-11-28 02:41:07,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:41:07,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:41:07,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:41:07,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:41:07,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:41:07,935 INFO L87 Difference]: Start difference. First operand 1219 states and 1408 transitions. Second operand has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 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:41:09,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:41:09,936 INFO L93 Difference]: Finished difference Result 1219 states and 1407 transitions. [2024-11-28 02:41:09,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:41:09,937 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 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 86 [2024-11-28 02:41:09,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:41:09,942 INFO L225 Difference]: With dead ends: 1219 [2024-11-28 02:41:09,943 INFO L226 Difference]: Without dead ends: 1219 [2024-11-28 02:41:09,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:41:09,944 INFO L435 NwaCegarLoop]: 1261 mSDtfsCounter, 7 mSDsluCounter, 3352 mSDsCounter, 0 mSdLazyCounter, 1727 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4613 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:41:09,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4613 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-28 02:41:09,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2024-11-28 02:41:09,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1219. [2024-11-28 02:41:09,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 823 states have (on average 1.663426488456865) internal successors, (1369), 1209 states have internal predecessors, (1369), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-28 02:41:09,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1407 transitions. [2024-11-28 02:41:09,970 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1407 transitions. Word has length 86 [2024-11-28 02:41:09,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:41:09,970 INFO L471 AbstractCegarLoop]: Abstraction has 1219 states and 1407 transitions. [2024-11-28 02:41:09,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 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:41:09,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1407 transitions. [2024-11-28 02:41:09,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-28 02:41:09,971 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:41:09,971 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:41:09,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 02:41:09,972 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:41:09,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:41:09,972 INFO L85 PathProgramCache]: Analyzing trace with hash 570824, now seen corresponding path program 1 times [2024-11-28 02:41:09,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:41:09,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557644067] [2024-11-28 02:41:09,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:41:09,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:41:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:41:10,649 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:41:10,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:41:10,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557644067] [2024-11-28 02:41:10,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557644067] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:41:10,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505904127] [2024-11-28 02:41:10,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:41:10,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:41:10,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:41:10,655 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:41:10,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:41:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:41:10,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-28 02:41:10,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:41:11,028 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:41:11,232 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:41:11,233 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:41:11,255 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:41:11,360 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:41:11,361 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:41:11,407 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:41:11,412 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:41:11,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:41:11,485 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-28 02:41:11,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-28 02:41:11,495 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_501) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)))) is different from false [2024-11-28 02:41:11,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505904127] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:41:11,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:41:11,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2024-11-28 02:41:11,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123709635] [2024-11-28 02:41:11,499 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:41:11,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 02:41:11,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:41:11,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 02:41:11,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2024-11-28 02:41:11,500 INFO L87 Difference]: Start difference. First operand 1219 states and 1407 transitions. Second operand has 14 states, 12 states have (on average 10.333333333333334) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:41:14,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:41:14,292 INFO L93 Difference]: Finished difference Result 1218 states and 1406 transitions. [2024-11-28 02:41:14,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:41:14,292 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.333333333333334) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 87 [2024-11-28 02:41:14,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:41:14,297 INFO L225 Difference]: With dead ends: 1218 [2024-11-28 02:41:14,297 INFO L226 Difference]: Without dead ends: 1218 [2024-11-28 02:41:14,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=342, Unknown=1, NotChecked=38, Total=462 [2024-11-28 02:41:14,299 INFO L435 NwaCegarLoop]: 782 mSDtfsCounter, 1171 mSDsluCounter, 5228 mSDsCounter, 0 mSdLazyCounter, 4166 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1191 SdHoareTripleChecker+Valid, 6010 SdHoareTripleChecker+Invalid, 4197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 4166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:41:14,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1191 Valid, 6010 Invalid, 4197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 4166 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-28 02:41:14,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2024-11-28 02:41:14,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1218. [2024-11-28 02:41:14,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 823 states have (on average 1.6622114216281896) internal successors, (1368), 1208 states have internal predecessors, (1368), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-28 02:41:14,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1406 transitions. [2024-11-28 02:41:14,324 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1406 transitions. Word has length 87 [2024-11-28 02:41:14,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:41:14,324 INFO L471 AbstractCegarLoop]: Abstraction has 1218 states and 1406 transitions. [2024-11-28 02:41:14,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.333333333333334) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:41:14,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1406 transitions. [2024-11-28 02:41:14,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-28 02:41:14,326 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:41:14,326 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:41:14,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 02:41:14,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-28 02:41:14,527 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:41:14,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:41:14,528 INFO L85 PathProgramCache]: Analyzing trace with hash 570825, now seen corresponding path program 1 times [2024-11-28 02:41:14,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:41:14,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76469561] [2024-11-28 02:41:14,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:41:14,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:41:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:41:15,617 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:41:15,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:41:15,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76469561] [2024-11-28 02:41:15,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76469561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:41:15,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843122402] [2024-11-28 02:41:15,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:41:15,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:41:15,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:41:15,620 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:41:15,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:41:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:41:15,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-28 02:41:15,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:41:15,930 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:41:16,098 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:41:16,098 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:41:16,135 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:41:16,139 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:41:16,423 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:41:16,423 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:41:16,432 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:41:16,499 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:41:16,507 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:41:16,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:41:16,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:41:16,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:41:16,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2024-11-28 02:41:16,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843122402] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:41:16,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:41:16,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2024-11-28 02:41:16,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825784604] [2024-11-28 02:41:16,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:41:16,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 02:41:16,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:41:16,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 02:41:16,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=388, Unknown=11, NotChecked=0, Total=462 [2024-11-28 02:41:16,936 INFO L87 Difference]: Start difference. First operand 1218 states and 1406 transitions. Second operand has 19 states, 16 states have (on average 8.5) internal successors, (136), 19 states have internal predecessors, (136), 2 states have call successors, (2), 1 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:41:22,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:41:22,360 INFO L93 Difference]: Finished difference Result 1217 states and 1405 transitions. [2024-11-28 02:41:22,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 02:41:22,360 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.5) internal successors, (136), 19 states have internal predecessors, (136), 2 states have call successors, (2), 1 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 87 [2024-11-28 02:41:22,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:41:22,365 INFO L225 Difference]: With dead ends: 1217 [2024-11-28 02:41:22,365 INFO L226 Difference]: Without dead ends: 1217 [2024-11-28 02:41:22,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=538, Unknown=12, NotChecked=0, Total=650 [2024-11-28 02:41:22,366 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 1171 mSDsluCounter, 6429 mSDsCounter, 0 mSdLazyCounter, 6774 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1191 SdHoareTripleChecker+Valid, 7210 SdHoareTripleChecker+Invalid, 6823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 6774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:41:22,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1191 Valid, 7210 Invalid, 6823 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [49 Valid, 6774 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-28 02:41:22,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2024-11-28 02:41:22,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1211. [2024-11-28 02:41:22,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 818 states have (on average 1.6638141809290954) internal successors, (1361), 1202 states have internal predecessors, (1361), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-28 02:41:22,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1393 transitions. [2024-11-28 02:41:22,390 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1393 transitions. Word has length 87 [2024-11-28 02:41:22,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:41:22,390 INFO L471 AbstractCegarLoop]: Abstraction has 1211 states and 1393 transitions. [2024-11-28 02:41:22,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.5) internal successors, (136), 19 states have internal predecessors, (136), 2 states have call successors, (2), 1 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:41:22,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1393 transitions. [2024-11-28 02:41:22,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-28 02:41:22,392 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:41:22,392 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] [2024-11-28 02:41:22,407 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 02:41:22,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-28 02:41:22,596 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:41:22,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:41:22,597 INFO L85 PathProgramCache]: Analyzing trace with hash 966994512, now seen corresponding path program 1 times [2024-11-28 02:41:22,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:41:22,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891212224] [2024-11-28 02:41:22,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:41:22,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:41:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:41:23,302 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:41:23,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:41:23,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891212224] [2024-11-28 02:41:23,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891212224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:41:23,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:41:23,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 02:41:23,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537690915] [2024-11-28 02:41:23,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:41:23,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 02:41:23,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:41:23,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 02:41:23,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-28 02:41:23,306 INFO L87 Difference]: Start difference. First operand 1211 states and 1393 transitions. Second operand has 14 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (1), 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:41:26,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:41:26,136 INFO L93 Difference]: Finished difference Result 1221 states and 1409 transitions. [2024-11-28 02:41:26,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:41:26,137 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (1), 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 89 [2024-11-28 02:41:26,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:41:26,140 INFO L225 Difference]: With dead ends: 1221 [2024-11-28 02:41:26,141 INFO L226 Difference]: Without dead ends: 1221 [2024-11-28 02:41:26,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-28 02:41:26,141 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 1198 mSDsluCounter, 5977 mSDsCounter, 0 mSdLazyCounter, 4714 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 6758 SdHoareTripleChecker+Invalid, 4745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 4714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:41:26,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1218 Valid, 6758 Invalid, 4745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 4714 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-28 02:41:26,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2024-11-28 02:41:26,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1220. [2024-11-28 02:41:26,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1220 states, 826 states have (on average 1.6598062953995156) internal successors, (1371), 1210 states have internal predecessors, (1371), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-28 02:41:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1409 transitions. [2024-11-28 02:41:26,160 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1409 transitions. Word has length 89 [2024-11-28 02:41:26,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:41:26,161 INFO L471 AbstractCegarLoop]: Abstraction has 1220 states and 1409 transitions. [2024-11-28 02:41:26,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (1), 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:41:26,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1409 transitions. [2024-11-28 02:41:26,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-28 02:41:26,162 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:41:26,162 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] [2024-11-28 02:41:26,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 02:41:26,162 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:41:26,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:41:26,163 INFO L85 PathProgramCache]: Analyzing trace with hash 966994513, now seen corresponding path program 1 times [2024-11-28 02:41:26,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:41:26,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271756958] [2024-11-28 02:41:26,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:41:26,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:41:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:41:26,955 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:41:26,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:41:26,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271756958] [2024-11-28 02:41:26,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271756958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:41:26,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:41:26,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 02:41:26,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534701033] [2024-11-28 02:41:26,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:41:26,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 02:41:26,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:41:26,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 02:41:26,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-28 02:41:26,959 INFO L87 Difference]: Start difference. First operand 1220 states and 1409 transitions. Second operand has 11 states, 10 states have (on average 8.7) internal successors, (87), 11 states have internal predecessors, (87), 1 states have call successors, (1), 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:41:30,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:41:30,018 INFO L93 Difference]: Finished difference Result 1220 states and 1408 transitions. [2024-11-28 02:41:30,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:41:30,018 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.7) internal successors, (87), 11 states have internal predecessors, (87), 1 states have call successors, (1), 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 89 [2024-11-28 02:41:30,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:41:30,022 INFO L225 Difference]: With dead ends: 1220 [2024-11-28 02:41:30,022 INFO L226 Difference]: Without dead ends: 1220 [2024-11-28 02:41:30,022 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:41:30,023 INFO L435 NwaCegarLoop]: 788 mSDtfsCounter, 1173 mSDsluCounter, 4508 mSDsCounter, 0 mSdLazyCounter, 4851 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 5296 SdHoareTripleChecker+Invalid, 4880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 4851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:41:30,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1193 Valid, 5296 Invalid, 4880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 4851 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-28 02:41:30,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2024-11-28 02:41:30,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1220. [2024-11-28 02:41:30,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1220 states, 826 states have (on average 1.658595641646489) internal successors, (1370), 1210 states have internal predecessors, (1370), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-28 02:41:30,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1408 transitions. [2024-11-28 02:41:30,039 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1408 transitions. Word has length 89 [2024-11-28 02:41:30,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:41:30,039 INFO L471 AbstractCegarLoop]: Abstraction has 1220 states and 1408 transitions. [2024-11-28 02:41:30,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.7) internal successors, (87), 11 states have internal predecessors, (87), 1 states have call successors, (1), 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:41:30,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1408 transitions. [2024-11-28 02:41:30,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-28 02:41:30,040 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:41:30,040 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] [2024-11-28 02:41:30,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 02:41:30,041 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:41:30,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:41:30,041 INFO L85 PathProgramCache]: Analyzing trace with hash -173839677, now seen corresponding path program 1 times [2024-11-28 02:41:30,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:41:30,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704959410] [2024-11-28 02:41:30,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:41:30,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:41:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:41:30,682 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:41:30,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:41:30,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704959410] [2024-11-28 02:41:30,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704959410] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:41:30,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99806512] [2024-11-28 02:41:30,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:41:30,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:41:30,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:41:30,686 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:41:30,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 02:41:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:41:30,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-28 02:41:30,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:41:30,967 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:41:31,085 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:41:31,085 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:41:31,093 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:41:31,156 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:41:31,157 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:41:31,211 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:41:31,212 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:41:31,226 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:41:31,229 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:41:31,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:41:31,241 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_879 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_879) |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:41:31,323 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-28 02:41:31,324 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:41:31,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99806512] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:41:31,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:41:31,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2024-11-28 02:41:31,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085582117] [2024-11-28 02:41:31,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:41:31,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 02:41:31,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:41:31,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 02:41:31,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=245, Unknown=15, NotChecked=32, Total=342 [2024-11-28 02:41:31,375 INFO L87 Difference]: Start difference. First operand 1220 states and 1408 transitions. Second operand has 16 states, 14 states have (on average 9.214285714285714) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (1), 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:41:34,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:41:34,078 INFO L93 Difference]: Finished difference Result 1219 states and 1407 transitions. [2024-11-28 02:41:34,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:41:34,079 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.214285714285714) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (1), 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 90 [2024-11-28 02:41:34,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:41:34,083 INFO L225 Difference]: With dead ends: 1219 [2024-11-28 02:41:34,083 INFO L226 Difference]: Without dead ends: 1219 [2024-11-28 02:41:34,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=483, Unknown=15, NotChecked=46, Total=650 [2024-11-28 02:41:34,084 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 1167 mSDsluCounter, 5934 mSDsCounter, 0 mSdLazyCounter, 4693 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 6715 SdHoareTripleChecker+Invalid, 4723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 4693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:41:34,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 6715 Invalid, 4723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 4693 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-28 02:41:34,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2024-11-28 02:41:34,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1219. [2024-11-28 02:41:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 826 states have (on average 1.6573849878934626) internal successors, (1369), 1209 states have internal predecessors, (1369), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-28 02:41:34,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1407 transitions. [2024-11-28 02:41:34,107 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1407 transitions. Word has length 90 [2024-11-28 02:41:34,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:41:34,107 INFO L471 AbstractCegarLoop]: Abstraction has 1219 states and 1407 transitions. [2024-11-28 02:41:34,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.214285714285714) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (1), 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:41:34,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1407 transitions. [2024-11-28 02:41:34,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-28 02:41:34,109 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:41:34,109 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] [2024-11-28 02:41:34,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 02:41:34,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:41:34,313 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:41:34,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:41:34,313 INFO L85 PathProgramCache]: Analyzing trace with hash -173839676, now seen corresponding path program 1 times [2024-11-28 02:41:34,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:41:34,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226509008] [2024-11-28 02:41:34,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:41:34,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:41:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:41:35,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:41:35,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:41:35,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226509008] [2024-11-28 02:41:35,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226509008] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:41:35,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612737808] [2024-11-28 02:41:35,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:41:35,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:41:35,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:41:35,226 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:41:35,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 02:41:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:41:35,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-28 02:41:35,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:41:35,509 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:41:35,651 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:41:35,651 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:41:35,660 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:41:35,692 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:41:35,696 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:41:35,803 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:41:35,807 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:41:35,924 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:41:35,925 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:41:35,930 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:41:36,036 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:41:36,036 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:41:36,044 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:41:36,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:41:36,088 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:41:36,108 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:41:36,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:41:36,184 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1019 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 02:41:36,201 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_1019 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-28 02:41:36,276 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1026) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1025) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1025))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1026) .cse1 v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-28 02:41:36,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612737808] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:41:36,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:41:36,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-11-28 02:41:36,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115911761] [2024-11-28 02:41:36,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:41:36,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 02:41:36,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:41:36,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 02:41:36,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=397, Unknown=3, NotChecked=126, Total=600 [2024-11-28 02:41:36,281 INFO L87 Difference]: Start difference. First operand 1219 states and 1407 transitions. Second operand has 20 states, 17 states have (on average 8.352941176470589) internal successors, (142), 20 states have internal predecessors, (142), 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:41:42,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:41:42,346 INFO L93 Difference]: Finished difference Result 1226 states and 1414 transitions. [2024-11-28 02:41:42,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:41:42,346 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.352941176470589) internal successors, (142), 20 states have internal predecessors, (142), 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 90 [2024-11-28 02:41:42,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:41:42,349 INFO L225 Difference]: With dead ends: 1226 [2024-11-28 02:41:42,349 INFO L226 Difference]: Without dead ends: 1226 [2024-11-28 02:41:42,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=594, Unknown=3, NotChecked=156, Total=870 [2024-11-28 02:41:42,350 INFO L435 NwaCegarLoop]: 786 mSDtfsCounter, 1170 mSDsluCounter, 7229 mSDsCounter, 0 mSdLazyCounter, 8502 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 8015 SdHoareTripleChecker+Invalid, 8549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 8502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:41:42,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1190 Valid, 8015 Invalid, 8549 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [47 Valid, 8502 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-11-28 02:41:42,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2024-11-28 02:41:42,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1214. [2024-11-28 02:41:42,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 822 states have (on average 1.659367396593674) internal successors, (1364), 1204 states have internal predecessors, (1364), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-28 02:41:42,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1396 transitions. [2024-11-28 02:41:42,370 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1396 transitions. Word has length 90 [2024-11-28 02:41:42,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:41:42,370 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 1396 transitions. [2024-11-28 02:41:42,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.352941176470589) internal successors, (142), 20 states have internal predecessors, (142), 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:41:42,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1396 transitions. [2024-11-28 02:41:42,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-28 02:41:42,371 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:41:42,371 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] [2024-11-28 02:41:42,381 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-28 02:41:42,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-28 02:41:42,572 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:41:42,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:41:42,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1388471394, now seen corresponding path program 1 times [2024-11-28 02:41:42,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:41:42,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817431779] [2024-11-28 02:41:42,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:41:42,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:41:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:41:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:41:43,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:41:43,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817431779] [2024-11-28 02:41:43,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817431779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:41:43,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:41:43,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 02:41:43,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698133988] [2024-11-28 02:41:43,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:41:43,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 02:41:43,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:41:43,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 02:41:43,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-28 02:41:43,235 INFO L87 Difference]: Start difference. First operand 1214 states and 1396 transitions. Second operand has 15 states, 13 states have (on average 6.923076923076923) internal successors, (90), 14 states have internal predecessors, (90), 1 states have call successors, (1), 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:41:46,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:41:46,513 INFO L93 Difference]: Finished difference Result 1230 states and 1418 transitions. [2024-11-28 02:41:46,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:41:46,513 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.923076923076923) internal successors, (90), 14 states have internal predecessors, (90), 1 states have call successors, (1), 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 92 [2024-11-28 02:41:46,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:41:46,520 INFO L225 Difference]: With dead ends: 1230 [2024-11-28 02:41:46,520 INFO L226 Difference]: Without dead ends: 1230 [2024-11-28 02:41:46,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-28 02:41:46,524 INFO L435 NwaCegarLoop]: 780 mSDtfsCounter, 1175 mSDsluCounter, 7452 mSDsCounter, 0 mSdLazyCounter, 5751 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 8232 SdHoareTripleChecker+Invalid, 5781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 5751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:41:46,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 8232 Invalid, 5781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 5751 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-28 02:41:46,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2024-11-28 02:41:46,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1226. [2024-11-28 02:41:46,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 833 states have (on average 1.653061224489796) internal successors, (1377), 1215 states have internal predecessors, (1377), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-28 02:41:46,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1410 transitions. [2024-11-28 02:41:46,542 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1410 transitions. Word has length 92 [2024-11-28 02:41:46,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:41:46,542 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1410 transitions. [2024-11-28 02:41:46,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.923076923076923) internal successors, (90), 14 states have internal predecessors, (90), 1 states have call successors, (1), 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:41:46,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1410 transitions. [2024-11-28 02:41:46,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-28 02:41:46,543 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:41:46,543 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] [2024-11-28 02:41:46,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 02:41:46,543 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:41:46,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:41:46,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1388471395, now seen corresponding path program 1 times [2024-11-28 02:41:46,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:41:46,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106954868] [2024-11-28 02:41:46,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:41:46,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:41:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:41:47,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:41:47,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:41:47,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106954868] [2024-11-28 02:41:47,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106954868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:41:47,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:41:47,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 02:41:47,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131938584] [2024-11-28 02:41:47,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:41:47,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 02:41:47,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:41:47,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 02:41:47,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-28 02:41:47,456 INFO L87 Difference]: Start difference. First operand 1226 states and 1410 transitions. Second operand has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (1), 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:41:51,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:41:51,526 INFO L93 Difference]: Finished difference Result 1229 states and 1417 transitions. [2024-11-28 02:41:51,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 02:41:51,527 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (1), 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 92 [2024-11-28 02:41:51,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:41:51,529 INFO L225 Difference]: With dead ends: 1229 [2024-11-28 02:41:51,529 INFO L226 Difference]: Without dead ends: 1229 [2024-11-28 02:41:51,529 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:41:51,530 INFO L435 NwaCegarLoop]: 787 mSDtfsCounter, 1191 mSDsluCounter, 4937 mSDsCounter, 0 mSdLazyCounter, 5704 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 5724 SdHoareTripleChecker+Invalid, 5733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 5704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:41:51,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 5724 Invalid, 5733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 5704 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-28 02:41:51,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2024-11-28 02:41:51,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1226. [2024-11-28 02:41:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 833 states have (on average 1.6518607442977191) internal successors, (1376), 1215 states have internal predecessors, (1376), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-28 02:41:51,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1409 transitions. [2024-11-28 02:41:51,547 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1409 transitions. Word has length 92 [2024-11-28 02:41:51,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:41:51,547 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1409 transitions. [2024-11-28 02:41:51,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (1), 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:41:51,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1409 transitions. [2024-11-28 02:41:51,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-28 02:41:51,548 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:41:51,548 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] [2024-11-28 02:41:51,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 02:41:51,548 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:41:51,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:41:51,549 INFO L85 PathProgramCache]: Analyzing trace with hash 873360143, now seen corresponding path program 1 times [2024-11-28 02:41:51,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:41:51,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924647477] [2024-11-28 02:41:51,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:41:51,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:41:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:41:52,252 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:41:52,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:41:52,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924647477] [2024-11-28 02:41:52,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924647477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:41:52,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649654937] [2024-11-28 02:41:52,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:41:52,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:41:52,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:41:52,256 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:41:52,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 02:41:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:41:52,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-28 02:41:52,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:41:52,548 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:41:52,691 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:41:52,692 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:41:52,702 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:41:52,774 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:41:52,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:41:52,819 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:41:52,819 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:41:52,867 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:41:52,867 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:41:52,882 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:41:52,904 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:41:52,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:41:52,926 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1300) |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:41:52,936 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (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_1300) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-28 02:41:52,954 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1299))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1300)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:41:53,071 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-28 02:41:53,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2024-11-28 02:41:53,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649654937] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:41:53,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:41:53,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 17 [2024-11-28 02:41:53,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618386643] [2024-11-28 02:41:53,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:41:53,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 02:41:53,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:41:53,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 02:41:53,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=312, Unknown=13, NotChecked=114, Total=506 [2024-11-28 02:41:53,136 INFO L87 Difference]: Start difference. First operand 1226 states and 1409 transitions. Second operand has 18 states, 16 states have (on average 8.375) internal successors, (134), 17 states have internal predecessors, (134), 1 states have call successors, (1), 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:41:56,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:41:56,073 INFO L93 Difference]: Finished difference Result 1228 states and 1416 transitions. [2024-11-28 02:41:56,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:41:56,074 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.375) internal successors, (134), 17 states have internal predecessors, (134), 1 states have call successors, (1), 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 93 [2024-11-28 02:41:56,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:41:56,076 INFO L225 Difference]: With dead ends: 1228 [2024-11-28 02:41:56,076 INFO L226 Difference]: Without dead ends: 1228 [2024-11-28 02:41:56,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=621, Unknown=13, NotChecked=162, Total=930 [2024-11-28 02:41:56,077 INFO L435 NwaCegarLoop]: 780 mSDtfsCounter, 1165 mSDsluCounter, 6687 mSDsCounter, 0 mSdLazyCounter, 5213 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 7467 SdHoareTripleChecker+Invalid, 5243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 5213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:41:56,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 7467 Invalid, 5243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 5213 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-28 02:41:56,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2024-11-28 02:41:56,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2024-11-28 02:41:56,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 833 states have (on average 1.6506602641056423) internal successors, (1375), 1214 states have internal predecessors, (1375), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-28 02:41:56,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1408 transitions. [2024-11-28 02:41:56,092 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1408 transitions. Word has length 93 [2024-11-28 02:41:56,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:41:56,092 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1408 transitions. [2024-11-28 02:41:56,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.375) internal successors, (134), 17 states have internal predecessors, (134), 1 states have call successors, (1), 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:41:56,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1408 transitions. [2024-11-28 02:41:56,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-28 02:41:56,093 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:41:56,093 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] [2024-11-28 02:41:56,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 02:41:56,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-28 02:41:56,298 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:41:56,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:41:56,298 INFO L85 PathProgramCache]: Analyzing trace with hash 873360144, now seen corresponding path program 1 times [2024-11-28 02:41:56,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:41:56,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252742699] [2024-11-28 02:41:56,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:41:56,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:41:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:41:57,202 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:41:57,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:41:57,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252742699] [2024-11-28 02:41:57,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252742699] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:41:57,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602361726] [2024-11-28 02:41:57,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:41:57,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:41:57,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:41:57,204 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:41:57,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 02:41:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:41:57,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-28 02:41:57,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:41:57,497 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:41:57,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 02:41:57,609 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:41:57,609 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:41:57,618 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:41:57,624 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:41:57,675 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:41:57,679 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:41:57,810 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:41:57,811 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:41:57,818 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:41:57,888 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:41:57,888 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:41:57,898 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:41:57,971 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:41:57,971 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:41:57,975 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:41:58,002 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:41:58,007 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:41:58,008 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:41:58,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:41:58,076 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1454 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 02:41:58,092 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_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1454 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))) is different from false [2024-11-28 02:41:58,118 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1453) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1452))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1453) .cse1 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-28 02:41:58,140 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1452))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1453) .cse1 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1453) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))) is different from false [2024-11-28 02:41:58,234 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1461))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1452))) (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~mem50#1.base| v_ArrVal_1460) .cse0 v_ArrVal_1453) .cse1 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1461))) (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~mem50#1.base| v_ArrVal_1460) .cse5 v_ArrVal_1453) (select (select (store .cse6 .cse5 v_ArrVal_1452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1454))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))))) is different from false [2024-11-28 02:41:58,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602361726] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:41:58,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:41:58,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 17 [2024-11-28 02:41:58,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72605345] [2024-11-28 02:41:58,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:41:58,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 02:41:58,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:41:58,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 02:41:58,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=321, Unknown=5, NotChecked=200, Total=600 [2024-11-28 02:41:58,239 INFO L87 Difference]: Start difference. First operand 1225 states and 1408 transitions. Second operand has 18 states, 16 states have (on average 8.6875) internal successors, (139), 18 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:42:01,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:42:01,550 INFO L93 Difference]: Finished difference Result 1227 states and 1415 transitions. [2024-11-28 02:42:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:42:01,550 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.6875) internal successors, (139), 18 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 93 [2024-11-28 02:42:01,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:42:01,553 INFO L225 Difference]: With dead ends: 1227 [2024-11-28 02:42:01,553 INFO L226 Difference]: Without dead ends: 1227 [2024-11-28 02:42:01,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=546, Unknown=5, NotChecked=260, Total=930 [2024-11-28 02:42:01,554 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 1166 mSDsluCounter, 4512 mSDsCounter, 0 mSdLazyCounter, 4874 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 5297 SdHoareTripleChecker+Invalid, 4921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 4874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:42:01,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 5297 Invalid, 4921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 4874 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-28 02:42:01,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2024-11-28 02:42:01,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1212. [2024-11-28 02:42:01,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 822 states have (on average 1.6569343065693432) internal successors, (1362), 1202 states have internal predecessors, (1362), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-28 02:42:01,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1394 transitions. [2024-11-28 02:42:01,572 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1394 transitions. Word has length 93 [2024-11-28 02:42:01,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:42:01,573 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1394 transitions. [2024-11-28 02:42:01,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.6875) internal successors, (139), 18 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:42:01,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1394 transitions. [2024-11-28 02:42:01,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-28 02:42:01,574 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:42:01,575 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:42:01,587 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 02:42:01,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-28 02:42:01,775 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:42:01,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:42:01,776 INFO L85 PathProgramCache]: Analyzing trace with hash -878103497, now seen corresponding path program 1 times [2024-11-28 02:42:01,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:42:01,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605779987] [2024-11-28 02:42:01,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:42:01,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:42:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:42:02,419 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:42:02,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:42:02,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605779987] [2024-11-28 02:42:02,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605779987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:42:02,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:42:02,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 02:42:02,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209662691] [2024-11-28 02:42:02,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:42:02,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 02:42:02,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:42:02,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 02:42:02,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-28 02:42:02,422 INFO L87 Difference]: Start difference. First operand 1212 states and 1394 transitions. Second operand has 16 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 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:42:05,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:42:05,759 INFO L93 Difference]: Finished difference Result 1231 states and 1419 transitions. [2024-11-28 02:42:05,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:42:05,760 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 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:42:05,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:42:05,763 INFO L225 Difference]: With dead ends: 1231 [2024-11-28 02:42:05,763 INFO L226 Difference]: Without dead ends: 1231 [2024-11-28 02:42:05,763 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:42:05,764 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 1194 mSDsluCounter, 7446 mSDsCounter, 0 mSdLazyCounter, 5751 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 8225 SdHoareTripleChecker+Invalid, 5781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 5751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:42:05,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 8225 Invalid, 5781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 5751 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-28 02:42:05,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2024-11-28 02:42:05,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1227. [2024-11-28 02:42:05,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 836 states have (on average 1.6483253588516746) internal successors, (1378), 1216 states have internal predecessors, (1378), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-28 02:42:05,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1411 transitions. [2024-11-28 02:42:05,779 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1411 transitions. Word has length 95 [2024-11-28 02:42:05,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:42:05,780 INFO L471 AbstractCegarLoop]: Abstraction has 1227 states and 1411 transitions. [2024-11-28 02:42:05,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 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:42:05,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1411 transitions. [2024-11-28 02:42:05,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-28 02:42:05,781 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:42:05,781 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:42:05,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-28 02:42:05,781 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:42:05,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:42:05,782 INFO L85 PathProgramCache]: Analyzing trace with hash -878103496, now seen corresponding path program 1 times [2024-11-28 02:42:05,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:42:05,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031418732] [2024-11-28 02:42:05,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:42:05,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:42:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:42:06,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:42:06,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:42:06,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031418732] [2024-11-28 02:42:06,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031418732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:42:06,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:42:06,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 02:42:06,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611023203] [2024-11-28 02:42:06,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:42:06,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 02:42:06,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:42:06,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 02:42:06,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-28 02:42:06,657 INFO L87 Difference]: Start difference. First operand 1227 states and 1411 transitions. Second operand has 13 states, 12 states have (on average 7.75) internal successors, (93), 13 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:42:09,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:42:09,393 INFO L93 Difference]: Finished difference Result 1230 states and 1418 transitions. [2024-11-28 02:42:09,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 02:42:09,393 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.75) internal successors, (93), 13 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:42:09,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:42:09,397 INFO L225 Difference]: With dead ends: 1230 [2024-11-28 02:42:09,397 INFO L226 Difference]: Without dead ends: 1230 [2024-11-28 02:42:09,397 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:42:09,398 INFO L435 NwaCegarLoop]: 786 mSDtfsCounter, 1175 mSDsluCounter, 3232 mSDsCounter, 0 mSdLazyCounter, 3635 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 4018 SdHoareTripleChecker+Invalid, 3664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 3635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:42:09,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 4018 Invalid, 3664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 3635 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-28 02:42:09,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2024-11-28 02:42:09,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1227. [2024-11-28 02:42:09,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 836 states have (on average 1.6471291866028708) internal successors, (1377), 1216 states have internal predecessors, (1377), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-28 02:42:09,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1410 transitions. [2024-11-28 02:42:09,420 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1410 transitions. Word has length 95 [2024-11-28 02:42:09,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:42:09,421 INFO L471 AbstractCegarLoop]: Abstraction has 1227 states and 1410 transitions. [2024-11-28 02:42:09,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.75) internal successors, (93), 13 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:42:09,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1410 transitions. [2024-11-28 02:42:09,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-28 02:42:09,422 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:42:09,422 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:42:09,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 02:42:09,423 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:42:09,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:42:09,423 INFO L85 PathProgramCache]: Analyzing trace with hash -639233430, now seen corresponding path program 1 times [2024-11-28 02:42:09,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:42:09,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518536258] [2024-11-28 02:42:09,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:42:09,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:42:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:42:10,225 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:42:10,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:42:10,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518536258] [2024-11-28 02:42:10,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518536258] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:42:10,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712436856] [2024-11-28 02:42:10,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:42:10,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:42:10,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:42:10,228 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:42:10,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 02:42:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:42:10,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-28 02:42:10,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:42:10,556 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:42:10,697 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:42:10,697 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:42:10,707 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:42:10,813 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:42:10,813 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:42:10,868 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:42:10,868 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:42:10,921 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:42:10,921 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:42:10,975 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:42:10,975 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:42:10,991 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:42:10,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:42:10,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:42:11,103 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1759))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:42:15,249 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1758))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1759)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:42:15,262 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (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| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1758))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1759)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:42:15,331 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-28 02:42:15,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 104 [2024-11-28 02:42:15,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712436856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:42:15,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:42:15,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 21 [2024-11-28 02:42:15,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480006258] [2024-11-28 02:42:15,422 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:42:15,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 02:42:15,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:42:15,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 02:42:15,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=534, Unknown=31, NotChecked=150, Total=812 [2024-11-28 02:42:15,425 INFO L87 Difference]: Start difference. First operand 1227 states and 1410 transitions. Second operand has 22 states, 19 states have (on average 7.684210526315789) internal successors, (146), 22 states have internal predecessors, (146), 2 states have call successors, (2), 1 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:42:22,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:42:22,170 INFO L93 Difference]: Finished difference Result 1229 states and 1417 transitions. [2024-11-28 02:42:22,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 02:42:22,170 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.684210526315789) internal successors, (146), 22 states have internal predecessors, (146), 2 states have call successors, (2), 1 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:42:22,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:42:22,172 INFO L225 Difference]: With dead ends: 1229 [2024-11-28 02:42:22,172 INFO L226 Difference]: Without dead ends: 1229 [2024-11-28 02:42:22,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=184, Invalid=987, Unknown=31, NotChecked=204, Total=1406 [2024-11-28 02:42:22,174 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 1167 mSDsluCounter, 8140 mSDsCounter, 0 mSdLazyCounter, 6269 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 8919 SdHoareTripleChecker+Invalid, 6315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 6269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:42:22,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 8919 Invalid, 6315 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [46 Valid, 6269 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-28 02:42:22,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2024-11-28 02:42:22,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1226. [2024-11-28 02:42:22,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 836 states have (on average 1.645933014354067) internal successors, (1376), 1215 states have internal predecessors, (1376), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-28 02:42:22,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1409 transitions. [2024-11-28 02:42:22,206 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1409 transitions. Word has length 96 [2024-11-28 02:42:22,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:42:22,207 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1409 transitions. [2024-11-28 02:42:22,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.684210526315789) internal successors, (146), 22 states have internal predecessors, (146), 2 states have call successors, (2), 1 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:42:22,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1409 transitions. [2024-11-28 02:42:22,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-28 02:42:22,208 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:42:22,208 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:42:22,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-28 02:42:22,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-28 02:42:22,408 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:42:22,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:42:22,409 INFO L85 PathProgramCache]: Analyzing trace with hash -639233429, now seen corresponding path program 1 times [2024-11-28 02:42:22,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:42:22,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501759512] [2024-11-28 02:42:22,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:42:22,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:42:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:42:23,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:42:23,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:42:23,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501759512] [2024-11-28 02:42:23,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501759512] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:42:23,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823326938] [2024-11-28 02:42:23,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:42:23,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:42:23,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:42:23,614 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:42:23,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 02:42:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:42:23,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-28 02:42:23,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:42:23,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:42:24,097 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:42:24,107 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:42:24,107 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:42:24,117 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:42:24,124 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:42:24,194 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:42:24,198 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:42:24,377 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:42:24,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:42:24,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:42:24,491 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:42:24,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:42:24,500 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:42:24,595 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:42:24,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:42:24,601 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:42:24,707 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:42:24,707 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:42:24,713 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:42:24,743 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:42:24,754 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:42:24,759 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:42:24,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:42:24,871 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1929 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1929) |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~mem54#1.base| v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 02:42:24,990 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1926))) (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~mem53#1.base| v_ArrVal_1927) .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1927) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-11-28 02:42:25,016 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1926))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1927) .cse1 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1927) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2024-11-28 02:42:25,072 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1925))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1924) .cse0 v_ArrVal_1927) (select (select (store .cse1 .cse0 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1929))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1925))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1926))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1924) .cse3 v_ArrVal_1927) .cse4 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-28 02:42:25,098 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_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1925))) (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_1924) .cse1 v_ArrVal_1927) (select (select (store .cse2 .cse1 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1929))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1925))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_1926))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1924) .cse4 v_ArrVal_1927) .cse5 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2024-11-28 02:42:25,231 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1935 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1934))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_1925))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1935) .cse0 v_ArrVal_1924) .cse1 v_ArrVal_1927) (select (select (store .cse2 .cse1 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1929))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1935 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1934))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1925))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1926))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1935) .cse5 v_ArrVal_1924) .cse6 v_ArrVal_1927) .cse7 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-28 02:42:25,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823326938] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:42:25,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:42:25,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 19 [2024-11-28 02:42:25,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981773264] [2024-11-28 02:42:25,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:42:25,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 02:42:25,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:42:25,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 02:42:25,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=420, Unknown=14, NotChecked=282, Total=812 [2024-11-28 02:42:25,239 INFO L87 Difference]: Start difference. First operand 1226 states and 1409 transitions. Second operand has 20 states, 18 states have (on average 8.0) internal successors, (144), 20 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:42:35,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:42:35,832 INFO L93 Difference]: Finished difference Result 1228 states and 1416 transitions. [2024-11-28 02:42:35,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:42:35,832 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 8.0) internal successors, (144), 20 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2024-11-28 02:42:35,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:42:35,834 INFO L225 Difference]: With dead ends: 1228 [2024-11-28 02:42:35,834 INFO L226 Difference]: Without dead ends: 1228 [2024-11-28 02:42:35,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=156, Invalid=724, Unknown=14, NotChecked=366, Total=1260 [2024-11-28 02:42:35,835 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 1160 mSDsluCounter, 8104 mSDsCounter, 0 mSdLazyCounter, 8788 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 8888 SdHoareTripleChecker+Invalid, 8819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 8788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:42:35,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 8888 Invalid, 8819 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [31 Valid, 8788 Invalid, 0 Unknown, 0 Unchecked, 10.1s Time] [2024-11-28 02:42:35,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2024-11-28 02:42:35,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1210. [2024-11-28 02:42:35,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 822 states have (on average 1.6545012165450121) internal successors, (1360), 1200 states have internal predecessors, (1360), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-28 02:42:35,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1392 transitions. [2024-11-28 02:42:35,852 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1392 transitions. Word has length 96 [2024-11-28 02:42:35,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:42:35,852 INFO L471 AbstractCegarLoop]: Abstraction has 1210 states and 1392 transitions. [2024-11-28 02:42:35,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 8.0) internal successors, (144), 20 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:42:35,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1392 transitions. [2024-11-28 02:42:35,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-28 02:42:35,853 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:42:35,853 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:42:35,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 02:42:36,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-28 02:42:36,054 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:42:36,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:42:36,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1339982791, now seen corresponding path program 1 times [2024-11-28 02:42:36,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:42:36,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929647230] [2024-11-28 02:42:36,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:42:36,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:42:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:42:37,137 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:42:37,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:42:37,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929647230] [2024-11-28 02:42:37,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929647230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:42:37,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:42:37,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 02:42:37,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874909811] [2024-11-28 02:42:37,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:42:37,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 02:42:37,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:42:37,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 02:42:37,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-28 02:42:37,139 INFO L87 Difference]: Start difference. First operand 1210 states and 1392 transitions. Second operand has 14 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 1 states have call successors, (1), 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:42:41,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:42:41,157 INFO L93 Difference]: Finished difference Result 1233 states and 1421 transitions. [2024-11-28 02:42:41,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 02:42:41,157 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-11-28 02:42:41,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:42:41,160 INFO L225 Difference]: With dead ends: 1233 [2024-11-28 02:42:41,161 INFO L226 Difference]: Without dead ends: 1233 [2024-11-28 02:42:41,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2024-11-28 02:42:41,162 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 1197 mSDsluCounter, 4450 mSDsCounter, 0 mSdLazyCounter, 3690 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 5234 SdHoareTripleChecker+Invalid, 3722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:42:41,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 5234 Invalid, 3722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3690 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-28 02:42:41,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2024-11-28 02:42:41,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1229. [2024-11-28 02:42:41,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 840 states have (on average 1.6428571428571428) internal successors, (1380), 1218 states have internal predecessors, (1380), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-28 02:42:41,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1413 transitions. [2024-11-28 02:42:41,185 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1413 transitions. Word has length 99 [2024-11-28 02:42:41,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:42:41,185 INFO L471 AbstractCegarLoop]: Abstraction has 1229 states and 1413 transitions. [2024-11-28 02:42:41,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 1 states have call successors, (1), 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:42:41,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1413 transitions. [2024-11-28 02:42:41,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-28 02:42:41,186 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:42:41,186 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:42:41,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-28 02:42:41,187 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:42:41,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:42:41,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1339982790, now seen corresponding path program 1 times [2024-11-28 02:42:41,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:42:41,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982387571] [2024-11-28 02:42:41,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:42:41,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:42:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:42:42,530 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:42:42,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:42:42,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982387571] [2024-11-28 02:42:42,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982387571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:42:42,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:42:42,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 02:42:42,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696247661] [2024-11-28 02:42:42,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:42:42,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 02:42:42,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:42:42,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 02:42:42,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-28 02:42:42,532 INFO L87 Difference]: Start difference. First operand 1229 states and 1413 transitions. Second operand has 18 states, 16 states have (on average 6.0625) internal successors, (97), 17 states have internal predecessors, (97), 1 states have call successors, (1), 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:42:50,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:42:50,869 INFO L93 Difference]: Finished difference Result 1232 states and 1420 transitions. [2024-11-28 02:42:50,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 02:42:50,870 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.0625) internal successors, (97), 17 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-11-28 02:42:50,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:42:50,872 INFO L225 Difference]: With dead ends: 1232 [2024-11-28 02:42:50,873 INFO L226 Difference]: Without dead ends: 1232 [2024-11-28 02:42:50,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-28 02:42:50,874 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 1194 mSDsluCounter, 6203 mSDsCounter, 0 mSdLazyCounter, 6993 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 6982 SdHoareTripleChecker+Invalid, 7027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 6993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:42:50,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 6982 Invalid, 7027 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [34 Valid, 6993 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2024-11-28 02:42:50,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2024-11-28 02:42:50,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1229. [2024-11-28 02:42:50,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 840 states have (on average 1.6416666666666666) internal successors, (1379), 1218 states have internal predecessors, (1379), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-28 02:42:50,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1412 transitions. [2024-11-28 02:42:50,891 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1412 transitions. Word has length 99 [2024-11-28 02:42:50,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:42:50,891 INFO L471 AbstractCegarLoop]: Abstraction has 1229 states and 1412 transitions. [2024-11-28 02:42:50,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.0625) internal successors, (97), 17 states have internal predecessors, (97), 1 states have call successors, (1), 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:42:50,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1412 transitions. [2024-11-28 02:42:50,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-28 02:42:50,892 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:42:50,893 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] [2024-11-28 02:42:50,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-28 02:42:50,893 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:42:50,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:42:50,894 INFO L85 PathProgramCache]: Analyzing trace with hash 2072905964, now seen corresponding path program 1 times [2024-11-28 02:42:50,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:42:50,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710393661] [2024-11-28 02:42:50,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:42:50,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:42:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:42:52,213 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:42:52,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:42:52,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710393661] [2024-11-28 02:42:52,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710393661] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:42:52,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719491460] [2024-11-28 02:42:52,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:42:52,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:42:52,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:42:52,216 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:42:52,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 02:42:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:42:52,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-28 02:42:52,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:42:52,586 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:42:52,760 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:42:52,760 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:42:52,768 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:42:52,951 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:42:52,951 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:42:53,032 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:42:53,032 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:42:53,119 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:42:53,119 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:42:53,209 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:42:53,209 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:42:53,299 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:42:53,300 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:42:53,319 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:42:53,364 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 02:42:53,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-28 02:42:53,369 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:42:53,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:42:54,608 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-28 02:42:54,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 794 [2024-11-28 02:42:54,634 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2265 (Array Int Int)) (v_ArrVal_2264 (Array Int Int)) (v_ArrVal_2271 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2271))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2264)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2265)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2266)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2267)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-28 02:42:54,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719491460] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:42:54,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:42:54,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 23 [2024-11-28 02:42:54,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398374092] [2024-11-28 02:42:54,637 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:42:54,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 02:42:54,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:42:54,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 02:42:54,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=932, Unknown=45, NotChecked=64, Total=1190 [2024-11-28 02:42:54,639 INFO L87 Difference]: Start difference. First operand 1229 states and 1412 transitions. Second operand has 24 states, 21 states have (on average 7.238095238095238) internal successors, (152), 24 states have internal predecessors, (152), 2 states have call successors, (2), 1 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:43:01,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:43:01,379 INFO L93 Difference]: Finished difference Result 1231 states and 1419 transitions. [2024-11-28 02:43:01,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 02:43:01,379 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.238095238095238) internal successors, (152), 24 states have internal predecessors, (152), 2 states have call successors, (2), 1 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 100 [2024-11-28 02:43:01,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:43:01,381 INFO L225 Difference]: With dead ends: 1231 [2024-11-28 02:43:01,382 INFO L226 Difference]: Without dead ends: 1231 [2024-11-28 02:43:01,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=271, Invalid=1580, Unknown=45, NotChecked=84, Total=1980 [2024-11-28 02:43:01,383 INFO L435 NwaCegarLoop]: 778 mSDtfsCounter, 1162 mSDsluCounter, 8181 mSDsCounter, 0 mSdLazyCounter, 6231 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 8959 SdHoareTripleChecker+Invalid, 6263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 6231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:43:01,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 8959 Invalid, 6263 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [32 Valid, 6231 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-28 02:43:01,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2024-11-28 02:43:01,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1228. [2024-11-28 02:43:01,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 840 states have (on average 1.6404761904761904) internal successors, (1378), 1217 states have internal predecessors, (1378), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-28 02:43:01,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1411 transitions. [2024-11-28 02:43:01,403 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1411 transitions. Word has length 100 [2024-11-28 02:43:01,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:43:01,403 INFO L471 AbstractCegarLoop]: Abstraction has 1228 states and 1411 transitions. [2024-11-28 02:43:01,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.238095238095238) internal successors, (152), 24 states have internal predecessors, (152), 2 states have call successors, (2), 1 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:43:01,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1411 transitions. [2024-11-28 02:43:01,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-28 02:43:01,404 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:43:01,404 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] [2024-11-28 02:43:01,411 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 02:43:01,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:43:01,604 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:43:01,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:43:01,605 INFO L85 PathProgramCache]: Analyzing trace with hash 2072905965, now seen corresponding path program 1 times [2024-11-28 02:43:01,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:43:01,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358195174] [2024-11-28 02:43:01,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:43:01,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:43:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:43:03,128 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:43:03,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:43:03,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358195174] [2024-11-28 02:43:03,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358195174] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:43:03,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186263899] [2024-11-28 02:43:03,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:43:03,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:43:03,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:43:03,131 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:43:03,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 02:43:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:43:03,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-28 02:43:03,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:43:03,481 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:43:03,728 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:43:03,729 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:43:03,746 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:43:03,807 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:43:03,813 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:43:04,018 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:43:04,023 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:43:04,360 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:43:04,361 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:43:04,373 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:43:04,564 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:43:04,565 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:43:04,571 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:43:04,712 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:43:04,712 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:43:04,726 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:43:04,866 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:43:04,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 73 treesize of output 66 [2024-11-28 02:43:04,875 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:43:05,031 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:43:05,031 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:43:05,040 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:43:05,081 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:43:05,090 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:43:05,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:43:05,183 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:43:05,207 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-28 02:43:05,207 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:43:05,261 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:43:05,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:43:05,963 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0))) (forall ((v_ArrVal_2456 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (v_ArrVal_2453 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2454) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 1)))) (forall ((v_ArrVal_2456 (Array Int Int)) (v_ArrVal_2455 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2453 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)) (forall ((v_ArrVal_2457 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2453))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2454) .cse1 v_ArrVal_2456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2457) (select (select (store .cse2 .cse1 v_ArrVal_2455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))))) is different from false [2024-11-28 02:43:26,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186263899] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:43:26,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:43:26,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2024-11-28 02:43:26,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834051932] [2024-11-28 02:43:26,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:43:26,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-28 02:43:26,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:43:26,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-28 02:43:26,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1409, Unknown=54, NotChecked=78, Total=1722 [2024-11-28 02:43:26,800 INFO L87 Difference]: Start difference. First operand 1228 states and 1411 transitions. Second operand has 30 states, 27 states have (on average 6.0) internal successors, (162), 29 states have internal predecessors, (162), 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:45:17,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:45:17,548 INFO L93 Difference]: Finished difference Result 1230 states and 1418 transitions. [2024-11-28 02:45:17,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 02:45:17,548 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 6.0) internal successors, (162), 29 states have internal predecessors, (162), 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 100 [2024-11-28 02:45:17,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:45:17,551 INFO L225 Difference]: With dead ends: 1230 [2024-11-28 02:45:17,551 INFO L226 Difference]: Without dead ends: 1230 [2024-11-28 02:45:17,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 24.6s TimeCoverageRelationStatistics Valid=308, Invalid=2192, Unknown=54, NotChecked=98, Total=2652 [2024-11-28 02:45:17,553 INFO L435 NwaCegarLoop]: 777 mSDtfsCounter, 1147 mSDsluCounter, 13015 mSDsCounter, 0 mSdLazyCounter, 15216 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 105.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 13792 SdHoareTripleChecker+Invalid, 15253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 15216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 107.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:45:17,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 13792 Invalid, 15253 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [37 Valid, 15216 Invalid, 0 Unknown, 0 Unchecked, 107.6s Time] [2024-11-28 02:45:17,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2024-11-28 02:45:17,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1208. [2024-11-28 02:45:17,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 822 states have (on average 1.6520681265206814) internal successors, (1358), 1198 states have internal predecessors, (1358), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-28 02:45:17,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1390 transitions. [2024-11-28 02:45:17,570 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1390 transitions. Word has length 100 [2024-11-28 02:45:17,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:45:17,571 INFO L471 AbstractCegarLoop]: Abstraction has 1208 states and 1390 transitions. [2024-11-28 02:45:17,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 6.0) internal successors, (162), 29 states have internal predecessors, (162), 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:45:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1390 transitions. [2024-11-28 02:45:17,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-28 02:45:17,572 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:45:17,572 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:45:17,585 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-28 02:45:17,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:45:17,773 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:45:17,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:45:17,774 INFO L85 PathProgramCache]: Analyzing trace with hash -2000637137, now seen corresponding path program 1 times [2024-11-28 02:45:17,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:45:17,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900374323] [2024-11-28 02:45:17,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:45:17,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:45:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:45:19,828 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:45:19,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:45:19,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900374323] [2024-11-28 02:45:19,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900374323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:45:19,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:45:19,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 02:45:19,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138700229] [2024-11-28 02:45:19,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:45:19,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 02:45:19,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:45:19,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 02:45:19,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-28 02:45:19,830 INFO L87 Difference]: Start difference. First operand 1208 states and 1390 transitions. Second operand has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 15 states have internal predecessors, (100), 1 states have call successors, (1), 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:46:01,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:46:01,108 INFO L93 Difference]: Finished difference Result 1234 states and 1422 transitions. [2024-11-28 02:46:01,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:46:01,109 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 15 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2024-11-28 02:46:01,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:46:01,112 INFO L225 Difference]: With dead ends: 1234 [2024-11-28 02:46:01,113 INFO L226 Difference]: Without dead ends: 1234 [2024-11-28 02:46:01,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2024-11-28 02:46:01,113 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 1197 mSDsluCounter, 8230 mSDsCounter, 0 mSdLazyCounter, 6164 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 9013 SdHoareTripleChecker+Invalid, 6194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 6164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:46:01,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 9013 Invalid, 6194 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 6164 Invalid, 0 Unknown, 0 Unchecked, 40.1s Time] [2024-11-28 02:46:01,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2024-11-28 02:46:01,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1230. [2024-11-28 02:46:01,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 843 states have (on average 1.638196915776987) internal successors, (1381), 1219 states have internal predecessors, (1381), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-28 02:46:01,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1414 transitions. [2024-11-28 02:46:01,131 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1414 transitions. Word has length 102 [2024-11-28 02:46:01,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:46:01,131 INFO L471 AbstractCegarLoop]: Abstraction has 1230 states and 1414 transitions. [2024-11-28 02:46:01,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 15 states have internal predecessors, (100), 1 states have call successors, (1), 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:46:01,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1414 transitions. [2024-11-28 02:46:01,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-28 02:46:01,133 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:46:01,133 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:46:01,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-28 02:46:01,133 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:46:01,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:46:01,134 INFO L85 PathProgramCache]: Analyzing trace with hash -2000637136, now seen corresponding path program 1 times [2024-11-28 02:46:01,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:46:01,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901133707] [2024-11-28 02:46:01,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:46:01,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:46:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:46:05,450 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:46:05,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:46:05,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901133707] [2024-11-28 02:46:05,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901133707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:46:05,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:46:05,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 02:46:05,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7343977] [2024-11-28 02:46:05,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:46:05,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 02:46:05,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:46:05,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 02:46:05,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-28 02:46:05,452 INFO L87 Difference]: Start difference. First operand 1230 states and 1414 transitions. Second operand has 19 states, 17 states have (on average 5.882352941176471) internal successors, (100), 18 states have internal predecessors, (100), 1 states have call successors, (1), 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:46:48,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:46:48,803 INFO L93 Difference]: Finished difference Result 1233 states and 1421 transitions. [2024-11-28 02:46:48,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 02:46:48,803 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.882352941176471) internal successors, (100), 18 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2024-11-28 02:46:48,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:46:48,806 INFO L225 Difference]: With dead ends: 1233 [2024-11-28 02:46:48,806 INFO L226 Difference]: Without dead ends: 1233 [2024-11-28 02:46:48,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-11-28 02:46:48,807 INFO L435 NwaCegarLoop]: 778 mSDtfsCounter, 1178 mSDsluCounter, 5608 mSDsCounter, 0 mSdLazyCounter, 6341 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 6386 SdHoareTripleChecker+Invalid, 6374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 6341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:46:48,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 6386 Invalid, 6374 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [33 Valid, 6341 Invalid, 0 Unknown, 0 Unchecked, 41.5s Time] [2024-11-28 02:46:48,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2024-11-28 02:46:48,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1230. [2024-11-28 02:46:48,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 843 states have (on average 1.6370106761565837) internal successors, (1380), 1219 states have internal predecessors, (1380), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-28 02:46:48,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1413 transitions. [2024-11-28 02:46:48,818 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1413 transitions. Word has length 102 [2024-11-28 02:46:48,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:46:48,818 INFO L471 AbstractCegarLoop]: Abstraction has 1230 states and 1413 transitions. [2024-11-28 02:46:48,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.882352941176471) internal successors, (100), 18 states have internal predecessors, (100), 1 states have call successors, (1), 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:46:48,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1413 transitions. [2024-11-28 02:46:48,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-28 02:46:48,819 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:46:48,819 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] [2024-11-28 02:46:48,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-28 02:46:48,819 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:46:48,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:46:48,820 INFO L85 PathProgramCache]: Analyzing trace with hash 902432156, now seen corresponding path program 1 times [2024-11-28 02:46:48,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:46:48,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771619708] [2024-11-28 02:46:48,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:46:48,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:46:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:46:49,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:46:49,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:46:49,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771619708] [2024-11-28 02:46:49,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771619708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:46:49,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:46:49,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:46:49,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9311573] [2024-11-28 02:46:49,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:46:49,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:46:49,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:46:49,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:46:49,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:46:49,652 INFO L87 Difference]: Start difference. First operand 1230 states and 1413 transitions. Second operand has 6 states, 5 states have (on average 20.2) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:46:57,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:46:57,821 INFO L93 Difference]: Finished difference Result 1229 states and 1412 transitions. [2024-11-28 02:46:57,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:46:57,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.2) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2024-11-28 02:46:57,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:46:57,824 INFO L225 Difference]: With dead ends: 1229 [2024-11-28 02:46:57,824 INFO L226 Difference]: Without dead ends: 1229 [2024-11-28 02:46:57,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:46:57,825 INFO L435 NwaCegarLoop]: 1259 mSDtfsCounter, 2 mSDsluCounter, 2604 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3863 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:46:57,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3863 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2024-11-28 02:46:57,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2024-11-28 02:46:57,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1229. [2024-11-28 02:46:57,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 843 states have (on average 1.6358244365361803) internal successors, (1379), 1218 states have internal predecessors, (1379), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-28 02:46:57,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1412 transitions. [2024-11-28 02:46:57,843 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1412 transitions. Word has length 103 [2024-11-28 02:46:57,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:46:57,843 INFO L471 AbstractCegarLoop]: Abstraction has 1229 states and 1412 transitions. [2024-11-28 02:46:57,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.2) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:46:57,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1412 transitions. [2024-11-28 02:46:57,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-28 02:46:57,844 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:46:57,844 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] [2024-11-28 02:46:57,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-28 02:46:57,845 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:46:57,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:46:57,845 INFO L85 PathProgramCache]: Analyzing trace with hash 902432157, now seen corresponding path program 1 times [2024-11-28 02:46:57,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:46:57,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629864682] [2024-11-28 02:46:57,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:46:57,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:46:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:02,296 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:47:02,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:02,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629864682] [2024-11-28 02:47:02,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629864682] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:47:02,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516398971] [2024-11-28 02:47:02,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:02,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:47:02,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:47:02,299 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:47:02,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 02:47:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:02,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-28 02:47:02,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:47:02,709 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:47:03,731 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:47:03,731 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:47:03,769 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:47:03,991 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:47:04,020 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:47:04,654 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:47:04,669 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:47:05,819 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:47:05,819 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:47:05,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:47:06,842 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:47:06,842 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:47:06,859 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:47:07,468 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:47:07,469 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:47:07,486 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:47:08,108 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:47:08,108 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:47:08,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:47:08,759 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:47:08,759 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:47:08,775 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:47:09,406 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-28 02:47:09,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-28 02:47:09,532 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-28 02:47:09,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2024-11-28 02:47:09,966 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:47:09,966 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:47:09,981 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:47:10,081 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:47:10,097 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:47:10,359 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:47:10,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:48:15,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:48:15,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1180 treesize of output 1198 [2024-11-28 02:48:21,111 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_32 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_38 (Array Int Int)) (v_prenex_37 (Array Int Int))) (< 0 (+ 41 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_37))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_prenex_30))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_prenex_28))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_prenex_38))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_35) .cse0 v_prenex_29) .cse1 v_prenex_27) .cse2 v_prenex_36) .cse3 v_prenex_33) (select (select (store .cse4 .cse3 v_prenex_34) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_32))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))) (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int)) (v_ArrVal_2910 (Array Int Int)) (v_ArrVal_2920 (Array Int Int)) (v_ArrVal_2918 Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int) (v_ArrVal_2919 (Array Int Int)) (v_ArrVal_2917 (Array Int Int)) (v_ArrVal_2916 (Array Int Int)) (v_ArrVal_2926 (Array Int Int)) (v_ArrVal_2915 (Array Int Int)) (v_ArrVal_2925 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc57#1.base_9| |c_ULTIMATE.start_main_#t~mem50#1.base|) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2925))) (let ((.cse9 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse9 v_ArrVal_2910))) (let ((.cse10 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse10 v_ArrVal_2912))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_2914))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_2916))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< (+ (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2926) .cse9 v_ArrVal_2911) .cse10 v_ArrVal_2913) .cse11 v_ArrVal_2915) .cse12 v_ArrVal_2917) .cse13 v_ArrVal_2919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2918) (select (select (store .cse14 .cse13 v_ArrVal_2920) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))))))))))) is different from false [2024-11-28 02:48:21,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516398971] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:48:21,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:48:21,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2024-11-28 02:48:21,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501017463] [2024-11-28 02:48:21,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:48:21,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-28 02:48:21,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:48:21,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-28 02:48:21,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1816, Unknown=93, NotChecked=90, Total=2256 [2024-11-28 02:48:21,164 INFO L87 Difference]: Start difference. First operand 1229 states and 1412 transitions. Second operand has 34 states, 31 states have (on average 5.419354838709677) internal successors, (168), 32 states have internal predecessors, (168), 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:50:13,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:50:13,962 INFO L93 Difference]: Finished difference Result 1231 states and 1419 transitions. [2024-11-28 02:50:13,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-28 02:50:13,963 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 5.419354838709677) internal successors, (168), 32 states have internal predecessors, (168), 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 103 [2024-11-28 02:50:13,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:50:13,966 INFO L225 Difference]: With dead ends: 1231 [2024-11-28 02:50:13,966 INFO L226 Difference]: Without dead ends: 1231 [2024-11-28 02:50:13,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 79.9s TimeCoverageRelationStatistics Valid=430, Invalid=2786, Unknown=94, NotChecked=112, Total=3422 [2024-11-28 02:50:13,967 INFO L435 NwaCegarLoop]: 776 mSDtfsCounter, 1162 mSDsluCounter, 7384 mSDsCounter, 0 mSdLazyCounter, 8358 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 105.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 8160 SdHoareTripleChecker+Invalid, 8396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 8358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 106.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:50:13,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 8160 Invalid, 8396 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [38 Valid, 8358 Invalid, 0 Unknown, 0 Unchecked, 106.6s Time] [2024-11-28 02:50:13,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2024-11-28 02:50:13,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1206. [2024-11-28 02:50:13,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 822 states have (on average 1.6496350364963503) internal successors, (1356), 1196 states have internal predecessors, (1356), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-28 02:50:13,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1388 transitions. [2024-11-28 02:50:13,980 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1388 transitions. Word has length 103 [2024-11-28 02:50:13,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:50:13,980 INFO L471 AbstractCegarLoop]: Abstraction has 1206 states and 1388 transitions. [2024-11-28 02:50:13,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 5.419354838709677) internal successors, (168), 32 states have internal predecessors, (168), 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:50:13,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1388 transitions. [2024-11-28 02:50:13,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-28 02:50:13,981 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:50:13,981 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:50:13,990 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 02:50:14,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-28 02:50:14,182 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:50:14,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:50:14,182 INFO L85 PathProgramCache]: Analyzing trace with hash 280865697, now seen corresponding path program 1 times [2024-11-28 02:50:14,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:50:14,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817081324] [2024-11-28 02:50:14,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:50:14,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:50:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:50:19,135 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:50:19,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:50:19,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817081324] [2024-11-28 02:50:19,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817081324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:50:19,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:50:19,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 02:50:19,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576922340] [2024-11-28 02:50:19,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:50:19,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 02:50:19,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:50:19,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 02:50:19,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-28 02:50:19,137 INFO L87 Difference]: Start difference. First operand 1206 states and 1388 transitions. Second operand has 16 states, 15 states have (on average 6.866666666666666) internal successors, (103), 16 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:51:52,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:51:52,424 INFO L93 Difference]: Finished difference Result 1257 states and 1447 transitions. [2024-11-28 02:51:52,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:51:52,425 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.866666666666666) internal successors, (103), 16 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2024-11-28 02:51:52,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:51:52,427 INFO L225 Difference]: With dead ends: 1257 [2024-11-28 02:51:52,427 INFO L226 Difference]: Without dead ends: 1257 [2024-11-28 02:51:52,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2024-11-28 02:51:52,428 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 1229 mSDsluCounter, 8648 mSDsCounter, 0 mSdLazyCounter, 7172 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 89.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1249 SdHoareTripleChecker+Valid, 9433 SdHoareTripleChecker+Invalid, 7205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 7172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 90.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:51:52,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1249 Valid, 9433 Invalid, 7205 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [33 Valid, 7172 Invalid, 0 Unknown, 0 Unchecked, 90.6s Time] [2024-11-28 02:51:52,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2024-11-28 02:51:52,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1231. [2024-11-28 02:51:52,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 846 states have (on average 1.6335697399527187) internal successors, (1382), 1220 states have internal predecessors, (1382), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-28 02:51:52,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1415 transitions. [2024-11-28 02:51:52,444 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1415 transitions. Word has length 105 [2024-11-28 02:51:52,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:51:52,444 INFO L471 AbstractCegarLoop]: Abstraction has 1231 states and 1415 transitions. [2024-11-28 02:51:52,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.866666666666666) internal successors, (103), 16 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:51:52,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1415 transitions. [2024-11-28 02:51:52,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-28 02:51:52,446 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:51:52,446 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:51:52,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-28 02:51:52,446 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:51:52,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:51:52,447 INFO L85 PathProgramCache]: Analyzing trace with hash 280865696, now seen corresponding path program 1 times [2024-11-28 02:51:52,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:51:52,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042459384] [2024-11-28 02:51:52,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:52,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:51:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:51:57,169 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:51:57,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:51:57,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042459384] [2024-11-28 02:51:57,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042459384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:51:57,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:51:57,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-28 02:51:57,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662007635] [2024-11-28 02:51:57,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:51:57,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 02:51:57,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:51:57,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 02:51:57,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-11-28 02:51:57,171 INFO L87 Difference]: Start difference. First operand 1231 states and 1415 transitions. Second operand has 17 states, 16 states have (on average 6.4375) internal successors, (103), 17 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:52:48,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:52:48,908 INFO L93 Difference]: Finished difference Result 1256 states and 1446 transitions. [2024-11-28 02:52:48,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:52:48,908 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.4375) internal successors, (103), 17 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2024-11-28 02:52:48,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:52:48,911 INFO L225 Difference]: With dead ends: 1256 [2024-11-28 02:52:48,911 INFO L226 Difference]: Without dead ends: 1256 [2024-11-28 02:52:48,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2024-11-28 02:52:48,912 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 1269 mSDsluCounter, 4590 mSDsCounter, 0 mSdLazyCounter, 3798 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 5380 SdHoareTripleChecker+Invalid, 3833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:52:48,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 5380 Invalid, 3833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3798 Invalid, 0 Unknown, 0 Unchecked, 49.1s Time] [2024-11-28 02:52:48,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2024-11-28 02:52:48,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1231. [2024-11-28 02:52:48,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 846 states have (on average 1.632387706855792) internal successors, (1381), 1220 states have internal predecessors, (1381), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-28 02:52:48,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1414 transitions. [2024-11-28 02:52:48,934 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1414 transitions. Word has length 105 [2024-11-28 02:52:48,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:52:48,934 INFO L471 AbstractCegarLoop]: Abstraction has 1231 states and 1414 transitions. [2024-11-28 02:52:48,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.4375) internal successors, (103), 17 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:52:48,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1414 transitions. [2024-11-28 02:52:48,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-28 02:52:48,935 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:52:48,935 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] [2024-11-28 02:52:48,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-28 02:52:48,936 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-28 02:52:48,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:52:48,936 INFO L85 PathProgramCache]: Analyzing trace with hash -2138266092, now seen corresponding path program 1 times [2024-11-28 02:52:48,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:52:48,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726230351] [2024-11-28 02:52:48,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:52:48,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:52:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:52:54,619 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:52:54,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:52:54,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726230351] [2024-11-28 02:52:54,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726230351] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:52:54,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131125379] [2024-11-28 02:52:54,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:52:54,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:52:54,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:52:54,622 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:52:54,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2741b7d-2b91-49dc-b98b-649b6ed05b00/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 02:52:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:52:55,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-28 02:52:55,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:52:55,038 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:52:56,821 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:52:56,822 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:52:57,236 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:52:57,262 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:52:58,636 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:52:58,637 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:52:58,663 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:52:59,387 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:52:59,387 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:52:59,413 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:53:00,185 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:53:00,185 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:53:00,215 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:53:00,988 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:53:00,988 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:53:01,013 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:53:01,820 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:53:01,820 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:53:01,846 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:53:02,841 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:53:02,842 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:53:02,871 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:53:04,376 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:53:04,376 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:53:04,402 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:53:04,583 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:53:04,608 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:53:05,111 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:53:05,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:53:05,784 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3317 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_ArrVal_3316 (Array Int Int)) (v_ArrVal_3317 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 02:53:05,869 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_3317 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3316 (Array Int Int)) (v_ArrVal_3317 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-28 02:53:06,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:53:06,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 86 [2024-11-28 02:53:06,410 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3317 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3315) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_ArrVal_3316 (Array Int Int)) (v_prenex_39 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_prenex_39))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem56#1.base|)) (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_prenex_40) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ |c_ULTIMATE.start_main_#t~mem56#1.offset| 1))))) is different from false [2024-11-28 02:53:07,362 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3317 (Array Int Int))) (<= 0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3312))) (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_3313) .cse0 v_ArrVal_3315) (select (select (store .cse1 .cse0 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3317))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (forall ((v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3316 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3312))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse3 (select (select (let ((.cse4 (store .cse5 .cse3 v_prenex_39))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_prenex_41 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3313))) (< (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3312))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store .cse6 .cse7 v_prenex_40) (select (select (store .cse8 .cse7 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_41))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1)))))) is different from false [2024-11-28 02:53:07,657 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_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3317 (Array Int Int))) (<= 0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3312))) (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_3313) .cse1 v_ArrVal_3315) (select (select (store .cse2 .cse1 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3317))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3316 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3312))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (let ((.cse4 (store .cse5 .cse6 v_prenex_39))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse6)))) (forall ((v_prenex_41 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3313))) (< (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3312))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store .cse7 .cse8 v_prenex_40) (select (select (store .cse9 .cse8 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_41))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1))))))) is different from false [2024-11-28 02:53:08,133 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3317 (Array Int Int))) (<= 0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3311))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_3312))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3310) .cse0 v_ArrVal_3313) .cse1 v_ArrVal_3315) (select (select (store .cse2 .cse1 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3317))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3316 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse6 (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3311))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3312)))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (let ((.cse5 (store .cse6 .cse7 v_prenex_39))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse7)))) (forall ((v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3311))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3310) .cse13 v_ArrVal_3313))) (< (select (select (let ((.cse11 (store .cse12 .cse13 v_ArrVal_3312))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store .cse9 .cse10 v_prenex_40) (select (select (store .cse11 .cse10 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_41))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))))))) is different from false [2024-11-28 02:53:08,480 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3316 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3311))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3312)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_prenex_39))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3317 (Array Int Int))) (<= 0 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3311))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3312))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_3310) .cse6 v_ArrVal_3313) .cse7 v_ArrVal_3315) (select (select (store .cse8 .cse7 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3317))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (forall ((v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3311))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse10 (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_3310) .cse14 v_ArrVal_3313))) (< (select (select (let ((.cse12 (store .cse13 .cse14 v_ArrVal_3312))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store .cse10 .cse11 v_prenex_40) (select (select (store .cse12 .cse11 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_41))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1))))))))) is different from false [2024-11-28 02:53:08,877 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3317 (Array Int Int)) (v_ArrVal_3308 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (<= 0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3309))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_3311))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3312))) (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~mem53#1.base| v_ArrVal_3308) .cse0 v_ArrVal_3310) .cse1 v_ArrVal_3313) .cse2 v_ArrVal_3315) (select (select (store .cse3 .cse2 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3317))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (forall ((v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3316 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (let ((.cse9 (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3309))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3311)))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3312)))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (= .cse7 (select (select (let ((.cse8 (store .cse9 .cse7 v_prenex_39))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))) (forall ((v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3308 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3309))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse15 (store .cse18 .cse17 v_ArrVal_3311))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3308) .cse17 v_ArrVal_3310) .cse16 v_ArrVal_3313))) (< (select (select (let ((.cse14 (store .cse15 .cse16 v_ArrVal_3312))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store .cse12 .cse13 v_prenex_40) (select (select (store .cse14 .cse13 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_41))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (+ (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1)))))))))) is different from false [2024-11-28 02:53:09,424 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_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3317 (Array Int Int)) (v_ArrVal_3308 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (<= 0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3309))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3311))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3312))) (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_3308) .cse1 v_ArrVal_3310) .cse2 v_ArrVal_3313) .cse3 v_ArrVal_3315) (select (select (store .cse4 .cse3 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3317))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (forall ((v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3308 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3309))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse11 (store .cse14 .cse13 v_ArrVal_3311))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3308) .cse13 v_ArrVal_3310) .cse12 v_ArrVal_3313))) (< (select (select (let ((.cse10 (store .cse11 .cse12 v_ArrVal_3312))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store .cse8 .cse9 v_prenex_40) (select (select (store .cse10 .cse9 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_41))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) (+ (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 1)))))))) (forall ((v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3316 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (let ((.cse17 (let ((.cse18 (let ((.cse19 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3309))) (store .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3311)))) (store .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3312)))) (let ((.cse15 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (= .cse15 (select (select (let ((.cse16 (store .cse17 .cse15 v_prenex_39))) (store .cse16 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))) is different from false [2024-11-28 02:53:14,123 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3316 (Array Int Int)) (v_ArrVal_3307 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3307))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3309)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3311)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3312)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_prenex_39))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) (forall ((v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3306 (Array Int Int)) (v_ArrVal_3307 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3308 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3307))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_3309))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse14 .cse13 v_ArrVal_3311))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3306) .cse12 v_ArrVal_3308) .cse13 v_ArrVal_3310) .cse11 v_ArrVal_3313))) (< (select (select (let ((.cse9 (store .cse10 .cse11 v_ArrVal_3312))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store .cse7 .cse8 v_prenex_40) (select (select (store .cse9 .cse8 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_41))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)))))))))) (forall ((v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3306 (Array Int Int)) (v_ArrVal_3317 (Array Int Int)) (v_ArrVal_3307 (Array Int Int)) (v_ArrVal_3308 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (<= 0 (select (select (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3307))) (let ((.cse16 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse22 (store .cse23 .cse16 v_ArrVal_3309))) (let ((.cse17 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse21 (store .cse22 .cse17 v_ArrVal_3311))) (let ((.cse18 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse20 (store .cse21 .cse18 v_ArrVal_3312))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3306) .cse16 v_ArrVal_3308) .cse17 v_ArrVal_3310) .cse18 v_ArrVal_3313) .cse19 v_ArrVal_3315) (select (select (store .cse20 .cse19 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3317))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-28 02:53:18,909 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3306 (Array Int Int)) (v_ArrVal_3307 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3308 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_3307))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_3309))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse9 .cse8 v_ArrVal_3311))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_3306) .cse7 v_ArrVal_3308) .cse8 v_ArrVal_3310) .cse5 v_ArrVal_3313))) (< (select (select (let ((.cse2 (store .cse4 .cse5 v_ArrVal_3312))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store .cse0 .cse1 v_prenex_40) (select (select (store .cse2 .cse1 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_41))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))))))))) (forall ((v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3316 (Array Int Int)) (v_ArrVal_3307 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (let ((.cse12 (let ((.cse14 (let ((.cse15 (let ((.cse16 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_3307))) (store .cse16 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3309)))) (store .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3311)))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3312)))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (let ((.cse11 (store .cse12 .cse13 v_prenex_39))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse13)))) (forall ((v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3306 (Array Int Int)) (v_ArrVal_3317 (Array Int Int)) (v_ArrVal_3307 (Array Int Int)) (v_ArrVal_3308 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (<= 0 (select (select (let ((.cse24 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_3307))) (let ((.cse17 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse23 (store .cse24 .cse17 v_ArrVal_3309))) (let ((.cse18 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse22 (store .cse23 .cse18 v_ArrVal_3311))) (let ((.cse19 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse21 (store .cse22 .cse19 v_ArrVal_3312))) (let ((.cse20 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_3306) .cse17 v_ArrVal_3308) .cse18 v_ArrVal_3310) .cse19 v_ArrVal_3313) .cse20 v_ArrVal_3315) (select (select (store .cse21 .cse20 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3317))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))) is different from false [2024-11-28 02:53:23,793 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3322 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3323 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3306 (Array Int Int)) (v_ArrVal_3307 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3308 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3322))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_3307))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_3309))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse9 .cse8 v_ArrVal_3311))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3323) .cse6 v_ArrVal_3306) .cse7 v_ArrVal_3308) .cse8 v_ArrVal_3310) .cse5 v_ArrVal_3313))) (< (select (select (let ((.cse2 (store .cse4 .cse5 v_ArrVal_3312))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store .cse0 .cse1 v_prenex_40) (select (select (store .cse2 .cse1 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_41))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))))))))))) (forall ((v_ArrVal_3310 (Array Int Int)) (v_ArrVal_3322 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3323 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3313 (Array Int Int)) (v_ArrVal_3314 (Array Int Int)) (v_ArrVal_3315 (Array Int Int)) (v_ArrVal_3306 (Array Int Int)) (v_ArrVal_3317 (Array Int Int)) (v_ArrVal_3307 (Array Int Int)) (v_ArrVal_3308 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (<= 0 (select (select (let ((.cse21 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3322))) (let ((.cse12 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse20 (store .cse21 .cse12 v_ArrVal_3307))) (let ((.cse13 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse19 (store .cse20 .cse13 v_ArrVal_3309))) (let ((.cse14 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse18 (store .cse19 .cse14 v_ArrVal_3311))) (let ((.cse15 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse17 (store .cse18 .cse15 v_ArrVal_3312))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3323) .cse12 v_ArrVal_3306) .cse13 v_ArrVal_3308) .cse14 v_ArrVal_3310) .cse15 v_ArrVal_3313) .cse16 v_ArrVal_3315) (select (select (store .cse17 .cse16 v_ArrVal_3314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3317))))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3322 (Array Int Int)) (v_ArrVal_3311 (Array Int Int)) (v_ArrVal_3312 (Array Int Int)) (v_ArrVal_3316 (Array Int Int)) (v_ArrVal_3307 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3309 (Array Int Int))) (let ((.cse23 (let ((.cse25 (let ((.cse26 (let ((.cse27 (let ((.cse28 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3322))) (store .cse28 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3307)))) (store .cse27 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3309)))) (store .cse26 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3311)))) (store .cse25 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3312)))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (let ((.cse22 (store .cse23 .cse24 v_prenex_39))) (store .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse24)))))) is different from false [2024-11-28 02:53:23,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131125379] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:53:23,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:53:23,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 28 [2024-11-28 02:53:23,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405626601] [2024-11-28 02:53:23,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:53:23,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-28 02:53:23,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:23,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-28 02:53:23,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=828, Unknown=17, NotChecked=828, Total=1806 [2024-11-28 02:53:23,878 INFO L87 Difference]: Start difference. First operand 1231 states and 1414 transitions. Second operand has 29 states, 26 states have (on average 6.5) internal successors, (169), 29 states have internal predecessors, (169), 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)