./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-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_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/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_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/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_01fa2f89-1931-47e3-891a-ad01fb11c100/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 f4a8b24485e53fece96b44fdc12e6f161e1bbffda2cd597a930f4925e148dc01 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:52:36,413 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:52:36,496 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 02:52:36,503 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:52:36,504 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:52:36,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:52:36,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:52:36,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:52:36,564 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:52:36,564 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:52:36,564 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:52:36,564 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:52:36,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:52:36,565 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:52:36,565 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:52:36,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:52:36,567 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:52:36,567 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:52:36,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:52:36,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:52:36,568 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 02:52:36,568 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 02:52:36,569 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 02:52:36,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:52:36,569 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 02:52:36,569 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 02:52:36,569 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:52:36,569 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:52:36,569 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:52:36,569 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:52:36,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:52:36,570 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:52:36,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:52:36,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:52:36,571 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:52:36,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:52:36,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:52:36,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:52:36,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:52:36,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:52:36,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:52:36,572 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:52:36,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:52:36,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:52:36,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:52:36,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:52:36,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:52:36,573 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_01fa2f89-1931-47e3-891a-ad01fb11c100/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 -> f4a8b24485e53fece96b44fdc12e6f161e1bbffda2cd597a930f4925e148dc01 [2024-11-28 02:52:37,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:52:37,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:52:37,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:52:37,042 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:52:37,044 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:52:37,047 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-1.i [2024-11-28 02:52:40,815 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/data/4fb648362/c0ae48650da144dca026f091a176fe0f/FLAG4e8014ecb [2024-11-28 02:52:41,504 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:52:41,505 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-1.i [2024-11-28 02:52:41,540 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/data/4fb648362/c0ae48650da144dca026f091a176fe0f/FLAG4e8014ecb [2024-11-28 02:52:41,558 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/data/4fb648362/c0ae48650da144dca026f091a176fe0f [2024-11-28 02:52:41,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:52:41,562 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:52:41,564 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:52:41,564 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:52:41,569 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:52:41,570 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:52:41" (1/1) ... [2024-11-28 02:52:41,571 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b7ecd9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:52:41, skipping insertion in model container [2024-11-28 02:52:41,571 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:52:41" (1/1) ... [2024-11-28 02:52:41,679 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:52:42,715 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:52:42,764 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:52:42,772 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:52:42,785 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:52:42,797 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:52:42,855 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:52:42,855 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:52:42,862 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:52:42,862 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:52:42,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:52:42,893 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:52:43,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:52:43,107 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:52:43,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:52:43 WrapperNode [2024-11-28 02:52:43,109 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:52:43,111 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:52:43,111 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:52:43,111 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:52:43,119 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:52:43" (1/1) ... [2024-11-28 02:52:43,168 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:52:43" (1/1) ... [2024-11-28 02:52:43,303 INFO L138 Inliner]: procedures = 177, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3262 [2024-11-28 02:52:43,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:52:43,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:52:43,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:52:43,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:52:43,314 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:52:43" (1/1) ... [2024-11-28 02:52:43,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:52:43" (1/1) ... [2024-11-28 02:52:43,369 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:52:43" (1/1) ... [2024-11-28 02:52:43,428 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2024-11-28 02:52:43,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:52:43" (1/1) ... [2024-11-28 02:52:43,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:52:43" (1/1) ... [2024-11-28 02:52:43,475 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:52:43" (1/1) ... [2024-11-28 02:52:43,478 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:52:43" (1/1) ... [2024-11-28 02:52:43,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:52:43" (1/1) ... [2024-11-28 02:52:43,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:52:43" (1/1) ... [2024-11-28 02:52:43,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:52:43" (1/1) ... [2024-11-28 02:52:43,538 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:52:43,542 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:52:43,542 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:52:43,542 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:52:43,543 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:52:43" (1/1) ... [2024-11-28 02:52:43,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:52:43,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:52:43,586 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/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:52:43,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/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:52:43,618 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-28 02:52:43,618 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-28 02:52:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 02:52:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 02:52:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 02:52:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-28 02:52:43,620 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-28 02:52:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 02:52:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 02:52:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 02:52:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-28 02:52:43,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-28 02:52:43,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-28 02:52:43,621 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-28 02:52:43,622 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-28 02:52:43,622 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-28 02:52:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 02:52:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:52:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 02:52:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 02:52:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 02:52:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 02:52:43,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 02:52:43,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 02:52:43,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 02:52:43,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 02:52:43,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 02:52:43,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 02:52:43,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 02:52:43,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:52:43,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:52:43,861 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:52:43,863 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:52:43,891 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 02:52:43,941 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 02:52:43,976 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 02:52:49,592 INFO L? ?]: Removed 1537 outVars from TransFormulas that were not future-live. [2024-11-28 02:52:49,594 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:52:49,665 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:52:49,666 INFO L312 CfgBuilder]: Removed 31 assume(true) statements. [2024-11-28 02:52:49,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:52:49 BoogieIcfgContainer [2024-11-28 02:52:49,667 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:52:49,669 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:52:49,669 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:52:49,680 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:52:49,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:52:41" (1/3) ... [2024-11-28 02:52:49,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313d8ab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:52:49, skipping insertion in model container [2024-11-28 02:52:49,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:52:43" (2/3) ... [2024-11-28 02:52:49,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313d8ab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:52:49, skipping insertion in model container [2024-11-28 02:52:49,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:52:49" (3/3) ... [2024-11-28 02:52:49,686 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test9-1.i [2024-11-28 02:52:49,707 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:52:49,713 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test9-1.i that has 6 procedures, 2077 locations, 1 initial locations, 33 loop locations, and 424 error locations. [2024-11-28 02:52:49,838 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:52:49,857 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;@417e6c41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:52:49,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2024-11-28 02:52:49,875 INFO L276 IsEmpty]: Start isEmpty. Operand has 2067 states, 1137 states have (on average 2.006156552330695) internal successors, (2281), 2060 states have internal predecessors, (2281), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2024-11-28 02:52:49,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 02:52:49,882 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:52:49,883 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 02:52:49,883 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:52:49,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:52:49,893 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2024-11-28 02:52:49,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:52:49,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488121711] [2024-11-28 02:52:49,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:52:49,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:52:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:52:50,223 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:52:50,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:52:50,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488121711] [2024-11-28 02:52:50,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488121711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:52:50,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:52:50,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:52:50,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225834310] [2024-11-28 02:52:50,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:52:50,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:52:50,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:52:50,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:52:50,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:52:50,284 INFO L87 Difference]: Start difference. First operand has 2067 states, 1137 states have (on average 2.006156552330695) internal successors, (2281), 2060 states have internal predecessors, (2281), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:52:52,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:52:52,393 INFO L93 Difference]: Finished difference Result 2053 states and 3217 transitions. [2024-11-28 02:52:52,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:52:52,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-28 02:52:52,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:52:52,456 INFO L225 Difference]: With dead ends: 2053 [2024-11-28 02:52:52,456 INFO L226 Difference]: Without dead ends: 2051 [2024-11-28 02:52:52,460 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:52:52,468 INFO L435 NwaCegarLoop]: 2828 mSDtfsCounter, 2092 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2595 SdHoareTripleChecker+Valid, 2880 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:52:52,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2595 Valid, 2880 Invalid, 959 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [16 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-28 02:52:52,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2024-11-28 02:52:53,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 2051. [2024-11-28 02:52:53,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2051 states, 1139 states have (on average 1.9376646180860404) internal successors, (2207), 2044 states have internal predecessors, (2207), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-28 02:52:53,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 3215 transitions. [2024-11-28 02:52:53,228 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 3215 transitions. Word has length 3 [2024-11-28 02:52:53,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:52:53,230 INFO L471 AbstractCegarLoop]: Abstraction has 2051 states and 3215 transitions. [2024-11-28 02:52:53,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:52:53,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 3215 transitions. [2024-11-28 02:52:53,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 02:52:53,231 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:52:53,231 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 02:52:53,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 02:52:53,232 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:52:53,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:52:53,233 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2024-11-28 02:52:53,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:52:53,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93459907] [2024-11-28 02:52:53,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:52:53,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:52:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:52:53,416 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:52:53,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:52:53,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93459907] [2024-11-28 02:52:53,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93459907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:52:53,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:52:53,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:52:53,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774777327] [2024-11-28 02:52:53,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:52:53,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:52:53,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:52:53,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:52:53,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:52:53,420 INFO L87 Difference]: Start difference. First operand 2051 states and 3215 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:52:55,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:52:55,903 INFO L93 Difference]: Finished difference Result 3816 states and 6132 transitions. [2024-11-28 02:52:55,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:52:55,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-28 02:52:55,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:52:55,934 INFO L225 Difference]: With dead ends: 3816 [2024-11-28 02:52:55,935 INFO L226 Difference]: Without dead ends: 3816 [2024-11-28 02:52:55,935 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:52:55,940 INFO L435 NwaCegarLoop]: 2930 mSDtfsCounter, 1909 mSDsluCounter, 2281 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2411 SdHoareTripleChecker+Valid, 5211 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:52:55,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2411 Valid, 5211 Invalid, 1211 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [14 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-28 02:52:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2024-11-28 02:52:56,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 3552. [2024-11-28 02:52:56,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3552 states, 2141 states have (on average 1.9196637085474078) internal successors, (4110), 3543 states have internal predecessors, (4110), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-28 02:52:56,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3552 states to 3552 states and 6122 transitions. [2024-11-28 02:52:56,402 INFO L78 Accepts]: Start accepts. Automaton has 3552 states and 6122 transitions. Word has length 3 [2024-11-28 02:52:56,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:52:56,402 INFO L471 AbstractCegarLoop]: Abstraction has 3552 states and 6122 transitions. [2024-11-28 02:52:56,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:52:56,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3552 states and 6122 transitions. [2024-11-28 02:52:56,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 02:52:56,403 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:52:56,403 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:52:56,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 02:52:56,403 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:52:56,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:52:56,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1743988334, now seen corresponding path program 1 times [2024-11-28 02:52:56,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:52:56,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059687848] [2024-11-28 02:52:56,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:52:56,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:52:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:52:56,545 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:52:56,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:52:56,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059687848] [2024-11-28 02:52:56,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059687848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:52:56,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:52:56,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:52:56,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394416012] [2024-11-28 02:52:56,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:52:56,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:52:56,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:52:56,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:52:56,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:52:56,548 INFO L87 Difference]: Start difference. First operand 3552 states and 6122 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:52:58,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:52:58,548 INFO L93 Difference]: Finished difference Result 4816 states and 8440 transitions. [2024-11-28 02:52:58,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:52:58,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-28 02:52:58,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:52:58,585 INFO L225 Difference]: With dead ends: 4816 [2024-11-28 02:52:58,586 INFO L226 Difference]: Without dead ends: 4816 [2024-11-28 02:52:58,586 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:52:58,588 INFO L435 NwaCegarLoop]: 4984 mSDtfsCounter, 2077 mSDsluCounter, 2306 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2580 SdHoareTripleChecker+Valid, 7290 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:52:58,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2580 Valid, 7290 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-28 02:52:58,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4816 states. [2024-11-28 02:52:59,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4816 to 3505. [2024-11-28 02:52:59,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3505 states, 2141 states have (on average 1.8865016347501167) internal successors, (4039), 3496 states have internal predecessors, (4039), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-28 02:52:59,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3505 states to 3505 states and 6051 transitions. [2024-11-28 02:52:59,517 INFO L78 Accepts]: Start accepts. Automaton has 3505 states and 6051 transitions. Word has length 9 [2024-11-28 02:52:59,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:52:59,517 INFO L471 AbstractCegarLoop]: Abstraction has 3505 states and 6051 transitions. [2024-11-28 02:52:59,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:52:59,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3505 states and 6051 transitions. [2024-11-28 02:52:59,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 02:52:59,518 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:52:59,518 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:52:59,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:52:59,518 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:52:59,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:52:59,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1743988333, now seen corresponding path program 1 times [2024-11-28 02:52:59,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:52:59,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672284023] [2024-11-28 02:52:59,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:52:59,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:52:59,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:52:59,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:52:59,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:52:59,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672284023] [2024-11-28 02:52:59,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672284023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:52:59,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:52:59,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:52:59,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920681064] [2024-11-28 02:52:59,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:52:59,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:52:59,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:52:59,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:52:59,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:52:59,739 INFO L87 Difference]: Start difference. First operand 3505 states and 6051 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:01,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:01,792 INFO L93 Difference]: Finished difference Result 6027 states and 10789 transitions. [2024-11-28 02:53:01,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:53:01,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-28 02:53:01,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:01,836 INFO L225 Difference]: With dead ends: 6027 [2024-11-28 02:53:01,836 INFO L226 Difference]: Without dead ends: 6027 [2024-11-28 02:53:01,837 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:53:01,839 INFO L435 NwaCegarLoop]: 5129 mSDtfsCounter, 1869 mSDsluCounter, 2423 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2371 SdHoareTripleChecker+Valid, 7552 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:01,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2371 Valid, 7552 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-28 02:53:01,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6027 states. [2024-11-28 02:53:02,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6027 to 3480. [2024-11-28 02:53:02,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3480 states, 2141 states have (on average 1.8636151331153668) internal successors, (3990), 3471 states have internal predecessors, (3990), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-28 02:53:02,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3480 states to 3480 states and 6002 transitions. [2024-11-28 02:53:02,620 INFO L78 Accepts]: Start accepts. Automaton has 3480 states and 6002 transitions. Word has length 9 [2024-11-28 02:53:02,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:02,620 INFO L471 AbstractCegarLoop]: Abstraction has 3480 states and 6002 transitions. [2024-11-28 02:53:02,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:02,620 INFO L276 IsEmpty]: Start isEmpty. Operand 3480 states and 6002 transitions. [2024-11-28 02:53:02,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 02:53:02,621 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:02,621 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:02,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 02:53:02,621 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr422ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:53:02,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:02,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1246059725, now seen corresponding path program 1 times [2024-11-28 02:53:02,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:02,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936649344] [2024-11-28 02:53:02,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:02,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:02,801 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:53:02,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:02,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936649344] [2024-11-28 02:53:02,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936649344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:02,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:02,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:53:02,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333253066] [2024-11-28 02:53:02,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:02,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:53:02,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:02,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:53:02,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:53:02,805 INFO L87 Difference]: Start difference. First operand 3480 states and 6002 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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:53:04,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:04,109 INFO L93 Difference]: Finished difference Result 6645 states and 11501 transitions. [2024-11-28 02:53:04,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:53:04,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-11-28 02:53:04,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:04,162 INFO L225 Difference]: With dead ends: 6645 [2024-11-28 02:53:04,162 INFO L226 Difference]: Without dead ends: 6645 [2024-11-28 02:53:04,162 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:53:04,163 INFO L435 NwaCegarLoop]: 3138 mSDtfsCounter, 2091 mSDsluCounter, 5714 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2594 SdHoareTripleChecker+Valid, 8852 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:04,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2594 Valid, 8852 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-28 02:53:04,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6645 states. [2024-11-28 02:53:05,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6645 to 3482. [2024-11-28 02:53:05,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3482 states, 2143 states have (on average 1.8628091460569296) internal successors, (3992), 3473 states have internal predecessors, (3992), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-28 02:53:05,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3482 states to 3482 states and 6004 transitions. [2024-11-28 02:53:05,039 INFO L78 Accepts]: Start accepts. Automaton has 3482 states and 6004 transitions. Word has length 10 [2024-11-28 02:53:05,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:05,040 INFO L471 AbstractCegarLoop]: Abstraction has 3482 states and 6004 transitions. [2024-11-28 02:53:05,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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:53:05,040 INFO L276 IsEmpty]: Start isEmpty. Operand 3482 states and 6004 transitions. [2024-11-28 02:53:05,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-28 02:53:05,041 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:05,041 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:05,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 02:53:05,041 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:53:05,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:05,042 INFO L85 PathProgramCache]: Analyzing trace with hash 495195041, now seen corresponding path program 1 times [2024-11-28 02:53:05,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:05,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574936967] [2024-11-28 02:53:05,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:05,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:05,161 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:53:05,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:05,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574936967] [2024-11-28 02:53:05,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574936967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:05,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:05,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:53:05,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877686359] [2024-11-28 02:53:05,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:05,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:53:05,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:05,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:53:05,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:53:05,165 INFO L87 Difference]: Start difference. First operand 3482 states and 6004 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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:53:08,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:08,831 INFO L93 Difference]: Finished difference Result 3558 states and 6111 transitions. [2024-11-28 02:53:08,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:53:08,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2024-11-28 02:53:08,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:08,851 INFO L225 Difference]: With dead ends: 3558 [2024-11-28 02:53:08,851 INFO L226 Difference]: Without dead ends: 3558 [2024-11-28 02:53:08,852 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:53:08,852 INFO L435 NwaCegarLoop]: 2730 mSDtfsCounter, 2342 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 2295 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2845 SdHoareTripleChecker+Valid, 4333 SdHoareTripleChecker+Invalid, 2323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:08,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2845 Valid, 4333 Invalid, 2323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2295 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-28 02:53:08,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2024-11-28 02:53:09,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3459. [2024-11-28 02:53:09,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 2143 states have (on average 1.841343910405973) internal successors, (3946), 3450 states have internal predecessors, (3946), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-28 02:53:09,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 5958 transitions. [2024-11-28 02:53:09,228 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 5958 transitions. Word has length 19 [2024-11-28 02:53:09,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:09,229 INFO L471 AbstractCegarLoop]: Abstraction has 3459 states and 5958 transitions. [2024-11-28 02:53:09,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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:53:09,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 5958 transitions. [2024-11-28 02:53:09,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-28 02:53:09,230 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:09,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:09,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 02:53:09,231 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:53:09,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:09,231 INFO L85 PathProgramCache]: Analyzing trace with hash 495195042, now seen corresponding path program 1 times [2024-11-28 02:53:09,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:09,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72295636] [2024-11-28 02:53:09,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:09,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:09,308 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:53:09,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:09,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72295636] [2024-11-28 02:53:09,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72295636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:09,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:09,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:53:09,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532479282] [2024-11-28 02:53:09,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:09,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:53:09,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:09,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:53:09,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:53:09,310 INFO L87 Difference]: Start difference. First operand 3459 states and 5958 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:53:09,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:09,394 INFO L93 Difference]: Finished difference Result 3321 states and 5752 transitions. [2024-11-28 02:53:09,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:53:09,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2024-11-28 02:53:09,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:09,406 INFO L225 Difference]: With dead ends: 3321 [2024-11-28 02:53:09,407 INFO L226 Difference]: Without dead ends: 3321 [2024-11-28 02:53:09,407 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:53:09,407 INFO L435 NwaCegarLoop]: 2995 mSDtfsCounter, 61 mSDsluCounter, 2942 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 5937 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:53:09,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 5937 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:53:09,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3321 states. [2024-11-28 02:53:09,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3321 to 3321. [2024-11-28 02:53:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3321 states, 2017 states have (on average 1.8542389687654932) internal successors, (3740), 3312 states have internal predecessors, (3740), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-28 02:53:09,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 3321 states and 5752 transitions. [2024-11-28 02:53:09,869 INFO L78 Accepts]: Start accepts. Automaton has 3321 states and 5752 transitions. Word has length 19 [2024-11-28 02:53:09,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:09,870 INFO L471 AbstractCegarLoop]: Abstraction has 3321 states and 5752 transitions. [2024-11-28 02:53:09,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:53:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 5752 transitions. [2024-11-28 02:53:09,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-28 02:53:09,871 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:09,871 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:09,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 02:53:09,872 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:53:09,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:09,874 INFO L85 PathProgramCache]: Analyzing trace with hash -858657125, now seen corresponding path program 1 times [2024-11-28 02:53:09,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:09,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999178740] [2024-11-28 02:53:09,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:09,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:10,018 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:53:10,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:10,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999178740] [2024-11-28 02:53:10,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999178740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:10,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:10,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:53:10,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43917504] [2024-11-28 02:53:10,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:10,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:53:10,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:10,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:53:10,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:53:10,021 INFO L87 Difference]: Start difference. First operand 3321 states and 5752 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:10,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:10,150 INFO L93 Difference]: Finished difference Result 3292 states and 5702 transitions. [2024-11-28 02:53:10,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:53:10,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-28 02:53:10,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:10,168 INFO L225 Difference]: With dead ends: 3292 [2024-11-28 02:53:10,169 INFO L226 Difference]: Without dead ends: 3292 [2024-11-28 02:53:10,170 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:53:10,170 INFO L435 NwaCegarLoop]: 2960 mSDtfsCounter, 41 mSDsluCounter, 5892 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 8852 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:53:10,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 8852 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:53:10,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3292 states. [2024-11-28 02:53:10,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3292 to 3286. [2024-11-28 02:53:10,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3286 states, 1989 states have (on average 1.852187028657617) internal successors, (3684), 3277 states have internal predecessors, (3684), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-28 02:53:10,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3286 states to 3286 states and 5696 transitions. [2024-11-28 02:53:10,512 INFO L78 Accepts]: Start accepts. Automaton has 3286 states and 5696 transitions. Word has length 21 [2024-11-28 02:53:10,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:10,513 INFO L471 AbstractCegarLoop]: Abstraction has 3286 states and 5696 transitions. [2024-11-28 02:53:10,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:10,513 INFO L276 IsEmpty]: Start isEmpty. Operand 3286 states and 5696 transitions. [2024-11-28 02:53:10,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-28 02:53:10,514 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:10,514 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] [2024-11-28 02:53:10,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 02:53:10,515 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:53:10,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:10,515 INFO L85 PathProgramCache]: Analyzing trace with hash -496287351, now seen corresponding path program 1 times [2024-11-28 02:53:10,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:10,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251296123] [2024-11-28 02:53:10,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:10,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:10,870 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:53:10,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:10,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251296123] [2024-11-28 02:53:10,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251296123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:10,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:10,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:53:10,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447671421] [2024-11-28 02:53:10,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:10,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:53:10,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:10,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:53:10,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:53:10,874 INFO L87 Difference]: Start difference. First operand 3286 states and 5696 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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:53:15,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:15,097 INFO L93 Difference]: Finished difference Result 6062 states and 10807 transitions. [2024-11-28 02:53:15,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:53:15,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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 35 [2024-11-28 02:53:15,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:15,130 INFO L225 Difference]: With dead ends: 6062 [2024-11-28 02:53:15,130 INFO L226 Difference]: Without dead ends: 6062 [2024-11-28 02:53:15,130 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:53:15,132 INFO L435 NwaCegarLoop]: 2799 mSDtfsCounter, 1818 mSDsluCounter, 3582 mSDsCounter, 0 mSdLazyCounter, 2359 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2318 SdHoareTripleChecker+Valid, 6381 SdHoareTripleChecker+Invalid, 2362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:15,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2318 Valid, 6381 Invalid, 2362 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3 Valid, 2359 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-28 02:53:15,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6062 states. [2024-11-28 02:53:15,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6062 to 3282. [2024-11-28 02:53:15,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3282 states, 1989 states have (on average 1.8481649069884365) internal successors, (3676), 3273 states have internal predecessors, (3676), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-28 02:53:15,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3282 states to 3282 states and 5688 transitions. [2024-11-28 02:53:15,833 INFO L78 Accepts]: Start accepts. Automaton has 3282 states and 5688 transitions. Word has length 35 [2024-11-28 02:53:15,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:15,833 INFO L471 AbstractCegarLoop]: Abstraction has 3282 states and 5688 transitions. [2024-11-28 02:53:15,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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:53:15,834 INFO L276 IsEmpty]: Start isEmpty. Operand 3282 states and 5688 transitions. [2024-11-28 02:53:15,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-28 02:53:15,835 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:15,836 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] [2024-11-28 02:53:15,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 02:53:15,836 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:53:15,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:15,838 INFO L85 PathProgramCache]: Analyzing trace with hash -907140769, now seen corresponding path program 1 times [2024-11-28 02:53:15,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:15,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955335836] [2024-11-28 02:53:15,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:15,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:16,057 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:53:16,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:16,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955335836] [2024-11-28 02:53:16,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955335836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:16,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:16,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:53:16,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475421081] [2024-11-28 02:53:16,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:16,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:53:16,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:16,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:53:16,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:53:16,060 INFO L87 Difference]: Start difference. First operand 3282 states and 5688 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:16,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:16,193 INFO L93 Difference]: Finished difference Result 3282 states and 5680 transitions. [2024-11-28 02:53:16,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:53:16,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-28 02:53:16,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:16,210 INFO L225 Difference]: With dead ends: 3282 [2024-11-28 02:53:16,211 INFO L226 Difference]: Without dead ends: 3282 [2024-11-28 02:53:16,211 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:53:16,213 INFO L435 NwaCegarLoop]: 2955 mSDtfsCounter, 21 mSDsluCounter, 5879 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8834 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:16,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8834 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:53:16,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3282 states. [2024-11-28 02:53:16,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3282 to 3282. [2024-11-28 02:53:16,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3282 states, 1989 states have (on average 1.844142785319256) internal successors, (3668), 3273 states have internal predecessors, (3668), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-28 02:53:16,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3282 states to 3282 states and 5680 transitions. [2024-11-28 02:53:16,674 INFO L78 Accepts]: Start accepts. Automaton has 3282 states and 5680 transitions. Word has length 69 [2024-11-28 02:53:16,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:16,674 INFO L471 AbstractCegarLoop]: Abstraction has 3282 states and 5680 transitions. [2024-11-28 02:53:16,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:16,675 INFO L276 IsEmpty]: Start isEmpty. Operand 3282 states and 5680 transitions. [2024-11-28 02:53:16,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-28 02:53:16,681 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:16,681 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] [2024-11-28 02:53:16,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 02:53:16,681 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:53:16,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:16,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1031867989, now seen corresponding path program 1 times [2024-11-28 02:53:16,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:16,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993381979] [2024-11-28 02:53:16,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:16,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:16,963 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:53:16,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:16,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993381979] [2024-11-28 02:53:16,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993381979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:16,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:16,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:53:16,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981135408] [2024-11-28 02:53:16,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:16,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:53:16,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:16,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:53:16,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:53:16,965 INFO L87 Difference]: Start difference. First operand 3282 states and 5680 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:17,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:17,120 INFO L93 Difference]: Finished difference Result 5793 states and 10403 transitions. [2024-11-28 02:53:17,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:53:17,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-28 02:53:17,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:17,147 INFO L225 Difference]: With dead ends: 5793 [2024-11-28 02:53:17,149 INFO L226 Difference]: Without dead ends: 5793 [2024-11-28 02:53:17,149 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:53:17,150 INFO L435 NwaCegarLoop]: 3264 mSDtfsCounter, 1354 mSDsluCounter, 2925 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1854 SdHoareTripleChecker+Valid, 6189 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:17,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1854 Valid, 6189 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:53:17,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5793 states. [2024-11-28 02:53:17,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5793 to 5736. [2024-11-28 02:53:17,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5736 states, 3443 states have (on average 1.8553586988091781) internal successors, (6388), 5727 states have internal predecessors, (6388), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 2 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-28 02:53:17,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5736 states to 5736 states and 10400 transitions. [2024-11-28 02:53:17,976 INFO L78 Accepts]: Start accepts. Automaton has 5736 states and 10400 transitions. Word has length 77 [2024-11-28 02:53:17,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:17,977 INFO L471 AbstractCegarLoop]: Abstraction has 5736 states and 10400 transitions. [2024-11-28 02:53:17,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:17,977 INFO L276 IsEmpty]: Start isEmpty. Operand 5736 states and 10400 transitions. [2024-11-28 02:53:17,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-28 02:53:17,979 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:17,979 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] [2024-11-28 02:53:17,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 02:53:17,979 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:53:17,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:17,980 INFO L85 PathProgramCache]: Analyzing trace with hash 646450878, now seen corresponding path program 1 times [2024-11-28 02:53:17,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:17,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352751429] [2024-11-28 02:53:17,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:17,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:18,607 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:53:18,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:18,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352751429] [2024-11-28 02:53:18,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352751429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:18,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:18,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:53:18,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751177421] [2024-11-28 02:53:18,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:18,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:53:18,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:18,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:53:18,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:53:18,610 INFO L87 Difference]: Start difference. First operand 5736 states and 10400 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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:53:19,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:19,761 INFO L93 Difference]: Finished difference Result 5735 states and 10398 transitions. [2024-11-28 02:53:19,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:53:19,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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 85 [2024-11-28 02:53:19,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:19,784 INFO L225 Difference]: With dead ends: 5735 [2024-11-28 02:53:19,784 INFO L226 Difference]: Without dead ends: 5735 [2024-11-28 02:53:19,785 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:53:19,787 INFO L435 NwaCegarLoop]: 2966 mSDtfsCounter, 2 mSDsluCounter, 7907 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10873 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:19,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10873 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 02:53:19,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5735 states. [2024-11-28 02:53:20,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5735 to 5735. [2024-11-28 02:53:20,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5735 states, 3443 states have (on average 1.8547778100493755) internal successors, (6386), 5726 states have internal predecessors, (6386), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 2 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-28 02:53:20,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5735 states to 5735 states and 10398 transitions. [2024-11-28 02:53:20,518 INFO L78 Accepts]: Start accepts. Automaton has 5735 states and 10398 transitions. Word has length 85 [2024-11-28 02:53:20,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:20,518 INFO L471 AbstractCegarLoop]: Abstraction has 5735 states and 10398 transitions. [2024-11-28 02:53:20,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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:53:20,519 INFO L276 IsEmpty]: Start isEmpty. Operand 5735 states and 10398 transitions. [2024-11-28 02:53:20,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-28 02:53:20,520 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:20,520 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] [2024-11-28 02:53:20,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 02:53:20,520 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:53:20,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:20,520 INFO L85 PathProgramCache]: Analyzing trace with hash 646450879, now seen corresponding path program 1 times [2024-11-28 02:53:20,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:20,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679074660] [2024-11-28 02:53:20,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:20,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:21,311 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:53:21,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:21,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679074660] [2024-11-28 02:53:21,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679074660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:21,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:21,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:53:21,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010481832] [2024-11-28 02:53:21,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:21,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:53:21,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:21,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:53:21,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:53:21,316 INFO L87 Difference]: Start difference. First operand 5735 states and 10398 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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:53:22,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:22,638 INFO L93 Difference]: Finished difference Result 5734 states and 10396 transitions. [2024-11-28 02:53:22,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:53:22,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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 85 [2024-11-28 02:53:22,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:22,664 INFO L225 Difference]: With dead ends: 5734 [2024-11-28 02:53:22,664 INFO L226 Difference]: Without dead ends: 5734 [2024-11-28 02:53:22,665 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:53:22,668 INFO L435 NwaCegarLoop]: 2966 mSDtfsCounter, 1 mSDsluCounter, 7845 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10811 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:22,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10811 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-28 02:53:22,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5734 states. [2024-11-28 02:53:23,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5734 to 5734. [2024-11-28 02:53:23,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5734 states, 3441 states have (on average 1.855274629468178) internal successors, (6384), 5725 states have internal predecessors, (6384), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 2 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-28 02:53:23,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5734 states to 5734 states and 10396 transitions. [2024-11-28 02:53:23,355 INFO L78 Accepts]: Start accepts. Automaton has 5734 states and 10396 transitions. Word has length 85 [2024-11-28 02:53:23,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:23,355 INFO L471 AbstractCegarLoop]: Abstraction has 5734 states and 10396 transitions. [2024-11-28 02:53:23,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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:53:23,356 INFO L276 IsEmpty]: Start isEmpty. Operand 5734 states and 10396 transitions. [2024-11-28 02:53:23,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-28 02:53:23,357 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:23,357 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:53:23,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 02:53:23,357 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:53:23,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:23,358 INFO L85 PathProgramCache]: Analyzing trace with hash 957747781, now seen corresponding path program 1 times [2024-11-28 02:53:23,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:23,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962126255] [2024-11-28 02:53:23,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:23,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:23,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:53:23,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:23,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962126255] [2024-11-28 02:53:23,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962126255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:23,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:23,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:53:23,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372350737] [2024-11-28 02:53:23,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:23,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:53:23,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:23,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:53:23,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:53:23,769 INFO L87 Difference]: Start difference. First operand 5734 states and 10396 transitions. Second operand has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 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:53:29,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:29,366 INFO L93 Difference]: Finished difference Result 5752 states and 10422 transitions. [2024-11-28 02:53:29,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:53:29,366 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 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:53:29,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:29,395 INFO L225 Difference]: With dead ends: 5752 [2024-11-28 02:53:29,395 INFO L226 Difference]: Without dead ends: 5752 [2024-11-28 02:53:29,396 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:53:29,396 INFO L435 NwaCegarLoop]: 2951 mSDtfsCounter, 13 mSDsluCounter, 8399 mSDsCounter, 0 mSdLazyCounter, 3492 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 11350 SdHoareTripleChecker+Invalid, 3997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 3492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:29,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 11350 Invalid, 3997 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [505 Valid, 3492 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-28 02:53:29,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5752 states. [2024-11-28 02:53:30,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5752 to 5743. [2024-11-28 02:53:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5743 states, 3449 states have (on average 1.8541606262684835) internal successors, (6395), 5732 states have internal predecessors, (6395), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 3 states have return successors, (2010), 11 states have call predecessors, (2010), 2005 states have call successors, (2010) [2024-11-28 02:53:30,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5743 states to 5743 states and 10412 transitions. [2024-11-28 02:53:30,168 INFO L78 Accepts]: Start accepts. Automaton has 5743 states and 10412 transitions. Word has length 93 [2024-11-28 02:53:30,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:30,168 INFO L471 AbstractCegarLoop]: Abstraction has 5743 states and 10412 transitions. [2024-11-28 02:53:30,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 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:53:30,169 INFO L276 IsEmpty]: Start isEmpty. Operand 5743 states and 10412 transitions. [2024-11-28 02:53:30,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-28 02:53:30,170 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:30,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 02:53:30,170 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:53:30,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:30,171 INFO L85 PathProgramCache]: Analyzing trace with hash 957747782, now seen corresponding path program 1 times [2024-11-28 02:53:30,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:30,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940609252] [2024-11-28 02:53:30,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:30,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:31,162 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:53:31,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:31,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940609252] [2024-11-28 02:53:31,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940609252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:31,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:31,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:53:31,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827775819] [2024-11-28 02:53:31,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:31,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:53:31,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:31,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:53:31,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:53:31,164 INFO L87 Difference]: Start difference. First operand 5743 states and 10412 transitions. Second operand has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 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:53:37,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:37,211 INFO L93 Difference]: Finished difference Result 5743 states and 10410 transitions. [2024-11-28 02:53:37,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:53:37,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 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:53:37,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:37,238 INFO L225 Difference]: With dead ends: 5743 [2024-11-28 02:53:37,239 INFO L226 Difference]: Without dead ends: 5743 [2024-11-28 02:53:37,239 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:53:37,240 INFO L435 NwaCegarLoop]: 2955 mSDtfsCounter, 8 mSDsluCounter, 8162 mSDsCounter, 0 mSdLazyCounter, 3209 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 11117 SdHoareTripleChecker+Invalid, 3712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 3209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:37,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 11117 Invalid, 3712 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [503 Valid, 3209 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-11-28 02:53:37,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5743 states. [2024-11-28 02:53:37,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5743 to 5743. [2024-11-28 02:53:37,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5743 states, 3449 states have (on average 1.853580748042911) internal successors, (6393), 5732 states have internal predecessors, (6393), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 3 states have return successors, (2010), 11 states have call predecessors, (2010), 2005 states have call successors, (2010) [2024-11-28 02:53:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5743 states to 5743 states and 10410 transitions. [2024-11-28 02:53:37,963 INFO L78 Accepts]: Start accepts. Automaton has 5743 states and 10410 transitions. Word has length 93 [2024-11-28 02:53:37,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:37,964 INFO L471 AbstractCegarLoop]: Abstraction has 5743 states and 10410 transitions. [2024-11-28 02:53:37,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 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:53:37,964 INFO L276 IsEmpty]: Start isEmpty. Operand 5743 states and 10410 transitions. [2024-11-28 02:53:37,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-28 02:53:37,965 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:37,965 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] [2024-11-28 02:53:37,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 02:53:37,966 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:53:37,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:37,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1828392253, now seen corresponding path program 1 times [2024-11-28 02:53:37,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:37,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830259199] [2024-11-28 02:53:37,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:37,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:38,868 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:38,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:38,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830259199] [2024-11-28 02:53:38,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830259199] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:53:38,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626003000] [2024-11-28 02:53:38,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:38,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:53:38,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:53:38,879 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:53:38,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:53:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:39,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-28 02:53:39,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:53:39,462 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:53:39,465 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:53:39,539 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:53:39,673 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:53:39,971 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:53:39,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 42 treesize of output 41 [2024-11-28 02:53:40,053 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:53:40,107 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:40,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:53:40,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626003000] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:53:40,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:53:40,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-28 02:53:40,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532763786] [2024-11-28 02:53:40,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:53:40,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 02:53:40,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:40,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 02:53:40,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=319, Unknown=5, NotChecked=0, Total=380 [2024-11-28 02:53:40,211 INFO L87 Difference]: Start difference. First operand 5743 states and 10410 transitions. Second operand has 19 states, 16 states have (on average 7.4375) internal successors, (119), 18 states have internal predecessors, (119), 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:53:55,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:55,157 INFO L93 Difference]: Finished difference Result 5750 states and 10416 transitions. [2024-11-28 02:53:55,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:53:55,158 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.4375) internal successors, (119), 18 states have internal predecessors, (119), 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 94 [2024-11-28 02:53:55,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:55,180 INFO L225 Difference]: With dead ends: 5750 [2024-11-28 02:53:55,180 INFO L226 Difference]: Without dead ends: 5750 [2024-11-28 02:53:55,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=464, Unknown=5, NotChecked=0, Total=552 [2024-11-28 02:53:55,181 INFO L435 NwaCegarLoop]: 2619 mSDtfsCounter, 1900 mSDsluCounter, 17560 mSDsCounter, 0 mSdLazyCounter, 12481 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2404 SdHoareTripleChecker+Valid, 20179 SdHoareTripleChecker+Invalid, 12998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 12481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:55,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2404 Valid, 20179 Invalid, 12998 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [517 Valid, 12481 Invalid, 0 Unknown, 0 Unchecked, 14.4s Time] [2024-11-28 02:53:55,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5750 states. [2024-11-28 02:53:56,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5750 to 5747. [2024-11-28 02:53:56,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5747 states, 3453 states have (on average 1.8523023457862728) internal successors, (6396), 5735 states have internal predecessors, (6396), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-28 02:53:56,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5747 states to 5747 states and 10410 transitions. [2024-11-28 02:53:56,086 INFO L78 Accepts]: Start accepts. Automaton has 5747 states and 10410 transitions. Word has length 94 [2024-11-28 02:53:56,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:56,086 INFO L471 AbstractCegarLoop]: Abstraction has 5747 states and 10410 transitions. [2024-11-28 02:53:56,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.4375) internal successors, (119), 18 states have internal predecessors, (119), 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:53:56,087 INFO L276 IsEmpty]: Start isEmpty. Operand 5747 states and 10410 transitions. [2024-11-28 02:53:56,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-28 02:53:56,088 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:56,088 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] [2024-11-28 02:53:56,102 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 02:53:56,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-28 02:53:56,292 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:53:56,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:56,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1828392254, now seen corresponding path program 1 times [2024-11-28 02:53:56,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:56,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959114903] [2024-11-28 02:53:56,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:56,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:57,504 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:57,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:57,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959114903] [2024-11-28 02:53:57,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959114903] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:53:57,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287082368] [2024-11-28 02:53:57,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:57,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:53:57,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:53:57,507 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:53:57,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:53:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:57,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-28 02:53:57,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:53:58,312 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:53:58,313 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:53:58,322 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:53:58,386 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:53:58,393 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:53:58,560 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:53:58,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:53:58,733 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:53:58,734 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:53:58,746 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:58,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 31 treesize of output 13 [2024-11-28 02:53:58,811 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:53:58,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:53:58,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:53:58,987 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_728 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_729 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))))) is different from false [2024-11-28 02:53:58,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287082368] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:53:58,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:53:58,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2024-11-28 02:53:58,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645147765] [2024-11-28 02:53:58,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:53:58,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 02:53:58,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:58,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 02:53:58,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2024-11-28 02:53:58,993 INFO L87 Difference]: Start difference. First operand 5747 states and 10410 transitions. Second operand has 18 states, 15 states have (on average 7.933333333333334) internal successors, (119), 18 states have internal predecessors, (119), 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:54:11,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:54:11,144 INFO L93 Difference]: Finished difference Result 5749 states and 10414 transitions. [2024-11-28 02:54:11,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 02:54:11,145 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 7.933333333333334) internal successors, (119), 18 states have internal predecessors, (119), 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 94 [2024-11-28 02:54:11,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:54:11,165 INFO L225 Difference]: With dead ends: 5749 [2024-11-28 02:54:11,165 INFO L226 Difference]: Without dead ends: 5749 [2024-11-28 02:54:11,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=463, Unknown=1, NotChecked=44, Total=600 [2024-11-28 02:54:11,166 INFO L435 NwaCegarLoop]: 2622 mSDtfsCounter, 1904 mSDsluCounter, 18242 mSDsCounter, 0 mSdLazyCounter, 10702 mSolverCounterSat, 519 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2408 SdHoareTripleChecker+Valid, 20864 SdHoareTripleChecker+Invalid, 11221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 10702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:54:11,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2408 Valid, 20864 Invalid, 11221 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [519 Valid, 10702 Invalid, 0 Unknown, 0 Unchecked, 11.7s Time] [2024-11-28 02:54:11,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5749 states. [2024-11-28 02:54:11,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5749 to 5737. [2024-11-28 02:54:11,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5737 states, 3445 states have (on average 1.853410740203193) internal successors, (6385), 5727 states have internal predecessors, (6385), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 3 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-28 02:54:11,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5737 states to 5737 states and 10397 transitions. [2024-11-28 02:54:11,829 INFO L78 Accepts]: Start accepts. Automaton has 5737 states and 10397 transitions. Word has length 94 [2024-11-28 02:54:11,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:54:11,829 INFO L471 AbstractCegarLoop]: Abstraction has 5737 states and 10397 transitions. [2024-11-28 02:54:11,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 7.933333333333334) internal successors, (119), 18 states have internal predecessors, (119), 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:54:11,830 INFO L276 IsEmpty]: Start isEmpty. Operand 5737 states and 10397 transitions. [2024-11-28 02:54:11,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-28 02:54:11,834 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:54:11,834 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:54:11,861 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 02:54:12,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-28 02:54:12,036 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:54:12,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:54:12,045 INFO L85 PathProgramCache]: Analyzing trace with hash 797042921, now seen corresponding path program 1 times [2024-11-28 02:54:12,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:54:12,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133856566] [2024-11-28 02:54:12,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:54:12,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:54:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:54:12,744 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:54:12,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:54:12,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133856566] [2024-11-28 02:54:12,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133856566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:54:12,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:54:12,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 02:54:12,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011124564] [2024-11-28 02:54:12,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:54:12,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 02:54:12,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:54:12,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 02:54:12,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-28 02:54:12,746 INFO L87 Difference]: Start difference. First operand 5737 states and 10397 transitions. Second operand has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 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:54:20,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:54:20,711 INFO L93 Difference]: Finished difference Result 5756 states and 10422 transitions. [2024-11-28 02:54:20,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:54:20,712 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 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 96 [2024-11-28 02:54:20,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:54:20,735 INFO L225 Difference]: With dead ends: 5756 [2024-11-28 02:54:20,735 INFO L226 Difference]: Without dead ends: 5756 [2024-11-28 02:54:20,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-28 02:54:20,737 INFO L435 NwaCegarLoop]: 2619 mSDtfsCounter, 1892 mSDsluCounter, 12721 mSDsCounter, 0 mSdLazyCounter, 8916 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2396 SdHoareTripleChecker+Valid, 15340 SdHoareTripleChecker+Invalid, 9430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 8916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:54:20,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2396 Valid, 15340 Invalid, 9430 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [514 Valid, 8916 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2024-11-28 02:54:20,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5756 states. [2024-11-28 02:54:21,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5756 to 5752. [2024-11-28 02:54:21,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5752 states, 3459 states have (on average 1.8508239375542064) internal successors, (6402), 5740 states have internal predecessors, (6402), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-28 02:54:21,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5752 states to 5752 states and 10416 transitions. [2024-11-28 02:54:21,639 INFO L78 Accepts]: Start accepts. Automaton has 5752 states and 10416 transitions. Word has length 96 [2024-11-28 02:54:21,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:54:21,640 INFO L471 AbstractCegarLoop]: Abstraction has 5752 states and 10416 transitions. [2024-11-28 02:54:21,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 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:54:21,640 INFO L276 IsEmpty]: Start isEmpty. Operand 5752 states and 10416 transitions. [2024-11-28 02:54:21,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-28 02:54:21,641 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:54:21,641 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:54:21,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 02:54:21,642 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:54:21,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:54:21,648 INFO L85 PathProgramCache]: Analyzing trace with hash 797042922, now seen corresponding path program 1 times [2024-11-28 02:54:21,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:54:21,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535197852] [2024-11-28 02:54:21,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:54:21,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:54:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:54:22,986 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:54:22,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:54:22,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535197852] [2024-11-28 02:54:22,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535197852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:54:22,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:54:22,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 02:54:22,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690847139] [2024-11-28 02:54:22,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:54:22,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 02:54:22,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:54:22,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 02:54:22,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-28 02:54:22,991 INFO L87 Difference]: Start difference. First operand 5752 states and 10416 transitions. Second operand has 11 states, 10 states have (on average 9.4) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (1), 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:54:32,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:54:32,566 INFO L93 Difference]: Finished difference Result 5755 states and 10420 transitions. [2024-11-28 02:54:32,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:54:32,566 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.4) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (1), 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 96 [2024-11-28 02:54:32,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:54:32,584 INFO L225 Difference]: With dead ends: 5755 [2024-11-28 02:54:32,585 INFO L226 Difference]: Without dead ends: 5755 [2024-11-28 02:54:32,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-28 02:54:32,586 INFO L435 NwaCegarLoop]: 2623 mSDtfsCounter, 1902 mSDsluCounter, 13187 mSDsCounter, 0 mSdLazyCounter, 7376 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2406 SdHoareTripleChecker+Valid, 15810 SdHoareTripleChecker+Invalid, 7888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 7376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:54:32,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2406 Valid, 15810 Invalid, 7888 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [512 Valid, 7376 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2024-11-28 02:54:32,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5755 states. [2024-11-28 02:54:33,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5755 to 5752. [2024-11-28 02:54:33,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5752 states, 3459 states have (on average 1.8502457357617808) internal successors, (6400), 5740 states have internal predecessors, (6400), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-28 02:54:33,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5752 states to 5752 states and 10414 transitions. [2024-11-28 02:54:33,524 INFO L78 Accepts]: Start accepts. Automaton has 5752 states and 10414 transitions. Word has length 96 [2024-11-28 02:54:33,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:54:33,524 INFO L471 AbstractCegarLoop]: Abstraction has 5752 states and 10414 transitions. [2024-11-28 02:54:33,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.4) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (1), 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:54:33,525 INFO L276 IsEmpty]: Start isEmpty. Operand 5752 states and 10414 transitions. [2024-11-28 02:54:33,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-28 02:54:33,526 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:54:33,526 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] [2024-11-28 02:54:33,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 02:54:33,526 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:54:33,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:54:33,531 INFO L85 PathProgramCache]: Analyzing trace with hash 859007729, now seen corresponding path program 1 times [2024-11-28 02:54:33,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:54:33,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514313729] [2024-11-28 02:54:33,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:54:33,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:54:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:54:34,320 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:54:34,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:54:34,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514313729] [2024-11-28 02:54:34,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514313729] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:54:34,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909388693] [2024-11-28 02:54:34,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:54:34,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:54:34,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:54:34,324 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:54:34,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 02:54:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:54:34,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-28 02:54:34,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:54:34,883 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:54:34,883 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:54:34,938 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:54:35,060 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:54:35,263 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:54:35,263 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:54:35,412 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:54:35,412 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:54:35,441 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:54:35,489 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:54:35,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:54:35,506 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1009 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1009) |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:54:35,614 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1012))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1009)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:54:35,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909388693] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:54:35,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:54:35,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2024-11-28 02:54:35,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182474430] [2024-11-28 02:54:35,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:54:35,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 02:54:35,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:54:35,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 02:54:35,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=425, Unknown=9, NotChecked=86, Total=600 [2024-11-28 02:54:35,617 INFO L87 Difference]: Start difference. First operand 5752 states and 10414 transitions. Second operand has 22 states, 19 states have (on average 6.578947368421052) internal successors, (125), 21 states have internal predecessors, (125), 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:54:49,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:54:49,273 INFO L93 Difference]: Finished difference Result 5754 states and 10418 transitions. [2024-11-28 02:54:49,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:54:49,273 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 6.578947368421052) internal successors, (125), 21 states have internal predecessors, (125), 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 97 [2024-11-28 02:54:49,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:54:49,290 INFO L225 Difference]: With dead ends: 5754 [2024-11-28 02:54:49,290 INFO L226 Difference]: Without dead ends: 5754 [2024-11-28 02:54:49,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=547, Unknown=9, NotChecked=98, Total=756 [2024-11-28 02:54:49,296 INFO L435 NwaCegarLoop]: 2618 mSDtfsCounter, 1875 mSDsluCounter, 19134 mSDsCounter, 0 mSdLazyCounter, 13853 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2379 SdHoareTripleChecker+Valid, 21752 SdHoareTripleChecker+Invalid, 14368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 13853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:54:49,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2379 Valid, 21752 Invalid, 14368 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [515 Valid, 13853 Invalid, 0 Unknown, 0 Unchecked, 13.1s Time] [2024-11-28 02:54:49,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5754 states. [2024-11-28 02:54:50,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5754 to 5751. [2024-11-28 02:54:50,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5751 states, 3459 states have (on average 1.8496675339693553) internal successors, (6398), 5739 states have internal predecessors, (6398), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-28 02:54:50,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5751 states to 5751 states and 10412 transitions. [2024-11-28 02:54:50,184 INFO L78 Accepts]: Start accepts. Automaton has 5751 states and 10412 transitions. Word has length 97 [2024-11-28 02:54:50,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:54:50,185 INFO L471 AbstractCegarLoop]: Abstraction has 5751 states and 10412 transitions. [2024-11-28 02:54:50,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 6.578947368421052) internal successors, (125), 21 states have internal predecessors, (125), 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:54:50,185 INFO L276 IsEmpty]: Start isEmpty. Operand 5751 states and 10412 transitions. [2024-11-28 02:54:50,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-28 02:54:50,186 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:54:50,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] [2024-11-28 02:54:50,199 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 02:54:50,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:54:50,390 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:54:50,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:54:50,394 INFO L85 PathProgramCache]: Analyzing trace with hash 859007730, now seen corresponding path program 1 times [2024-11-28 02:54:50,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:54:50,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232834160] [2024-11-28 02:54:50,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:54:50,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:54:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:54:51,911 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:54:51,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:54:51,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232834160] [2024-11-28 02:54:51,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232834160] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:54:51,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380468106] [2024-11-28 02:54:51,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:54:51,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:54:51,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:54:51,917 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:54:51,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 02:54:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:54:52,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-28 02:54:52,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:54:52,438 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:54:52,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:54:52,446 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:54:52,482 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:54:52,496 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:54:52,604 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:54:52,610 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:54:52,792 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:54:52,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:54:52,806 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:54:52,918 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:54:52,918 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:54:52,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:54:52,953 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:54:52,959 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:54:52,965 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:54:52,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:54:53,063 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1163 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 02:54:53,240 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1170))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1169) .cse0 v_ArrVal_1163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1169) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1170) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-28 02:54:53,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380468106] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:54:53,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:54:53,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2024-11-28 02:54:53,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521421286] [2024-11-28 02:54:53,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:54:53,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 02:54:53,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:54:53,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 02:54:53,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=499, Unknown=16, NotChecked=94, Total=702 [2024-11-28 02:54:53,246 INFO L87 Difference]: Start difference. First operand 5751 states and 10412 transitions. Second operand has 22 states, 19 states have (on average 9.68421052631579) internal successors, (184), 22 states have internal predecessors, (184), 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:55:09,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:55:09,538 INFO L93 Difference]: Finished difference Result 5753 states and 10416 transitions. [2024-11-28 02:55:09,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:55:09,539 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 9.68421052631579) internal successors, (184), 22 states have internal predecessors, (184), 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 97 [2024-11-28 02:55:09,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:55:09,549 INFO L225 Difference]: With dead ends: 5753 [2024-11-28 02:55:09,549 INFO L226 Difference]: Without dead ends: 5753 [2024-11-28 02:55:09,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=712, Unknown=17, NotChecked=114, Total=992 [2024-11-28 02:55:09,551 INFO L435 NwaCegarLoop]: 2618 mSDtfsCounter, 1916 mSDsluCounter, 20732 mSDsCounter, 0 mSdLazyCounter, 12792 mSolverCounterSat, 520 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2420 SdHoareTripleChecker+Valid, 23350 SdHoareTripleChecker+Invalid, 13312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 520 IncrementalHoareTripleChecker+Valid, 12792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:55:09,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2420 Valid, 23350 Invalid, 13312 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [520 Valid, 12792 Invalid, 0 Unknown, 0 Unchecked, 15.7s Time] [2024-11-28 02:55:09,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5753 states. [2024-11-28 02:55:10,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5753 to 5735. [2024-11-28 02:55:10,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5735 states, 3445 states have (on average 1.8522496371552974) internal successors, (6381), 5725 states have internal predecessors, (6381), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 3 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-28 02:55:10,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5735 states to 5735 states and 10393 transitions. [2024-11-28 02:55:10,201 INFO L78 Accepts]: Start accepts. Automaton has 5735 states and 10393 transitions. Word has length 97 [2024-11-28 02:55:10,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:55:10,202 INFO L471 AbstractCegarLoop]: Abstraction has 5735 states and 10393 transitions. [2024-11-28 02:55:10,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 9.68421052631579) internal successors, (184), 22 states have internal predecessors, (184), 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:55:10,202 INFO L276 IsEmpty]: Start isEmpty. Operand 5735 states and 10393 transitions. [2024-11-28 02:55:10,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-28 02:55:10,203 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:55:10,203 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:55:10,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-28 02:55:10,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:55:10,411 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:55:10,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:10,413 INFO L85 PathProgramCache]: Analyzing trace with hash 2127100652, now seen corresponding path program 1 times [2024-11-28 02:55:10,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:10,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74031669] [2024-11-28 02:55:10,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:10,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:11,339 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:55:11,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:11,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74031669] [2024-11-28 02:55:11,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74031669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:11,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:11,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 02:55:11,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751416947] [2024-11-28 02:55:11,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:11,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 02:55:11,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:11,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 02:55:11,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-28 02:55:11,341 INFO L87 Difference]: Start difference. First operand 5735 states and 10393 transitions. Second operand has 15 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:55:21,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:55:21,197 INFO L93 Difference]: Finished difference Result 5760 states and 10424 transitions. [2024-11-28 02:55:21,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:55:21,202 INFO L78 Accepts]: Start accepts. Automaton has has 15 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:55:21,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:55:21,217 INFO L225 Difference]: With dead ends: 5760 [2024-11-28 02:55:21,217 INFO L226 Difference]: Without dead ends: 5760 [2024-11-28 02:55:21,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-28 02:55:21,221 INFO L435 NwaCegarLoop]: 2618 mSDtfsCounter, 1893 mSDsluCounter, 14322 mSDsCounter, 0 mSdLazyCounter, 9770 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2397 SdHoareTripleChecker+Valid, 16940 SdHoareTripleChecker+Invalid, 10284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 9770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:55:21,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2397 Valid, 16940 Invalid, 10284 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [514 Valid, 9770 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2024-11-28 02:55:21,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5760 states. [2024-11-28 02:55:21,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5760 to 5756. [2024-11-28 02:55:21,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5756 states, 3465 states have (on average 1.8481962481962482) internal successors, (6404), 5744 states have internal predecessors, (6404), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-28 02:55:21,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5756 states to 5756 states and 10418 transitions. [2024-11-28 02:55:21,935 INFO L78 Accepts]: Start accepts. Automaton has 5756 states and 10418 transitions. Word has length 99 [2024-11-28 02:55:21,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:55:21,935 INFO L471 AbstractCegarLoop]: Abstraction has 5756 states and 10418 transitions. [2024-11-28 02:55:21,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 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:55:21,936 INFO L276 IsEmpty]: Start isEmpty. Operand 5756 states and 10418 transitions. [2024-11-28 02:55:21,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-28 02:55:21,937 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:55:21,937 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:55:21,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 02:55:21,937 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:55:21,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:21,941 INFO L85 PathProgramCache]: Analyzing trace with hash 2127100653, now seen corresponding path program 1 times [2024-11-28 02:55:21,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:21,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304617762] [2024-11-28 02:55:21,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:21,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:23,124 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:55:23,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:23,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304617762] [2024-11-28 02:55:23,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304617762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:23,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:23,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 02:55:23,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116656502] [2024-11-28 02:55:23,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:23,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 02:55:23,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:23,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 02:55:23,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-28 02:55:23,128 INFO L87 Difference]: Start difference. First operand 5756 states and 10418 transitions. Second operand has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 12 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:55:32,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:55:32,366 INFO L93 Difference]: Finished difference Result 5759 states and 10422 transitions. [2024-11-28 02:55:32,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 02:55:32,366 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 12 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:55:32,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:55:32,376 INFO L225 Difference]: With dead ends: 5759 [2024-11-28 02:55:32,376 INFO L226 Difference]: Without dead ends: 5759 [2024-11-28 02:55:32,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-11-28 02:55:32,377 INFO L435 NwaCegarLoop]: 2622 mSDtfsCounter, 1885 mSDsluCounter, 13190 mSDsCounter, 0 mSdLazyCounter, 7914 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2389 SdHoareTripleChecker+Valid, 15812 SdHoareTripleChecker+Invalid, 8426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 7914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:55:32,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2389 Valid, 15812 Invalid, 8426 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [512 Valid, 7914 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2024-11-28 02:55:32,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5759 states. [2024-11-28 02:55:33,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5759 to 5756. [2024-11-28 02:55:33,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5756 states, 3465 states have (on average 1.8476190476190477) internal successors, (6402), 5744 states have internal predecessors, (6402), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-28 02:55:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5756 states to 5756 states and 10416 transitions. [2024-11-28 02:55:33,080 INFO L78 Accepts]: Start accepts. Automaton has 5756 states and 10416 transitions. Word has length 99 [2024-11-28 02:55:33,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:55:33,080 INFO L471 AbstractCegarLoop]: Abstraction has 5756 states and 10416 transitions. [2024-11-28 02:55:33,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 12 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:55:33,080 INFO L276 IsEmpty]: Start isEmpty. Operand 5756 states and 10416 transitions. [2024-11-28 02:55:33,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-28 02:55:33,081 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:55:33,081 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:55:33,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 02:55:33,082 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:55:33,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:33,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1284758500, now seen corresponding path program 1 times [2024-11-28 02:55:33,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:33,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43065380] [2024-11-28 02:55:33,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:33,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:33,961 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:55:33,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:33,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43065380] [2024-11-28 02:55:33,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43065380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:55:33,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539485912] [2024-11-28 02:55:33,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:33,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:55:33,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:55:33,965 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:55:33,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 02:55:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:34,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-28 02:55:34,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:55:34,507 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:55:34,507 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:55:34,561 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:55:34,696 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:55:34,925 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:55:34,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 42 treesize of output 41 [2024-11-28 02:55:35,055 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:55:35,055 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:55:35,155 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:55:35,156 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:55:35,179 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:55:35,234 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:55:35,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:55:35,252 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1475 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1475) |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:55:35,335 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1474))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1475)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:55:35,346 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1474))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1475)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:55:35,387 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1478))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1474)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1475)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:55:35,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539485912] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:55:35,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:55:35,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 23 [2024-11-28 02:55:35,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956251203] [2024-11-28 02:55:35,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:55:35,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 02:55:35,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:35,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 02:55:35,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=505, Unknown=12, NotChecked=196, Total=812 [2024-11-28 02:55:35,391 INFO L87 Difference]: Start difference. First operand 5756 states and 10416 transitions. Second operand has 24 states, 21 states have (on average 6.238095238095238) internal successors, (131), 23 states have internal predecessors, (131), 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:56:01,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:56:01,620 INFO L93 Difference]: Finished difference Result 5758 states and 10420 transitions. [2024-11-28 02:56:01,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:56:01,621 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 6.238095238095238) internal successors, (131), 23 states have internal predecessors, (131), 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:56:01,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:56:01,630 INFO L225 Difference]: With dead ends: 5758 [2024-11-28 02:56:01,630 INFO L226 Difference]: Without dead ends: 5758 [2024-11-28 02:56:01,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=639, Unknown=12, NotChecked=220, Total=992 [2024-11-28 02:56:01,632 INFO L435 NwaCegarLoop]: 2617 mSDtfsCounter, 1888 mSDsluCounter, 26044 mSDsCounter, 0 mSdLazyCounter, 18192 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2392 SdHoareTripleChecker+Valid, 28661 SdHoareTripleChecker+Invalid, 18707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 18192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:56:01,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2392 Valid, 28661 Invalid, 18707 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [515 Valid, 18192 Invalid, 0 Unknown, 0 Unchecked, 25.6s Time] [2024-11-28 02:56:01,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5758 states. [2024-11-28 02:56:02,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5758 to 5755. [2024-11-28 02:56:02,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5755 states, 3465 states have (on average 1.847041847041847) internal successors, (6400), 5743 states have internal predecessors, (6400), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-28 02:56:02,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5755 states to 5755 states and 10414 transitions. [2024-11-28 02:56:02,229 INFO L78 Accepts]: Start accepts. Automaton has 5755 states and 10414 transitions. Word has length 100 [2024-11-28 02:56:02,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:56:02,230 INFO L471 AbstractCegarLoop]: Abstraction has 5755 states and 10414 transitions. [2024-11-28 02:56:02,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 6.238095238095238) internal successors, (131), 23 states have internal predecessors, (131), 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:56:02,230 INFO L276 IsEmpty]: Start isEmpty. Operand 5755 states and 10414 transitions. [2024-11-28 02:56:02,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-28 02:56:02,232 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:56:02,232 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:56:02,246 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 02:56:02,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-28 02:56:02,433 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:56:02,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:56:02,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1284758501, now seen corresponding path program 1 times [2024-11-28 02:56:02,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:56:02,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300976852] [2024-11-28 02:56:02,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:56:02,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:56:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:56:03,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:56:03,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:56:03,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300976852] [2024-11-28 02:56:03,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300976852] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:56:03,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520321477] [2024-11-28 02:56:03,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:56:03,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:56:03,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:56:03,743 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:56:03,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 02:56:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:56:04,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-28 02:56:04,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:56:04,354 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:56:04,355 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:56:04,363 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:56:04,413 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:56:04,418 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:56:04,570 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:56:04,577 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:56:04,760 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:56:04,761 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:56:04,776 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:56:04,913 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:56:04,914 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:56:04,925 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:56:05,016 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:56:05,017 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:56:05,034 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:56:05,064 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:56:05,070 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:56:05,099 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:56:05,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:56:05,214 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1643 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 02:56:05,233 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1643 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))) is different from false [2024-11-28 02:56:05,273 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1641))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1642) .cse0 v_ArrVal_1643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1642) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1641) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2024-11-28 02:56:05,529 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ 8 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1649))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1650) .cse0 v_ArrVal_1642) (select (select (store .cse1 .cse0 v_ArrVal_1641) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1643))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1649))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1641))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 12 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1650) .cse3 v_ArrVal_1642) .cse4 v_ArrVal_1643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-28 02:56:05,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520321477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:56:05,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:56:05,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2024-11-28 02:56:05,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580089388] [2024-11-28 02:56:05,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:56:05,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 02:56:05,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:56:05,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 02:56:05,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=511, Unknown=11, NotChecked=196, Total=812 [2024-11-28 02:56:05,538 INFO L87 Difference]: Start difference. First operand 5755 states and 10414 transitions. Second operand has 22 states, 19 states have (on average 6.894736842105263) internal successors, (131), 22 states have internal predecessors, (131), 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:56:34,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:56:34,466 INFO L93 Difference]: Finished difference Result 5757 states and 10418 transitions. [2024-11-28 02:56:34,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:56:34,467 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 6.894736842105263) internal successors, (131), 22 states have internal predecessors, (131), 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:56:34,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:56:34,477 INFO L225 Difference]: With dead ends: 5757 [2024-11-28 02:56:34,477 INFO L226 Difference]: Without dead ends: 5757 [2024-11-28 02:56:34,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=152, Invalid=783, Unknown=11, NotChecked=244, Total=1190 [2024-11-28 02:56:34,478 INFO L435 NwaCegarLoop]: 2620 mSDtfsCounter, 1904 mSDsluCounter, 25419 mSDsCounter, 0 mSdLazyCounter, 13953 mSolverCounterSat, 1023 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2408 SdHoareTripleChecker+Valid, 28039 SdHoareTripleChecker+Invalid, 14976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1023 IncrementalHoareTripleChecker+Valid, 13953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:56:34,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2408 Valid, 28039 Invalid, 14976 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1023 Valid, 13953 Invalid, 0 Unknown, 0 Unchecked, 28.2s Time] [2024-11-28 02:56:34,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5757 states. [2024-11-28 02:56:35,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5757 to 5733. [2024-11-28 02:56:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5733 states, 3445 states have (on average 1.851088534107402) internal successors, (6377), 5723 states have internal predecessors, (6377), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 3 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-28 02:56:35,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5733 states to 5733 states and 10389 transitions. [2024-11-28 02:56:35,050 INFO L78 Accepts]: Start accepts. Automaton has 5733 states and 10389 transitions. Word has length 100 [2024-11-28 02:56:35,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:56:35,050 INFO L471 AbstractCegarLoop]: Abstraction has 5733 states and 10389 transitions. [2024-11-28 02:56:35,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 6.894736842105263) internal successors, (131), 22 states have internal predecessors, (131), 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:56:35,051 INFO L276 IsEmpty]: Start isEmpty. Operand 5733 states and 10389 transitions. [2024-11-28 02:56:35,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-28 02:56:35,052 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:56:35,052 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:56:35,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 02:56:35,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-28 02:56:35,253 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:56:35,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:56:35,253 INFO L85 PathProgramCache]: Analyzing trace with hash 508698928, now seen corresponding path program 1 times [2024-11-28 02:56:35,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:56:35,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18541049] [2024-11-28 02:56:35,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:56:35,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:56:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:56:36,127 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:56:36,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:56:36,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18541049] [2024-11-28 02:56:36,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18541049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:56:36,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:56:36,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 02:56:36,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015715300] [2024-11-28 02:56:36,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:56:36,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 02:56:36,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:56:36,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 02:56:36,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-28 02:56:36,129 INFO L87 Difference]: Start difference. First operand 5733 states and 10389 transitions. Second operand has 16 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:56:47,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:56:47,292 INFO L93 Difference]: Finished difference Result 5764 states and 10426 transitions. [2024-11-28 02:56:47,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:56:47,293 INFO L78 Accepts]: Start accepts. Automaton has has 16 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:56:47,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:56:47,303 INFO L225 Difference]: With dead ends: 5764 [2024-11-28 02:56:47,304 INFO L226 Difference]: Without dead ends: 5764 [2024-11-28 02:56:47,304 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:56:47,304 INFO L435 NwaCegarLoop]: 2617 mSDtfsCounter, 1888 mSDsluCounter, 18029 mSDsCounter, 0 mSdLazyCounter, 11982 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2392 SdHoareTripleChecker+Valid, 20646 SdHoareTripleChecker+Invalid, 12495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 11982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:56:47,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2392 Valid, 20646 Invalid, 12495 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [513 Valid, 11982 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2024-11-28 02:56:47,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5764 states. [2024-11-28 02:56:47,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5764 to 5760. [2024-11-28 02:56:48,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5760 states, 3471 states have (on average 1.8455776433304523) internal successors, (6406), 5748 states have internal predecessors, (6406), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-28 02:56:48,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5760 states to 5760 states and 10420 transitions. [2024-11-28 02:56:48,016 INFO L78 Accepts]: Start accepts. Automaton has 5760 states and 10420 transitions. Word has length 102 [2024-11-28 02:56:48,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:56:48,016 INFO L471 AbstractCegarLoop]: Abstraction has 5760 states and 10420 transitions. [2024-11-28 02:56:48,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 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:56:48,016 INFO L276 IsEmpty]: Start isEmpty. Operand 5760 states and 10420 transitions. [2024-11-28 02:56:48,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-28 02:56:48,017 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:56:48,018 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:56:48,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-28 02:56:48,018 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:56:48,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:56:48,018 INFO L85 PathProgramCache]: Analyzing trace with hash 508698929, now seen corresponding path program 1 times [2024-11-28 02:56:48,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:56:48,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796558146] [2024-11-28 02:56:48,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:56:48,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:56:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:56:49,184 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:56:49,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:56:49,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796558146] [2024-11-28 02:56:49,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796558146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:56:49,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:56:49,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 02:56:49,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063207249] [2024-11-28 02:56:49,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:56:49,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 02:56:49,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:56:49,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 02:56:49,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-28 02:56:49,189 INFO L87 Difference]: Start difference. First operand 5760 states and 10420 transitions. Second operand has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 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:56:57,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:56:57,864 INFO L93 Difference]: Finished difference Result 5763 states and 10424 transitions. [2024-11-28 02:56:57,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 02:56:57,864 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 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:56:57,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:56:57,873 INFO L225 Difference]: With dead ends: 5763 [2024-11-28 02:56:57,873 INFO L226 Difference]: Without dead ends: 5763 [2024-11-28 02:56:57,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-28 02:56:57,873 INFO L435 NwaCegarLoop]: 2621 mSDtfsCounter, 1905 mSDsluCounter, 11615 mSDsCounter, 0 mSdLazyCounter, 6557 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2409 SdHoareTripleChecker+Valid, 14236 SdHoareTripleChecker+Invalid, 7069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 6557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:56:57,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2409 Valid, 14236 Invalid, 7069 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [512 Valid, 6557 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2024-11-28 02:56:57,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5763 states. [2024-11-28 02:56:58,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5763 to 5760. [2024-11-28 02:56:58,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5760 states, 3471 states have (on average 1.8450014405070585) internal successors, (6404), 5748 states have internal predecessors, (6404), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-28 02:56:58,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5760 states to 5760 states and 10418 transitions. [2024-11-28 02:56:58,386 INFO L78 Accepts]: Start accepts. Automaton has 5760 states and 10418 transitions. Word has length 102 [2024-11-28 02:56:58,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:56:58,387 INFO L471 AbstractCegarLoop]: Abstraction has 5760 states and 10418 transitions. [2024-11-28 02:56:58,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 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:56:58,387 INFO L276 IsEmpty]: Start isEmpty. Operand 5760 states and 10418 transitions. [2024-11-28 02:56:58,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-28 02:56:58,387 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:56:58,388 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:56:58,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 02:56:58,388 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:56:58,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:56:58,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1787559224, now seen corresponding path program 1 times [2024-11-28 02:56:58,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:56:58,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955342295] [2024-11-28 02:56:58,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:56:58,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:56:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:56:59,327 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:56:59,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:56:59,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955342295] [2024-11-28 02:56:59,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955342295] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:56:59,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379370828] [2024-11-28 02:56:59,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:56:59,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:56:59,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:56:59,331 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:56:59,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 02:56:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:56:59,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-28 02:56:59,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:56:59,871 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:56:59,872 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:56:59,907 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:57:00,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 22 treesize of output 10 [2024-11-28 02:57:00,188 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:57:00,188 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:57:00,311 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:57:00,311 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:57:00,389 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:57:00,389 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:57:00,470 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:57:00,470 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:57:00,490 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:57:00,585 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:57:00,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:57:00,600 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1980 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_1980) |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:57:00,609 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1980 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1980) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-28 02:57:00,751 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1980 (Array Int Int)) (v_ArrVal_1979 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1978))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1979)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1980)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:57:00,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379370828] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:57:01,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:57:01,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 25 [2024-11-28 02:57:01,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914234011] [2024-11-28 02:57:01,000 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:57:01,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 02:57:01,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:57:01,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 02:57:01,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=690, Unknown=63, NotChecked=174, Total=1056 [2024-11-28 02:57:01,002 INFO L87 Difference]: Start difference. First operand 5760 states and 10418 transitions. Second operand has 26 states, 23 states have (on average 5.956521739130435) internal successors, (137), 25 states have internal predecessors, (137), 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:57:15,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:57:15,948 INFO L93 Difference]: Finished difference Result 5762 states and 10422 transitions. [2024-11-28 02:57:15,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 02:57:15,948 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 5.956521739130435) internal successors, (137), 25 states have internal predecessors, (137), 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:57:15,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:57:15,959 INFO L225 Difference]: With dead ends: 5762 [2024-11-28 02:57:15,959 INFO L226 Difference]: Without dead ends: 5762 [2024-11-28 02:57:15,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=152, Invalid=849, Unknown=67, NotChecked=192, Total=1260 [2024-11-28 02:57:15,960 INFO L435 NwaCegarLoop]: 2616 mSDtfsCounter, 1869 mSDsluCounter, 20718 mSDsCounter, 0 mSdLazyCounter, 14660 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2373 SdHoareTripleChecker+Valid, 23334 SdHoareTripleChecker+Invalid, 15177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 14660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:57:15,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2373 Valid, 23334 Invalid, 15177 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [517 Valid, 14660 Invalid, 0 Unknown, 0 Unchecked, 14.4s Time] [2024-11-28 02:57:15,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5762 states. [2024-11-28 02:57:16,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5762 to 5759. [2024-11-28 02:57:16,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5759 states, 3471 states have (on average 1.8444252376836647) internal successors, (6402), 5747 states have internal predecessors, (6402), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-28 02:57:16,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5759 states to 5759 states and 10416 transitions. [2024-11-28 02:57:16,657 INFO L78 Accepts]: Start accepts. Automaton has 5759 states and 10416 transitions. Word has length 103 [2024-11-28 02:57:16,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:57:16,657 INFO L471 AbstractCegarLoop]: Abstraction has 5759 states and 10416 transitions. [2024-11-28 02:57:16,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 5.956521739130435) internal successors, (137), 25 states have internal predecessors, (137), 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:57:16,658 INFO L276 IsEmpty]: Start isEmpty. Operand 5759 states and 10416 transitions. [2024-11-28 02:57:16,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-28 02:57:16,659 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:57:16,659 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:57:16,673 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-28 02:57:16,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-28 02:57:16,859 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:57:16,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:57:16,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1787559225, now seen corresponding path program 1 times [2024-11-28 02:57:16,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:57:16,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831426345] [2024-11-28 02:57:16,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:57:16,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:57:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:57:18,167 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:57:18,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:57:18,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831426345] [2024-11-28 02:57:18,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831426345] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:57:18,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880400496] [2024-11-28 02:57:18,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:57:18,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:57:18,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:57:18,170 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:57:18,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 02:57:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:57:18,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-28 02:57:18,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:57:18,688 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:57:18,701 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:57:18,702 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:57:18,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:57:18,724 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:57:18,811 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:57:18,817 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:57:18,960 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:57:18,961 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:57:18,968 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:57:19,076 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:57:19,076 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:57:19,087 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:57:19,171 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:57:19,171 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:57:19,182 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:57:19,280 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:57:19,280 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:57:19,291 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:57:19,313 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:57:19,323 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:57:19,332 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:57:19,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:57:19,427 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2163 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))))) is different from false [2024-11-28 02:57:19,442 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2162) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2163 (Array Int Int))) (<= 0 (+ 20 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-28 02:57:19,474 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2160 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2161))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2160) .cse0 v_ArrVal_2163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2162) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2160 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2160) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2161) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-11-28 02:57:19,610 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2160 (Array Int Int)) (v_ArrVal_2159 (Array Int Int)) (v_ArrVal_2158 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2159))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2158) .cse0 v_ArrVal_2160) (select (select (store .cse1 .cse0 v_ArrVal_2161) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2163))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_2160 (Array Int Int)) (v_ArrVal_2159 (Array Int Int)) (v_ArrVal_2158 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2159))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2161))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2158) .cse3 v_ArrVal_2160) .cse4 v_ArrVal_2163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2162) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-28 02:57:19,666 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2160 (Array Int Int)) (v_ArrVal_2159 (Array Int Int)) (v_ArrVal_2158 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2159))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2158) .cse1 v_ArrVal_2160) (select (select (store .cse2 .cse1 v_ArrVal_2161) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2163))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_2160 (Array Int Int)) (v_ArrVal_2159 (Array Int Int)) (v_ArrVal_2158 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2159))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2161))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2158) .cse4 v_ArrVal_2160) .cse5 v_ArrVal_2163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2162) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2024-11-28 02:57:19,774 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2160 (Array Int Int)) (v_ArrVal_2159 (Array Int Int)) (v_ArrVal_2169 (Array Int Int)) (v_ArrVal_2158 (Array Int Int)) (v_ArrVal_2168 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2169))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2159))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2168) .cse0 v_ArrVal_2158) .cse1 v_ArrVal_2160) (select (select (store .cse2 .cse1 v_ArrVal_2161) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2163))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_2160 (Array Int Int)) (v_ArrVal_2159 (Array Int Int)) (v_ArrVal_2169 (Array Int Int)) (v_ArrVal_2158 (Array Int Int)) (v_ArrVal_2168 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2169))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2159))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2161))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2168) .cse5 v_ArrVal_2158) .cse6 v_ArrVal_2160) .cse7 v_ArrVal_2163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2162) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-28 02:57:19,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880400496] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:57:19,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:57:19,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 20 [2024-11-28 02:57:19,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797657861] [2024-11-28 02:57:19,778 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:57:19,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 02:57:19,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:57:19,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 02:57:19,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=461, Unknown=12, NotChecked=294, Total=870 [2024-11-28 02:57:19,779 INFO L87 Difference]: Start difference. First operand 5759 states and 10416 transitions. Second operand has 21 states, 18 states have (on average 7.111111111111111) internal successors, (128), 21 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:57:31,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:57:31,629 INFO L93 Difference]: Finished difference Result 5761 states and 10420 transitions. [2024-11-28 02:57:31,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:57:31,630 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 7.111111111111111) internal successors, (128), 21 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 103 [2024-11-28 02:57:31,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:57:31,642 INFO L225 Difference]: With dead ends: 5761 [2024-11-28 02:57:31,642 INFO L226 Difference]: Without dead ends: 5761 [2024-11-28 02:57:31,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=164, Invalid=778, Unknown=12, NotChecked=378, Total=1332 [2024-11-28 02:57:31,643 INFO L435 NwaCegarLoop]: 2619 mSDtfsCounter, 1900 mSDsluCounter, 13202 mSDsCounter, 0 mSdLazyCounter, 7908 mSolverCounterSat, 1022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2404 SdHoareTripleChecker+Valid, 15821 SdHoareTripleChecker+Invalid, 8930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1022 IncrementalHoareTripleChecker+Valid, 7908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:57:31,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2404 Valid, 15821 Invalid, 8930 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1022 Valid, 7908 Invalid, 0 Unknown, 0 Unchecked, 11.3s Time] [2024-11-28 02:57:31,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5761 states. [2024-11-28 02:57:32,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5761 to 5731. [2024-11-28 02:57:32,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5731 states, 3445 states have (on average 1.8499274310595066) internal successors, (6373), 5721 states have internal predecessors, (6373), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 3 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-28 02:57:32,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5731 states to 5731 states and 10385 transitions. [2024-11-28 02:57:32,263 INFO L78 Accepts]: Start accepts. Automaton has 5731 states and 10385 transitions. Word has length 103 [2024-11-28 02:57:32,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:57:32,264 INFO L471 AbstractCegarLoop]: Abstraction has 5731 states and 10385 transitions. [2024-11-28 02:57:32,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 7.111111111111111) internal successors, (128), 21 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:57:32,264 INFO L276 IsEmpty]: Start isEmpty. Operand 5731 states and 10385 transitions. [2024-11-28 02:57:32,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-28 02:57:32,265 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:57:32,265 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:57:32,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-28 02:57:32,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-28 02:57:32,466 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:57:32,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:57:32,471 INFO L85 PathProgramCache]: Analyzing trace with hash 2050602354, now seen corresponding path program 1 times [2024-11-28 02:57:32,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:57:32,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817756262] [2024-11-28 02:57:32,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:57:32,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:57:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:57:33,504 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:57:33,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:57:33,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817756262] [2024-11-28 02:57:33,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817756262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:57:33,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:57:33,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 02:57:33,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845379082] [2024-11-28 02:57:33,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:57:33,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 02:57:33,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:57:33,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 02:57:33,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-28 02:57:33,506 INFO L87 Difference]: Start difference. First operand 5731 states and 10385 transitions. Second operand has 16 states, 14 states have (on average 7.428571428571429) internal successors, (104), 15 states have internal predecessors, (104), 1 states have call successors, (1), 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:57:49,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:57:49,421 INFO L93 Difference]: Finished difference Result 5770 states and 10430 transitions. [2024-11-28 02:57:49,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:57:49,421 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.428571428571429) internal successors, (104), 15 states have internal predecessors, (104), 1 states have call successors, (1), 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 106 [2024-11-28 02:57:49,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:57:49,434 INFO L225 Difference]: With dead ends: 5770 [2024-11-28 02:57:49,434 INFO L226 Difference]: Without dead ends: 5770 [2024-11-28 02:57:49,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2024-11-28 02:57:49,435 INFO L435 NwaCegarLoop]: 2615 mSDtfsCounter, 1891 mSDsluCounter, 16485 mSDsCounter, 0 mSdLazyCounter, 14003 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2395 SdHoareTripleChecker+Valid, 19100 SdHoareTripleChecker+Invalid, 14520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 14003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:57:49,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2395 Valid, 19100 Invalid, 14520 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [517 Valid, 14003 Invalid, 0 Unknown, 0 Unchecked, 15.4s Time] [2024-11-28 02:57:49,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5770 states. [2024-11-28 02:57:49,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5770 to 5766. [2024-11-28 02:57:49,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5766 states, 3479 states have (on average 1.8424834722621444) internal successors, (6410), 5754 states have internal predecessors, (6410), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-28 02:57:49,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5766 states to 5766 states and 10424 transitions. [2024-11-28 02:57:49,940 INFO L78 Accepts]: Start accepts. Automaton has 5766 states and 10424 transitions. Word has length 106 [2024-11-28 02:57:49,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:57:49,940 INFO L471 AbstractCegarLoop]: Abstraction has 5766 states and 10424 transitions. [2024-11-28 02:57:49,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.428571428571429) internal successors, (104), 15 states have internal predecessors, (104), 1 states have call successors, (1), 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:57:49,940 INFO L276 IsEmpty]: Start isEmpty. Operand 5766 states and 10424 transitions. [2024-11-28 02:57:49,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-28 02:57:49,941 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:57:49,941 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:57:49,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-28 02:57:49,941 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:57:49,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:57:49,942 INFO L85 PathProgramCache]: Analyzing trace with hash 2050602355, now seen corresponding path program 1 times [2024-11-28 02:57:49,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:57:49,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437899487] [2024-11-28 02:57:49,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:57:49,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:57:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:57:51,053 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:57:51,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:57:51,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437899487] [2024-11-28 02:57:51,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437899487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:57:51,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:57:51,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 02:57:51,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571027367] [2024-11-28 02:57:51,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:57:51,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 02:57:51,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:57:51,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 02:57:51,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-28 02:57:51,055 INFO L87 Difference]: Start difference. First operand 5766 states and 10424 transitions. Second operand has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 1 states have call successors, (1), 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:58:16,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:58:16,611 INFO L93 Difference]: Finished difference Result 5769 states and 10428 transitions. [2024-11-28 02:58:16,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 02:58:16,612 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 1 states have call successors, (1), 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 106 [2024-11-28 02:58:16,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:58:16,620 INFO L225 Difference]: With dead ends: 5769 [2024-11-28 02:58:16,620 INFO L226 Difference]: Without dead ends: 5769 [2024-11-28 02:58:16,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-28 02:58:16,621 INFO L435 NwaCegarLoop]: 2617 mSDtfsCounter, 1887 mSDsluCounter, 20029 mSDsCounter, 0 mSdLazyCounter, 16400 mSolverCounterSat, 516 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2391 SdHoareTripleChecker+Valid, 22646 SdHoareTripleChecker+Invalid, 16916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 516 IncrementalHoareTripleChecker+Valid, 16400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:58:16,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2391 Valid, 22646 Invalid, 16916 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [516 Valid, 16400 Invalid, 0 Unknown, 0 Unchecked, 24.9s Time] [2024-11-28 02:58:16,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5769 states. [2024-11-28 02:58:17,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5769 to 5766. [2024-11-28 02:58:17,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5766 states, 3479 states have (on average 1.841908594423685) internal successors, (6408), 5754 states have internal predecessors, (6408), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-28 02:58:17,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5766 states to 5766 states and 10422 transitions. [2024-11-28 02:58:17,056 INFO L78 Accepts]: Start accepts. Automaton has 5766 states and 10422 transitions. Word has length 106 [2024-11-28 02:58:17,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:58:17,056 INFO L471 AbstractCegarLoop]: Abstraction has 5766 states and 10422 transitions. [2024-11-28 02:58:17,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 1 states have call successors, (1), 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:58:17,056 INFO L276 IsEmpty]: Start isEmpty. Operand 5766 states and 10422 transitions. [2024-11-28 02:58:17,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-28 02:58:17,057 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:58:17,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:58:17,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-28 02:58:17,057 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:58:17,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:58:17,058 INFO L85 PathProgramCache]: Analyzing trace with hash 513166714, now seen corresponding path program 1 times [2024-11-28 02:58:17,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:58:17,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540855809] [2024-11-28 02:58:17,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:58:17,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:58:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:58:18,027 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:58:18,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:58:18,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540855809] [2024-11-28 02:58:18,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540855809] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:58:18,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273884780] [2024-11-28 02:58:18,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:58:18,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:58:18,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:58:18,031 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:58:18,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 02:58:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:58:18,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-28 02:58:18,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:58:18,534 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:58:18,534 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:58:18,574 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:58:18,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 02:58:18,846 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:58:18,846 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:58:18,945 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:58:18,945 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:58:19,040 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:58:19,040 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:58:19,127 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:58:19,127 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:58:19,204 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:58:19,204 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:58:19,222 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:58:19,320 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-28 02:58:19,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-11-28 02:58:19,329 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:58:19,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:58:20,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273884780] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:58:20,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:58:20,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 26 [2024-11-28 02:58:20,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046102918] [2024-11-28 02:58:20,283 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:58:20,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-28 02:58:20,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:58:20,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-28 02:58:20,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1160, Unknown=55, NotChecked=0, Total=1406 [2024-11-28 02:58:20,285 INFO L87 Difference]: Start difference. First operand 5766 states and 10422 transitions. Second operand has 27 states, 24 states have (on average 6.041666666666667) internal successors, (145), 26 states have internal predecessors, (145), 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:58:38,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:58:38,489 INFO L93 Difference]: Finished difference Result 5768 states and 10426 transitions. [2024-11-28 02:58:38,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 02:58:38,489 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 6.041666666666667) internal successors, (145), 26 states have internal predecessors, (145), 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 107 [2024-11-28 02:58:38,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:58:38,497 INFO L225 Difference]: With dead ends: 5768 [2024-11-28 02:58:38,497 INFO L226 Difference]: Without dead ends: 5768 [2024-11-28 02:58:38,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=217, Invalid=1368, Unknown=55, NotChecked=0, Total=1640 [2024-11-28 02:58:38,498 INFO L435 NwaCegarLoop]: 2615 mSDtfsCounter, 1858 mSDsluCounter, 19730 mSDsCounter, 0 mSdLazyCounter, 16225 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2362 SdHoareTripleChecker+Valid, 22345 SdHoareTripleChecker+Invalid, 16742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 16225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:58:38,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2362 Valid, 22345 Invalid, 16742 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [517 Valid, 16225 Invalid, 0 Unknown, 0 Unchecked, 17.7s Time] [2024-11-28 02:58:38,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5768 states. [2024-11-28 02:58:38,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5768 to 5765. [2024-11-28 02:58:38,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5765 states, 3479 states have (on average 1.8413337165852257) internal successors, (6406), 5753 states have internal predecessors, (6406), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-28 02:58:38,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 10420 transitions. [2024-11-28 02:58:38,961 INFO L78 Accepts]: Start accepts. Automaton has 5765 states and 10420 transitions. Word has length 107 [2024-11-28 02:58:38,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:58:38,961 INFO L471 AbstractCegarLoop]: Abstraction has 5765 states and 10420 transitions. [2024-11-28 02:58:38,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 6.041666666666667) internal successors, (145), 26 states have internal predecessors, (145), 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:58:38,961 INFO L276 IsEmpty]: Start isEmpty. Operand 5765 states and 10420 transitions. [2024-11-28 02:58:38,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-28 02:58:38,962 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:58:38,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:58:38,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-28 02:58:39,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-28 02:58:39,163 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 02:58:39,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:58:39,163 INFO L85 PathProgramCache]: Analyzing trace with hash 513166715, now seen corresponding path program 1 times [2024-11-28 02:58:39,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:58:39,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121030442] [2024-11-28 02:58:39,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:58:39,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:58:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:58:40,450 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:58:40,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:58:40,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121030442] [2024-11-28 02:58:40,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121030442] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:58:40,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542694368] [2024-11-28 02:58:40,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:58:40,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:58:40,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:58:40,453 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:58:40,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 02:58:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:58:40,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-28 02:58:40,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:58:40,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 02:58:40,923 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:58:40,924 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:58:40,985 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:58:40,993 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:58:41,151 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:58:41,157 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:58:41,360 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:58:41,360 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:58:41,372 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:58:41,507 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:58:41,507 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:58:41,518 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:58:41,616 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:58:41,616 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:58:41,625 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:58:41,730 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:58:41,731 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:58:41,738 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:58:41,857 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:58:41,857 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:58:41,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:58:41,890 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:58:41,896 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:58:41,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:58:41,955 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:58:41,971 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-28 02:58:41,971 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:58:42,007 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:58:42,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:58:42,560 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2735 (Array Int Int)) (v_ArrVal_2733 (Array Int Int)) (v_ArrVal_2732 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2732) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2733) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2735) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)))) (forall ((v_ArrVal_2735 (Array Int Int)) (v_ArrVal_2734 (Array Int Int)) (v_ArrVal_2733 (Array Int Int)) (v_ArrVal_2732 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2736 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2733))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2732) .cse1 v_ArrVal_2735) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2736) (select (select (store .cse2 .cse1 v_ArrVal_2734) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))))) is different from false [2024-11-28 02:59:00,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542694368] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:59:00,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:59:00,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 29 [2024-11-28 02:59:00,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503438737] [2024-11-28 02:59:00,369 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:59:00,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-28 02:59:00,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:59:00,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-28 02:59:00,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1408, Unknown=55, NotChecked=78, Total=1722 [2024-11-28 02:59:00,372 INFO L87 Difference]: Start difference. First operand 5765 states and 10420 transitions. Second operand has 30 states, 27 states have (on average 5.37037037037037) internal successors, (145), 29 states have internal predecessors, (145), 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 03:01:50,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:01:50,833 INFO L93 Difference]: Finished difference Result 5767 states and 10424 transitions. [2024-11-28 03:01:50,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 03:01:50,834 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 5.37037037037037) internal successors, (145), 29 states have internal predecessors, (145), 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 107 [2024-11-28 03:01:50,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:01:50,847 INFO L225 Difference]: With dead ends: 5767 [2024-11-28 03:01:50,847 INFO L226 Difference]: Without dead ends: 5767 [2024-11-28 03:01:50,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=308, Invalid=2191, Unknown=55, NotChecked=98, Total=2652 [2024-11-28 03:01:50,849 INFO L435 NwaCegarLoop]: 2615 mSDtfsCounter, 1867 mSDsluCounter, 28847 mSDsCounter, 0 mSdLazyCounter, 23647 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 163.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2371 SdHoareTripleChecker+Valid, 31462 SdHoareTripleChecker+Invalid, 24170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 23647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 167.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:01:50,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2371 Valid, 31462 Invalid, 24170 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [523 Valid, 23647 Invalid, 0 Unknown, 0 Unchecked, 167.1s Time] [2024-11-28 03:01:50,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5767 states. [2024-11-28 03:01:51,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5767 to 5729. [2024-11-28 03:01:51,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5729 states, 3445 states have (on average 1.8487663280116111) internal successors, (6369), 5719 states have internal predecessors, (6369), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 3 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-28 03:01:51,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5729 states to 5729 states and 10381 transitions. [2024-11-28 03:01:51,259 INFO L78 Accepts]: Start accepts. Automaton has 5729 states and 10381 transitions. Word has length 107 [2024-11-28 03:01:51,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:01:51,259 INFO L471 AbstractCegarLoop]: Abstraction has 5729 states and 10381 transitions. [2024-11-28 03:01:51,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 5.37037037037037) internal successors, (145), 29 states have internal predecessors, (145), 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 03:01:51,259 INFO L276 IsEmpty]: Start isEmpty. Operand 5729 states and 10381 transitions. [2024-11-28 03:01:51,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-28 03:01:51,260 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:01:51,260 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:51,268 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 03:01:51,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-28 03:01:51,460 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 03:01:51,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:51,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2119415015, now seen corresponding path program 1 times [2024-11-28 03:01:51,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:51,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040231176] [2024-11-28 03:01:51,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:51,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:53,156 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 03:01:53,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:53,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040231176] [2024-11-28 03:01:53,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040231176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:01:53,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:01:53,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 03:01:53,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080292016] [2024-11-28 03:01:53,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:01:53,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 03:01:53,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:53,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 03:01:53,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-28 03:01:53,159 INFO L87 Difference]: Start difference. First operand 5729 states and 10381 transitions. Second operand has 15 states, 14 states have (on average 7.642857142857143) internal successors, (107), 15 states have internal predecessors, (107), 1 states have call successors, (1), 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 03:03:04,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:04,553 INFO L93 Difference]: Finished difference Result 5774 states and 10432 transitions. [2024-11-28 03:03:04,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 03:03:04,554 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.642857142857143) internal successors, (107), 15 states have internal predecessors, (107), 1 states have call successors, (1), 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 109 [2024-11-28 03:03:04,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:04,563 INFO L225 Difference]: With dead ends: 5774 [2024-11-28 03:03:04,563 INFO L226 Difference]: Without dead ends: 5774 [2024-11-28 03:03:04,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2024-11-28 03:03:04,564 INFO L435 NwaCegarLoop]: 2618 mSDtfsCounter, 1917 mSDsluCounter, 21135 mSDsCounter, 0 mSdLazyCounter, 11236 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2421 SdHoareTripleChecker+Valid, 23753 SdHoareTripleChecker+Invalid, 11754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 11236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 70.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:03:04,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2421 Valid, 23753 Invalid, 11754 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [518 Valid, 11236 Invalid, 0 Unknown, 0 Unchecked, 70.1s Time] [2024-11-28 03:03:04,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5774 states. [2024-11-28 03:03:04,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5774 to 5770. [2024-11-28 03:03:04,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5770 states, 3485 states have (on average 1.8398852223816355) internal successors, (6412), 5758 states have internal predecessors, (6412), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-28 03:03:04,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5770 states to 5770 states and 10426 transitions. [2024-11-28 03:03:04,976 INFO L78 Accepts]: Start accepts. Automaton has 5770 states and 10426 transitions. Word has length 109 [2024-11-28 03:03:04,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:04,976 INFO L471 AbstractCegarLoop]: Abstraction has 5770 states and 10426 transitions. [2024-11-28 03:03:04,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.642857142857143) internal successors, (107), 15 states have internal predecessors, (107), 1 states have call successors, (1), 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 03:03:04,977 INFO L276 IsEmpty]: Start isEmpty. Operand 5770 states and 10426 transitions. [2024-11-28 03:03:04,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-28 03:03:04,977 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:04,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:03:04,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-28 03:03:04,977 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 03:03:04,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:04,978 INFO L85 PathProgramCache]: Analyzing trace with hash -2119415014, now seen corresponding path program 1 times [2024-11-28 03:03:04,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:04,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677370623] [2024-11-28 03:03:04,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:04,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:08,620 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 03:03:08,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:08,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677370623] [2024-11-28 03:03:08,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677370623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:03:08,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:03:08,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 03:03:08,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923950644] [2024-11-28 03:03:08,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:03:08,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 03:03:08,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:08,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 03:03:08,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-28 03:03:08,622 INFO L87 Difference]: Start difference. First operand 5770 states and 10426 transitions. Second operand has 19 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 states have internal predecessors, (107), 1 states have call successors, (1), 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 03:04:34,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:04:34,389 INFO L93 Difference]: Finished difference Result 5773 states and 10430 transitions. [2024-11-28 03:04:34,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 03:04:34,389 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 states have internal predecessors, (107), 1 states have call successors, (1), 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 109 [2024-11-28 03:04:34,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:04:34,399 INFO L225 Difference]: With dead ends: 5773 [2024-11-28 03:04:34,399 INFO L226 Difference]: Without dead ends: 5773 [2024-11-28 03:04:34,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-11-28 03:04:34,399 INFO L435 NwaCegarLoop]: 2616 mSDtfsCounter, 1890 mSDsluCounter, 17117 mSDsCounter, 0 mSdLazyCounter, 12895 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 81.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2394 SdHoareTripleChecker+Valid, 19733 SdHoareTripleChecker+Invalid, 13412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 12895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 83.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:04:34,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2394 Valid, 19733 Invalid, 13412 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [517 Valid, 12895 Invalid, 0 Unknown, 0 Unchecked, 83.8s Time] [2024-11-28 03:04:34,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5773 states. [2024-11-28 03:04:34,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5773 to 5770. [2024-11-28 03:04:34,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5770 states, 3485 states have (on average 1.8393113342898135) internal successors, (6410), 5758 states have internal predecessors, (6410), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-28 03:04:34,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5770 states to 5770 states and 10424 transitions. [2024-11-28 03:04:34,969 INFO L78 Accepts]: Start accepts. Automaton has 5770 states and 10424 transitions. Word has length 109 [2024-11-28 03:04:34,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:04:34,969 INFO L471 AbstractCegarLoop]: Abstraction has 5770 states and 10424 transitions. [2024-11-28 03:04:34,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 states have internal predecessors, (107), 1 states have call successors, (1), 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 03:04:34,969 INFO L276 IsEmpty]: Start isEmpty. Operand 5770 states and 10424 transitions. [2024-11-28 03:04:34,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-28 03:04:34,970 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:04:34,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:04:34,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-28 03:04:34,970 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 03:04:34,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:04:34,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1961645585, now seen corresponding path program 1 times [2024-11-28 03:04:34,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:04:34,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484773032] [2024-11-28 03:04:34,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:04:34,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:04:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:04:35,801 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 03:04:35,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:04:35,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484773032] [2024-11-28 03:04:35,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484773032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:04:35,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:04:35,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:04:35,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609493125] [2024-11-28 03:04:35,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:04:35,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:04:35,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:04:35,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:04:35,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:04:35,803 INFO L87 Difference]: Start difference. First operand 5770 states and 10424 transitions. Second operand has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:04:40,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:04:40,919 INFO L93 Difference]: Finished difference Result 5769 states and 10422 transitions. [2024-11-28 03:04:40,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:04:40,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2024-11-28 03:04:40,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:04:40,932 INFO L225 Difference]: With dead ends: 5769 [2024-11-28 03:04:40,932 INFO L226 Difference]: Without dead ends: 5769 [2024-11-28 03:04:40,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:04:40,933 INFO L435 NwaCegarLoop]: 2954 mSDtfsCounter, 2 mSDsluCounter, 8071 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11025 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:04:40,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11025 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-28 03:04:40,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5769 states. [2024-11-28 03:04:41,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5769 to 5769. [2024-11-28 03:04:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5769 states, 3485 states have (on average 1.8387374461979913) internal successors, (6408), 5757 states have internal predecessors, (6408), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-28 03:04:41,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5769 states to 5769 states and 10422 transitions. [2024-11-28 03:04:41,431 INFO L78 Accepts]: Start accepts. Automaton has 5769 states and 10422 transitions. Word has length 110 [2024-11-28 03:04:41,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:04:41,431 INFO L471 AbstractCegarLoop]: Abstraction has 5769 states and 10422 transitions. [2024-11-28 03:04:41,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:04:41,431 INFO L276 IsEmpty]: Start isEmpty. Operand 5769 states and 10422 transitions. [2024-11-28 03:04:41,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-28 03:04:41,432 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:04:41,432 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:04:41,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-28 03:04:41,432 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 03:04:41,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:04:41,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1961645586, now seen corresponding path program 1 times [2024-11-28 03:04:41,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:04:41,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68325516] [2024-11-28 03:04:41,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:04:41,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:04:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:04:45,600 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 03:04:45,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:04:45,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68325516] [2024-11-28 03:04:45,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68325516] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:04:45,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638376505] [2024-11-28 03:04:45,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:04:45,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:04:45,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:04:45,603 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:04:45,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01fa2f89-1931-47e3-891a-ad01fb11c100/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 03:04:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:04:46,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-28 03:04:46,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:04:46,877 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:04:46,877 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 03:04:46,941 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 03:04:47,174 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 03:04:47,239 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 03:04:48,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-28 03:04:48,069 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 03:04:49,274 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:49,275 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 03:04:49,292 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 03:04:50,051 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:50,051 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 03:04:50,103 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 03:04:50,624 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:50,625 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 03:04:50,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:04:51,227 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:51,227 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 03:04:51,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:04:51,863 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:51,863 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 03:04:51,879 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 03:04:52,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:04:52,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-28 03:04:52,578 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-28 03:04:52,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2024-11-28 03:04:52,930 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:52,930 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 03:04:52,971 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 03:04:53,216 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 03:04:53,230 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 03:04:53,244 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 03:04:53,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:04:55,145 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3234 (Array Int Int)) (v_ArrVal_3235 (Array Int Int))) (or (forall ((v_ArrVal_3236 Int) (v_ArrVal_3237 (Array Int Int)) (v_ArrVal_3238 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3235))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3234) .cse0 v_ArrVal_3238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3236) (select (select (store .cse2 .cse0 v_ArrVal_3237) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0))) (forall ((v_ArrVal_3234 (Array Int Int)) (v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3238 (Array Int Int))) (<= 0 (+ 40 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3234) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-28 03:04:55,761 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0))) (forall ((v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3234 (Array Int Int)) (v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3238 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3232))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3233) .cse0 v_ArrVal_3234) (select (select (store .cse1 .cse0 v_ArrVal_3235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3238))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 40)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3234 (Array Int Int)) (v_ArrVal_3235 (Array Int Int))) (or (forall ((v_ArrVal_3236 Int) (v_ArrVal_3237 (Array Int Int)) (v_ArrVal_3238 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3232))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_3235))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3233) .cse3 v_ArrVal_3234) .cse4 v_ArrVal_3238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3236) (select (select (store .cse5 .cse4 v_ArrVal_3237) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))))) is different from false [2024-11-28 03:04:55,863 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0))) (forall ((v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3234 (Array Int Int)) (v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3238 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3232))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3233) .cse1 v_ArrVal_3234) (select (select (store .cse2 .cse1 v_ArrVal_3235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3238))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3234 (Array Int Int)) (v_ArrVal_3235 (Array Int Int))) (or (forall ((v_ArrVal_3236 Int) (v_ArrVal_3237 (Array Int Int)) (v_ArrVal_3238 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3232))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_3235))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 44 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3233) .cse4 v_ArrVal_3234) .cse5 v_ArrVal_3238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3236) (select (select (store .cse6 .cse5 v_ArrVal_3237) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0))))))) is different from false [2024-11-28 03:04:56,087 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3231 (Array Int Int)) (v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3234 (Array Int Int)) (v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3238 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3230))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_3232))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3231) .cse0 v_ArrVal_3233) .cse1 v_ArrVal_3234) (select (select (store .cse2 .cse1 v_ArrVal_3235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3238))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (forall ((v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3231 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3234 (Array Int Int)) (v_ArrVal_3235 (Array Int Int))) (or (forall ((v_ArrVal_3236 Int) (v_ArrVal_3237 (Array Int Int)) (v_ArrVal_3238 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3230))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_3232))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3235))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 44 (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3231) .cse5 v_ArrVal_3233) .cse6 v_ArrVal_3234) .cse7 v_ArrVal_3238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3236) (select (select (store .cse8 .cse7 v_ArrVal_3237) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))))) is different from false [2024-11-28 03:04:56,224 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0))) (forall ((v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3231 (Array Int Int)) (v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3234 (Array Int Int)) (v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3238 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3230))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3232))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3231) .cse1 v_ArrVal_3233) .cse2 v_ArrVal_3234) (select (select (store .cse3 .cse2 v_ArrVal_3235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3238))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))) (forall ((v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3231 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3234 (Array Int Int)) (v_ArrVal_3235 (Array Int Int))) (or (forall ((v_ArrVal_3236 Int) (v_ArrVal_3237 (Array Int Int)) (v_ArrVal_3238 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3230))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_3232))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_3235))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ 44 (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3231) .cse6 v_ArrVal_3233) .cse7 v_ArrVal_3234) .cse8 v_ArrVal_3238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3236) (select (select (store .cse9 .cse8 v_ArrVal_3237) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0))))))) is different from false [2024-11-28 03:04:58,916 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (forall ((v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3231 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3234 (Array Int Int)) (v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3228 (Array Int Int)) (v_ArrVal_3229 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)) (forall ((v_ArrVal_3236 Int) (v_ArrVal_3237 (Array Int Int)) (v_ArrVal_3238 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3228))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_3230))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_3232))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_3235))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3229) .cse1 v_ArrVal_3231) .cse2 v_ArrVal_3233) .cse3 v_ArrVal_3234) .cse4 v_ArrVal_3238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3236) (select (select (store .cse6 .cse4 v_ArrVal_3237) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))) (or (forall ((v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3231 (Array Int Int)) (v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3234 (Array Int Int)) (v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3238 (Array Int Int)) (v_ArrVal_3228 (Array Int Int)) (v_ArrVal_3229 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse15 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3228))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_3230))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_3232))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3229) .cse10 v_ArrVal_3231) .cse11 v_ArrVal_3233) .cse12 v_ArrVal_3234) (select (select (store .cse13 .cse12 v_ArrVal_3235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3238))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 40))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0))))))) is different from false [2024-11-28 03:04:59,294 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3231 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3243 (Array Int Int)) (v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3244 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3234 (Array Int Int)) (v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3228 (Array Int Int)) (v_ArrVal_3229 (Array Int Int))) (or (forall ((v_ArrVal_3236 Int) (v_ArrVal_3237 (Array Int Int)) (v_ArrVal_3238 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3244))) (let ((.cse0 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse9 (store .cse10 .cse0 v_ArrVal_3228))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_3230))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_3232))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_3235))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (<= (+ 44 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3243) .cse0 v_ArrVal_3229) .cse1 v_ArrVal_3231) .cse2 v_ArrVal_3233) .cse3 v_ArrVal_3234) .cse4 v_ArrVal_3238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3236) (select (select (store .cse6 .cse4 v_ArrVal_3237) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (or (forall ((v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3231 (Array Int Int)) (v_ArrVal_3243 (Array Int Int)) (v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3244 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3234 (Array Int Int)) (v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3238 (Array Int Int)) (v_ArrVal_3228 (Array Int Int)) (v_ArrVal_3229 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse18 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3244))) (let ((.cse11 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse11 v_ArrVal_3228))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse12 v_ArrVal_3230))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_3232))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3243) .cse11 v_ArrVal_3229) .cse12 v_ArrVal_3231) .cse13 v_ArrVal_3233) .cse14 v_ArrVal_3234) (select (select (store .cse15 .cse14 v_ArrVal_3235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3238))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))))) is different from false [2024-11-28 03:04:59,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638376505] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:04:59,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:04:59,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 31 [2024-11-28 03:04:59,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572114361] [2024-11-28 03:04:59,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:04:59,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-28 03:04:59,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:04:59,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-28 03:04:59,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1265, Unknown=30, NotChecked=560, Total=2070 [2024-11-28 03:04:59,306 INFO L87 Difference]: Start difference. First operand 5769 states and 10422 transitions. Second operand has 32 states, 29 states have (on average 5.172413793103448) internal successors, (150), 31 states have internal predecessors, (150), 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)