./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.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_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/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_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/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_04bfb18e-ccb8-4046-9a54-7324c60db734/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 6e14aa3eeddc5d261248d26114db1375e0f229d6456e2c7754877a082dc10921 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:43:16,568 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:43:16,663 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 03:43:16,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:43:16,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:43:16,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:43:16,701 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:43:16,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:43:16,702 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:43:16,702 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:43:16,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:43:16,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:43:16,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:43:16,703 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:43:16,704 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:43:16,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:43:16,704 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:43:16,704 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:43:16,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:43:16,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:43:16,705 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 03:43:16,705 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 03:43:16,705 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 03:43:16,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:43:16,705 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:43:16,705 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:43:16,705 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:43:16,705 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:43:16,705 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:43:16,706 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:43:16,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:43:16,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:43:16,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:43:16,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:43:16,707 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:43:16,707 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:43:16,707 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:43:16,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:43:16,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:43:16,708 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:43:16,708 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:43:16,708 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:43:16,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:43:16,708 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:43:16,709 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:43:16,709 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:43:16,709 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:43:16,709 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_04bfb18e-ccb8-4046-9a54-7324c60db734/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 -> 6e14aa3eeddc5d261248d26114db1375e0f229d6456e2c7754877a082dc10921 [2024-11-28 03:43:17,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:43:17,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:43:17,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:43:17,083 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:43:17,083 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:43:17,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2024-11-28 03:43:20,434 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/data/a1fe7124c/1baca879fc4f4c74a65bac825d621eb0/FLAGfdfb59f59 [2024-11-28 03:43:20,925 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:43:20,928 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2024-11-28 03:43:20,947 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/data/a1fe7124c/1baca879fc4f4c74a65bac825d621eb0/FLAGfdfb59f59 [2024-11-28 03:43:21,028 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/data/a1fe7124c/1baca879fc4f4c74a65bac825d621eb0 [2024-11-28 03:43:21,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:43:21,034 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:43:21,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:43:21,038 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:43:21,045 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:43:21,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:43:21" (1/1) ... [2024-11-28 03:43:21,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fc5679e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:21, skipping insertion in model container [2024-11-28 03:43:21,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:43:21" (1/1) ... [2024-11-28 03:43:21,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:43:21,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:43:21,497 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:43:21,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:43:21,581 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:43:21,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:21 WrapperNode [2024-11-28 03:43:21,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:43:21,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:43:21,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:43:21,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:43:21,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:21" (1/1) ... [2024-11-28 03:43:21,604 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:21" (1/1) ... [2024-11-28 03:43:21,628 INFO L138 Inliner]: procedures = 123, calls = 49, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 147 [2024-11-28 03:43:21,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:43:21,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:43:21,629 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:43:21,629 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:43:21,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:21" (1/1) ... [2024-11-28 03:43:21,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:21" (1/1) ... [2024-11-28 03:43:21,643 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:21" (1/1) ... [2024-11-28 03:43:21,666 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 17 writes are split as follows [0, 17]. [2024-11-28 03:43:21,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:21" (1/1) ... [2024-11-28 03:43:21,666 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:21" (1/1) ... [2024-11-28 03:43:21,676 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:21" (1/1) ... [2024-11-28 03:43:21,677 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:21" (1/1) ... [2024-11-28 03:43:21,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:21" (1/1) ... [2024-11-28 03:43:21,683 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:21" (1/1) ... [2024-11-28 03:43:21,688 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:21" (1/1) ... [2024-11-28 03:43:21,692 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:43:21,693 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:43:21,693 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:43:21,693 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:43:21,694 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:21" (1/1) ... [2024-11-28 03:43:21,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:43:21,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:43:21,749 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:43:21,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:43:21,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 03:43:21,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:43:21,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 03:43:21,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 03:43:21,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 03:43:21,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 03:43:21,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 03:43:21,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:43:21,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 03:43:21,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:43:21,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:43:21,966 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:43:21,968 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:43:22,696 INFO L? ?]: Removed 176 outVars from TransFormulas that were not future-live. [2024-11-28 03:43:22,696 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:43:22,718 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:43:22,719 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-28 03:43:22,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:43:22 BoogieIcfgContainer [2024-11-28 03:43:22,719 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:43:22,725 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:43:22,725 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:43:22,732 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:43:22,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:43:21" (1/3) ... [2024-11-28 03:43:22,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78460e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:43:22, skipping insertion in model container [2024-11-28 03:43:22,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:21" (2/3) ... [2024-11-28 03:43:22,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78460e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:43:22, skipping insertion in model container [2024-11-28 03:43:22,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:43:22" (3/3) ... [2024-11-28 03:43:22,735 INFO L128 eAbstractionObserver]: Analyzing ICFG tree_parent_ptr.i [2024-11-28 03:43:22,758 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:43:22,760 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tree_parent_ptr.i that has 1 procedures, 158 locations, 1 initial locations, 3 loop locations, and 77 error locations. [2024-11-28 03:43:22,855 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:43:22,868 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;@18b4fce7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:43:22,869 INFO L334 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2024-11-28 03:43:22,874 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 80 states have (on average 2.1375) internal successors, (171), 157 states have internal predecessors, (171), 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 03:43:22,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 03:43:22,880 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:22,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 03:43:22,881 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:22,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:22,888 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-28 03:43:22,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:22,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518098249] [2024-11-28 03:43:22,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:22,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:23,089 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:43:23,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:23,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518098249] [2024-11-28 03:43:23,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518098249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:23,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:23,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:43:23,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463522764] [2024-11-28 03:43:23,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:23,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:43:23,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:23,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:43:23,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:43:23,130 INFO L87 Difference]: Start difference. First operand has 158 states, 80 states have (on average 2.1375) internal successors, (171), 157 states have internal predecessors, (171), 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) 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 03:43:23,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:23,441 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2024-11-28 03:43:23,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:43:23,444 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 03:43:23,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:23,456 INFO L225 Difference]: With dead ends: 155 [2024-11-28 03:43:23,456 INFO L226 Difference]: Without dead ends: 153 [2024-11-28 03:43:23,459 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 03:43:23,465 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 99 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:23,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 140 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:43:23,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-28 03:43:23,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-11-28 03:43:23,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 79 states have (on average 2.0632911392405062) internal successors, (163), 152 states have internal predecessors, (163), 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 03:43:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 163 transitions. [2024-11-28 03:43:23,527 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 163 transitions. Word has length 3 [2024-11-28 03:43:23,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:23,527 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 163 transitions. [2024-11-28 03:43:23,528 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 03:43:23,528 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 163 transitions. [2024-11-28 03:43:23,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 03:43:23,529 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:23,529 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 03:43:23,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:43:23,531 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:23,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:23,532 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-28 03:43:23,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:23,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277192031] [2024-11-28 03:43:23,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:23,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:23,656 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:43:23,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:23,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277192031] [2024-11-28 03:43:23,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277192031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:23,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:23,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:43:23,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437120736] [2024-11-28 03:43:23,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:23,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:43:23,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:23,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:43:23,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:43:23,660 INFO L87 Difference]: Start difference. First operand 153 states and 163 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 03:43:23,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:23,864 INFO L93 Difference]: Finished difference Result 150 states and 160 transitions. [2024-11-28 03:43:23,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:43:23,865 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 03:43:23,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:23,866 INFO L225 Difference]: With dead ends: 150 [2024-11-28 03:43:23,867 INFO L226 Difference]: Without dead ends: 150 [2024-11-28 03:43:23,867 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 03:43:23,868 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 94 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:23,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 148 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:43:23,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-28 03:43:23,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-28 03:43:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 79 states have (on average 2.0253164556962027) internal successors, (160), 149 states have internal predecessors, (160), 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 03:43:23,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2024-11-28 03:43:23,879 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 3 [2024-11-28 03:43:23,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:23,879 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2024-11-28 03:43:23,879 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 03:43:23,879 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2024-11-28 03:43:23,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 03:43:23,880 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:23,880 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:43:23,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:43:23,880 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:23,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:23,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1837202379, now seen corresponding path program 1 times [2024-11-28 03:43:23,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:23,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896665849] [2024-11-28 03:43:23,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:23,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:24,031 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:43:24,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:24,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896665849] [2024-11-28 03:43:24,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896665849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:24,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:24,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:43:24,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910131384] [2024-11-28 03:43:24,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:24,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:43:24,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:24,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:43:24,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:43:24,033 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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 03:43:24,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:24,377 INFO L93 Difference]: Finished difference Result 157 states and 169 transitions. [2024-11-28 03:43:24,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:43:24,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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 03:43:24,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:24,379 INFO L225 Difference]: With dead ends: 157 [2024-11-28 03:43:24,379 INFO L226 Difference]: Without dead ends: 157 [2024-11-28 03:43:24,379 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 03:43:24,380 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 179 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:24,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 133 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:43:24,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-28 03:43:24,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 134. [2024-11-28 03:43:24,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 80 states have (on average 1.8125) internal successors, (145), 133 states have internal predecessors, (145), 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 03:43:24,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2024-11-28 03:43:24,390 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 9 [2024-11-28 03:43:24,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:24,391 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2024-11-28 03:43:24,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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 03:43:24,391 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2024-11-28 03:43:24,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 03:43:24,391 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:24,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:43:24,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:43:24,392 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:24,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:24,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1837202380, now seen corresponding path program 1 times [2024-11-28 03:43:24,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:24,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669466762] [2024-11-28 03:43:24,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:24,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:24,784 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:43:24,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:24,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669466762] [2024-11-28 03:43:24,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669466762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:24,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:24,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:43:24,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381922253] [2024-11-28 03:43:24,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:24,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:43:24,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:24,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:43:24,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:43:24,787 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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 03:43:25,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:25,166 INFO L93 Difference]: Finished difference Result 188 states and 206 transitions. [2024-11-28 03:43:25,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:43:25,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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 03:43:25,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:25,168 INFO L225 Difference]: With dead ends: 188 [2024-11-28 03:43:25,168 INFO L226 Difference]: Without dead ends: 188 [2024-11-28 03:43:25,168 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 03:43:25,169 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 188 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:25,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 188 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:43:25,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-28 03:43:25,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2024-11-28 03:43:25,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 117 states have (on average 1.6923076923076923) internal successors, (198), 170 states have internal predecessors, (198), 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 03:43:25,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 198 transitions. [2024-11-28 03:43:25,192 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 198 transitions. Word has length 9 [2024-11-28 03:43:25,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:25,193 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 198 transitions. [2024-11-28 03:43:25,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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 03:43:25,193 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 198 transitions. [2024-11-28 03:43:25,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 03:43:25,193 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:25,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:43:25,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:43:25,194 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:25,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:25,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1837208362, now seen corresponding path program 1 times [2024-11-28 03:43:25,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:25,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69199045] [2024-11-28 03:43:25,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:25,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:25,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 03:43:25,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:25,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69199045] [2024-11-28 03:43:25,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69199045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:25,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:25,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:43:25,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293343707] [2024-11-28 03:43:25,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:25,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:43:25,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:25,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:43:25,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:43:25,343 INFO L87 Difference]: Start difference. First operand 171 states and 198 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 03:43:25,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:25,505 INFO L93 Difference]: Finished difference Result 172 states and 201 transitions. [2024-11-28 03:43:25,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:43:25,506 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 03:43:25,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:25,511 INFO L225 Difference]: With dead ends: 172 [2024-11-28 03:43:25,511 INFO L226 Difference]: Without dead ends: 172 [2024-11-28 03:43:25,512 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 03:43:25,513 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 4 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:25,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 204 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:43:25,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-28 03:43:25,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2024-11-28 03:43:25,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 120 states have (on average 1.675) internal successors, (201), 171 states have internal predecessors, (201), 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 03:43:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 201 transitions. [2024-11-28 03:43:25,535 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 201 transitions. Word has length 9 [2024-11-28 03:43:25,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:25,536 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 201 transitions. [2024-11-28 03:43:25,536 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 03:43:25,536 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 201 transitions. [2024-11-28 03:43:25,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 03:43:25,536 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:25,536 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:43:25,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:43:25,537 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:25,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:25,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1837208363, now seen corresponding path program 1 times [2024-11-28 03:43:25,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:25,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080681236] [2024-11-28 03:43:25,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:25,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:25,699 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:43:25,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:25,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080681236] [2024-11-28 03:43:25,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080681236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:25,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:25,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:43:25,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056599908] [2024-11-28 03:43:25,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:25,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:43:25,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:25,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:43:25,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:43:25,702 INFO L87 Difference]: Start difference. First operand 172 states and 201 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 03:43:25,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:25,901 INFO L93 Difference]: Finished difference Result 170 states and 198 transitions. [2024-11-28 03:43:25,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:43:25,902 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 03:43:25,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:25,903 INFO L225 Difference]: With dead ends: 170 [2024-11-28 03:43:25,903 INFO L226 Difference]: Without dead ends: 170 [2024-11-28 03:43:25,903 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 03:43:25,904 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 4 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:25,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 193 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:43:25,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-28 03:43:25,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2024-11-28 03:43:25,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 120 states have (on average 1.65) internal successors, (198), 169 states have internal predecessors, (198), 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 03:43:25,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 198 transitions. [2024-11-28 03:43:25,914 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 198 transitions. Word has length 9 [2024-11-28 03:43:25,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:25,914 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 198 transitions. [2024-11-28 03:43:25,914 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 03:43:25,914 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 198 transitions. [2024-11-28 03:43:25,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-28 03:43:25,915 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:25,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:43:25,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:43:25,915 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:25,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:25,916 INFO L85 PathProgramCache]: Analyzing trace with hash -553000011, now seen corresponding path program 1 times [2024-11-28 03:43:25,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:25,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414896247] [2024-11-28 03:43:25,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:25,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:25,994 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:43:25,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:25,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414896247] [2024-11-28 03:43:25,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414896247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:25,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:25,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:43:25,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771307060] [2024-11-28 03:43:25,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:25,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:43:25,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:25,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:43:25,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:43:25,997 INFO L87 Difference]: Start difference. First operand 170 states and 198 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 03:43:26,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:26,037 INFO L93 Difference]: Finished difference Result 170 states and 197 transitions. [2024-11-28 03:43:26,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:43:26,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2024-11-28 03:43:26,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:26,039 INFO L225 Difference]: With dead ends: 170 [2024-11-28 03:43:26,039 INFO L226 Difference]: Without dead ends: 170 [2024-11-28 03:43:26,039 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 03:43:26,040 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 2 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:26,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 258 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:43:26,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-28 03:43:26,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2024-11-28 03:43:26,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 120 states have (on average 1.6416666666666666) internal successors, (197), 169 states have internal predecessors, (197), 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 03:43:26,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 197 transitions. [2024-11-28 03:43:26,049 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 197 transitions. Word has length 13 [2024-11-28 03:43:26,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:26,050 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 197 transitions. [2024-11-28 03:43:26,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 03:43:26,050 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 197 transitions. [2024-11-28 03:43:26,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-28 03:43:26,051 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:26,051 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:43:26,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:43:26,051 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:26,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:26,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1139184916, now seen corresponding path program 1 times [2024-11-28 03:43:26,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:26,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010293538] [2024-11-28 03:43:26,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:26,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:26,206 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:43:26,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:26,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010293538] [2024-11-28 03:43:26,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010293538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:26,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:26,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:43:26,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511750431] [2024-11-28 03:43:26,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:26,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:43:26,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:26,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:43:26,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:43:26,208 INFO L87 Difference]: Start difference. First operand 170 states and 197 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 03:43:26,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:26,448 INFO L93 Difference]: Finished difference Result 177 states and 206 transitions. [2024-11-28 03:43:26,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:43:26,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2024-11-28 03:43:26,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:26,450 INFO L225 Difference]: With dead ends: 177 [2024-11-28 03:43:26,451 INFO L226 Difference]: Without dead ends: 177 [2024-11-28 03:43:26,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:43:26,452 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 21 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:26,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 257 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:43:26,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-28 03:43:26,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 167. [2024-11-28 03:43:26,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 122 states have (on average 1.598360655737705) internal successors, (195), 166 states have internal predecessors, (195), 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 03:43:26,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 195 transitions. [2024-11-28 03:43:26,465 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 195 transitions. Word has length 15 [2024-11-28 03:43:26,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:26,466 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 195 transitions. [2024-11-28 03:43:26,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 03:43:26,466 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 195 transitions. [2024-11-28 03:43:26,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-28 03:43:26,467 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:26,467 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:43:26,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:43:26,467 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:26,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:26,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1139184917, now seen corresponding path program 1 times [2024-11-28 03:43:26,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:26,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041177043] [2024-11-28 03:43:26,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:26,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:26,726 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:43:26,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:26,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041177043] [2024-11-28 03:43:26,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041177043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:26,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:26,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:43:26,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118850763] [2024-11-28 03:43:26,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:26,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:43:26,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:26,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:43:26,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:43:26,732 INFO L87 Difference]: Start difference. First operand 167 states and 195 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 03:43:27,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:27,047 INFO L93 Difference]: Finished difference Result 180 states and 210 transitions. [2024-11-28 03:43:27,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:43:27,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2024-11-28 03:43:27,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:27,050 INFO L225 Difference]: With dead ends: 180 [2024-11-28 03:43:27,050 INFO L226 Difference]: Without dead ends: 180 [2024-11-28 03:43:27,050 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 03:43:27,052 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 20 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:27,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 231 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:43:27,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-28 03:43:27,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2024-11-28 03:43:27,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 134 states have (on average 1.5597014925373134) internal successors, (209), 174 states have internal predecessors, (209), 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 03:43:27,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 209 transitions. [2024-11-28 03:43:27,063 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 209 transitions. Word has length 15 [2024-11-28 03:43:27,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:27,063 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 209 transitions. [2024-11-28 03:43:27,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 03:43:27,064 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 209 transitions. [2024-11-28 03:43:27,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 03:43:27,065 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:27,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:43:27,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:43:27,066 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:27,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:27,069 INFO L85 PathProgramCache]: Analyzing trace with hash 617594462, now seen corresponding path program 1 times [2024-11-28 03:43:27,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:27,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117055749] [2024-11-28 03:43:27,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:27,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:27,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:43:27,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:27,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117055749] [2024-11-28 03:43:27,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117055749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:27,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:27,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:43:27,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339190778] [2024-11-28 03:43:27,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:27,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:43:27,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:27,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:43:27,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:43:27,133 INFO L87 Difference]: Start difference. First operand 175 states and 209 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 03:43:27,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:27,151 INFO L93 Difference]: Finished difference Result 177 states and 211 transitions. [2024-11-28 03:43:27,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:43:27,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2024-11-28 03:43:27,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:27,152 INFO L225 Difference]: With dead ends: 177 [2024-11-28 03:43:27,152 INFO L226 Difference]: Without dead ends: 177 [2024-11-28 03:43:27,152 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 03:43:27,153 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:27,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 252 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:43:27,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-28 03:43:27,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-11-28 03:43:27,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 176 states have internal predecessors, (211), 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 03:43:27,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 211 transitions. [2024-11-28 03:43:27,165 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 211 transitions. Word has length 17 [2024-11-28 03:43:27,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:27,165 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 211 transitions. [2024-11-28 03:43:27,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 03:43:27,165 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 211 transitions. [2024-11-28 03:43:27,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-28 03:43:27,166 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:27,166 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:43:27,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:43:27,167 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:27,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:27,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1373598373, now seen corresponding path program 1 times [2024-11-28 03:43:27,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:27,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497841173] [2024-11-28 03:43:27,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:27,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:27,298 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:43:27,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:27,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497841173] [2024-11-28 03:43:27,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497841173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:27,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:27,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:43:27,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255040608] [2024-11-28 03:43:27,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:27,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:43:27,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:27,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:43:27,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:43:27,300 INFO L87 Difference]: Start difference. First operand 177 states and 211 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 03:43:27,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:27,445 INFO L93 Difference]: Finished difference Result 183 states and 213 transitions. [2024-11-28 03:43:27,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:43:27,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2024-11-28 03:43:27,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:27,448 INFO L225 Difference]: With dead ends: 183 [2024-11-28 03:43:27,448 INFO L226 Difference]: Without dead ends: 183 [2024-11-28 03:43:27,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:43:27,450 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 19 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:27,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 337 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:43:27,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-28 03:43:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 178. [2024-11-28 03:43:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 137 states have (on average 1.5474452554744527) internal successors, (212), 177 states have internal predecessors, (212), 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 03:43:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 212 transitions. [2024-11-28 03:43:27,462 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 212 transitions. Word has length 18 [2024-11-28 03:43:27,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:27,462 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 212 transitions. [2024-11-28 03:43:27,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 03:43:27,463 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 212 transitions. [2024-11-28 03:43:27,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-28 03:43:27,464 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:27,464 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 03:43:27,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:43:27,465 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:27,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:27,465 INFO L85 PathProgramCache]: Analyzing trace with hash -232103557, now seen corresponding path program 1 times [2024-11-28 03:43:27,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:27,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440195387] [2024-11-28 03:43:27,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:27,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:27,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:43:27,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:27,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440195387] [2024-11-28 03:43:27,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440195387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:27,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:27,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:43:27,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159275690] [2024-11-28 03:43:27,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:27,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:43:27,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:27,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:43:27,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:43:27,964 INFO L87 Difference]: Start difference. First operand 178 states and 212 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 03:43:28,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:28,328 INFO L93 Difference]: Finished difference Result 219 states and 259 transitions. [2024-11-28 03:43:28,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:43:28,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 03:43:28,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:28,330 INFO L225 Difference]: With dead ends: 219 [2024-11-28 03:43:28,331 INFO L226 Difference]: Without dead ends: 219 [2024-11-28 03:43:28,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:43:28,332 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 52 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:28,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 495 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:43:28,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-28 03:43:28,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 193. [2024-11-28 03:43:28,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 152 states have (on average 1.5263157894736843) internal successors, (232), 192 states have internal predecessors, (232), 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 03:43:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 232 transitions. [2024-11-28 03:43:28,339 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 232 transitions. Word has length 19 [2024-11-28 03:43:28,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:28,340 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 232 transitions. [2024-11-28 03:43:28,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 03:43:28,340 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 232 transitions. [2024-11-28 03:43:28,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 03:43:28,341 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:28,341 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] [2024-11-28 03:43:28,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:43:28,341 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:28,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:28,342 INFO L85 PathProgramCache]: Analyzing trace with hash 493184809, now seen corresponding path program 1 times [2024-11-28 03:43:28,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:28,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423929565] [2024-11-28 03:43:28,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:28,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:28,524 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:43:28,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:28,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423929565] [2024-11-28 03:43:28,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423929565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:28,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:28,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:43:28,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066194664] [2024-11-28 03:43:28,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:28,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:43:28,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:28,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:43:28,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:43:28,526 INFO L87 Difference]: Start difference. First operand 193 states and 232 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:28,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:28,786 INFO L93 Difference]: Finished difference Result 192 states and 230 transitions. [2024-11-28 03:43:28,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:43:28,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-28 03:43:28,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:28,788 INFO L225 Difference]: With dead ends: 192 [2024-11-28 03:43:28,788 INFO L226 Difference]: Without dead ends: 192 [2024-11-28 03:43:28,788 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 03:43:28,789 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 3 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:28,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 314 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:43:28,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-28 03:43:28,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2024-11-28 03:43:28,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 152 states have (on average 1.513157894736842) internal successors, (230), 191 states have internal predecessors, (230), 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 03:43:28,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 230 transitions. [2024-11-28 03:43:28,803 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 230 transitions. Word has length 20 [2024-11-28 03:43:28,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:28,804 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 230 transitions. [2024-11-28 03:43:28,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:28,804 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 230 transitions. [2024-11-28 03:43:28,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 03:43:28,804 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:28,804 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] [2024-11-28 03:43:28,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 03:43:28,805 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:28,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:28,805 INFO L85 PathProgramCache]: Analyzing trace with hash 493184810, now seen corresponding path program 1 times [2024-11-28 03:43:28,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:28,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186926927] [2024-11-28 03:43:28,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:28,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:29,093 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:43:29,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:29,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186926927] [2024-11-28 03:43:29,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186926927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:29,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:29,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:43:29,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620808899] [2024-11-28 03:43:29,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:29,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:43:29,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:29,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:43:29,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:43:29,095 INFO L87 Difference]: Start difference. First operand 192 states and 230 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:29,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:29,383 INFO L93 Difference]: Finished difference Result 191 states and 228 transitions. [2024-11-28 03:43:29,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:43:29,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-28 03:43:29,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:29,385 INFO L225 Difference]: With dead ends: 191 [2024-11-28 03:43:29,386 INFO L226 Difference]: Without dead ends: 191 [2024-11-28 03:43:29,386 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 03:43:29,386 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 2 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:29,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 292 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:43:29,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-28 03:43:29,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-11-28 03:43:29,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 152 states have (on average 1.5) internal successors, (228), 190 states have internal predecessors, (228), 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 03:43:29,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 228 transitions. [2024-11-28 03:43:29,404 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 228 transitions. Word has length 20 [2024-11-28 03:43:29,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:29,404 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 228 transitions. [2024-11-28 03:43:29,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:29,405 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 228 transitions. [2024-11-28 03:43:29,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 03:43:29,405 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:29,405 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] [2024-11-28 03:43:29,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 03:43:29,406 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:29,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:29,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1473069890, now seen corresponding path program 1 times [2024-11-28 03:43:29,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:29,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196651982] [2024-11-28 03:43:29,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:29,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:29,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:43:29,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:29,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196651982] [2024-11-28 03:43:29,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196651982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:29,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:29,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:43:29,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217007813] [2024-11-28 03:43:29,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:29,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 03:43:29,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:29,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 03:43:29,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:43:29,960 INFO L87 Difference]: Start difference. First operand 191 states and 228 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:30,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:30,819 INFO L93 Difference]: Finished difference Result 211 states and 251 transitions. [2024-11-28 03:43:30,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 03:43:30,820 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-28 03:43:30,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:30,821 INFO L225 Difference]: With dead ends: 211 [2024-11-28 03:43:30,821 INFO L226 Difference]: Without dead ends: 211 [2024-11-28 03:43:30,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-28 03:43:30,823 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 160 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:30,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 363 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 03:43:30,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-28 03:43:30,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 196. [2024-11-28 03:43:30,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 157 states have (on average 1.4904458598726114) internal successors, (234), 195 states have internal predecessors, (234), 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 03:43:30,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 234 transitions. [2024-11-28 03:43:30,838 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 234 transitions. Word has length 20 [2024-11-28 03:43:30,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:30,838 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 234 transitions. [2024-11-28 03:43:30,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:30,839 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 234 transitions. [2024-11-28 03:43:30,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 03:43:30,839 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:30,839 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] [2024-11-28 03:43:30,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 03:43:30,840 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:30,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:30,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1473069889, now seen corresponding path program 1 times [2024-11-28 03:43:30,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:30,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177662281] [2024-11-28 03:43:30,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:30,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:31,629 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:43:31,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:31,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177662281] [2024-11-28 03:43:31,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177662281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:31,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:31,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:43:31,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744980891] [2024-11-28 03:43:31,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:31,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 03:43:31,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:31,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 03:43:31,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:43:31,632 INFO L87 Difference]: Start difference. First operand 196 states and 234 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:32,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:32,393 INFO L93 Difference]: Finished difference Result 218 states and 251 transitions. [2024-11-28 03:43:32,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 03:43:32,396 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-28 03:43:32,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:32,397 INFO L225 Difference]: With dead ends: 218 [2024-11-28 03:43:32,397 INFO L226 Difference]: Without dead ends: 218 [2024-11-28 03:43:32,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-11-28 03:43:32,398 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 190 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:32,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 347 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 03:43:32,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-28 03:43:32,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 200. [2024-11-28 03:43:32,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 161 states have (on average 1.484472049689441) internal successors, (239), 199 states have internal predecessors, (239), 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 03:43:32,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 239 transitions. [2024-11-28 03:43:32,410 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 239 transitions. Word has length 20 [2024-11-28 03:43:32,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:32,411 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 239 transitions. [2024-11-28 03:43:32,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:32,411 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 239 transitions. [2024-11-28 03:43:32,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-28 03:43:32,412 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:32,412 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:43:32,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 03:43:32,412 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:32,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:32,416 INFO L85 PathProgramCache]: Analyzing trace with hash -614418061, now seen corresponding path program 1 times [2024-11-28 03:43:32,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:32,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606505148] [2024-11-28 03:43:32,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:32,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:32,715 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:43:32,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:32,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606505148] [2024-11-28 03:43:32,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606505148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:32,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:32,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:43:32,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868040168] [2024-11-28 03:43:32,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:32,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:43:32,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:32,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:43:32,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:43:32,718 INFO L87 Difference]: Start difference. First operand 200 states and 239 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:33,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:33,262 INFO L93 Difference]: Finished difference Result 214 states and 254 transitions. [2024-11-28 03:43:33,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:43:33,263 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-28 03:43:33,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:33,264 INFO L225 Difference]: With dead ends: 214 [2024-11-28 03:43:33,264 INFO L226 Difference]: Without dead ends: 214 [2024-11-28 03:43:33,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:43:33,265 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 146 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:33,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 326 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:43:33,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-28 03:43:33,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 199. [2024-11-28 03:43:33,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 161 states have (on average 1.4720496894409938) internal successors, (237), 198 states have internal predecessors, (237), 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 03:43:33,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 237 transitions. [2024-11-28 03:43:33,273 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 237 transitions. Word has length 23 [2024-11-28 03:43:33,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:33,273 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 237 transitions. [2024-11-28 03:43:33,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:33,274 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 237 transitions. [2024-11-28 03:43:33,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-28 03:43:33,278 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:33,278 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:43:33,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 03:43:33,278 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:33,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:33,279 INFO L85 PathProgramCache]: Analyzing trace with hash -614418060, now seen corresponding path program 1 times [2024-11-28 03:43:33,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:33,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67706849] [2024-11-28 03:43:33,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:33,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:33,699 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:43:33,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:33,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67706849] [2024-11-28 03:43:33,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67706849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:33,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:33,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:43:33,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626073553] [2024-11-28 03:43:33,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:33,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:43:33,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:33,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:43:33,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:43:33,704 INFO L87 Difference]: Start difference. First operand 199 states and 237 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:34,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:34,301 INFO L93 Difference]: Finished difference Result 213 states and 252 transitions. [2024-11-28 03:43:34,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:43:34,301 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-28 03:43:34,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:34,303 INFO L225 Difference]: With dead ends: 213 [2024-11-28 03:43:34,303 INFO L226 Difference]: Without dead ends: 213 [2024-11-28 03:43:34,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:43:34,304 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 144 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:34,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 317 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 03:43:34,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-28 03:43:34,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 198. [2024-11-28 03:43:34,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 161 states have (on average 1.4596273291925466) internal successors, (235), 197 states have internal predecessors, (235), 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 03:43:34,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 235 transitions. [2024-11-28 03:43:34,310 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 235 transitions. Word has length 23 [2024-11-28 03:43:34,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:34,311 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 235 transitions. [2024-11-28 03:43:34,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:34,311 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 235 transitions. [2024-11-28 03:43:34,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-28 03:43:34,312 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:34,312 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:43:34,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 03:43:34,312 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:34,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:34,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1750891489, now seen corresponding path program 1 times [2024-11-28 03:43:34,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:34,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685304736] [2024-11-28 03:43:34,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:34,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:34,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:43:34,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:34,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685304736] [2024-11-28 03:43:34,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685304736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:34,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:34,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:43:34,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291508099] [2024-11-28 03:43:34,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:34,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:43:34,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:34,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:43:34,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:43:34,479 INFO L87 Difference]: Start difference. First operand 198 states and 235 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:34,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:34,742 INFO L93 Difference]: Finished difference Result 206 states and 245 transitions. [2024-11-28 03:43:34,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:43:34,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-28 03:43:34,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:34,743 INFO L225 Difference]: With dead ends: 206 [2024-11-28 03:43:34,743 INFO L226 Difference]: Without dead ends: 206 [2024-11-28 03:43:34,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:43:34,744 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 75 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:34,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 137 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:43:34,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-28 03:43:34,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 190. [2024-11-28 03:43:34,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 160 states have (on average 1.41875) internal successors, (227), 189 states have internal predecessors, (227), 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 03:43:34,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 227 transitions. [2024-11-28 03:43:34,750 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 227 transitions. Word has length 23 [2024-11-28 03:43:34,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:34,751 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 227 transitions. [2024-11-28 03:43:34,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:34,751 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 227 transitions. [2024-11-28 03:43:34,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-28 03:43:34,752 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:34,752 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] [2024-11-28 03:43:34,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 03:43:34,752 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:34,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:34,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1841807221, now seen corresponding path program 1 times [2024-11-28 03:43:34,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:34,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500854404] [2024-11-28 03:43:34,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:34,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:34,787 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:43:34,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:34,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500854404] [2024-11-28 03:43:34,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500854404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:34,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:34,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:43:34,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114760076] [2024-11-28 03:43:34,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:34,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:43:34,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:34,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:43:34,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:43:34,790 INFO L87 Difference]: Start difference. First operand 190 states and 227 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 03:43:34,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:34,802 INFO L93 Difference]: Finished difference Result 193 states and 230 transitions. [2024-11-28 03:43:34,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:43:34,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2024-11-28 03:43:34,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:34,803 INFO L225 Difference]: With dead ends: 193 [2024-11-28 03:43:34,804 INFO L226 Difference]: Without dead ends: 193 [2024-11-28 03:43:34,804 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 03:43:34,804 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:34,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:43:34,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-28 03:43:34,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2024-11-28 03:43:34,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 162 states have (on average 1.4135802469135803) internal successors, (229), 191 states have internal predecessors, (229), 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 03:43:34,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 229 transitions. [2024-11-28 03:43:34,811 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 229 transitions. Word has length 24 [2024-11-28 03:43:34,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:34,811 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 229 transitions. [2024-11-28 03:43:34,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 03:43:34,811 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 229 transitions. [2024-11-28 03:43:34,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-28 03:43:34,812 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:34,812 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] [2024-11-28 03:43:34,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 03:43:34,812 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:34,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:34,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1899065523, now seen corresponding path program 1 times [2024-11-28 03:43:34,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:34,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003835968] [2024-11-28 03:43:34,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:34,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:34,928 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:43:34,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:34,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003835968] [2024-11-28 03:43:34,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003835968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:34,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:34,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:43:34,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105618687] [2024-11-28 03:43:34,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:34,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:43:34,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:34,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:43:34,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:43:34,931 INFO L87 Difference]: Start difference. First operand 192 states and 229 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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 03:43:35,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:35,161 INFO L93 Difference]: Finished difference Result 191 states and 227 transitions. [2024-11-28 03:43:35,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:43:35,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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 24 [2024-11-28 03:43:35,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:35,163 INFO L225 Difference]: With dead ends: 191 [2024-11-28 03:43:35,163 INFO L226 Difference]: Without dead ends: 191 [2024-11-28 03:43:35,163 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 03:43:35,164 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 3 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:35,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 283 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:43:35,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-28 03:43:35,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-11-28 03:43:35,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 162 states have (on average 1.4012345679012346) internal successors, (227), 190 states have internal predecessors, (227), 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 03:43:35,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 227 transitions. [2024-11-28 03:43:35,171 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 227 transitions. Word has length 24 [2024-11-28 03:43:35,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:35,171 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 227 transitions. [2024-11-28 03:43:35,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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 03:43:35,171 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 227 transitions. [2024-11-28 03:43:35,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-28 03:43:35,172 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:35,172 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] [2024-11-28 03:43:35,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 03:43:35,172 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:35,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:35,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1899065522, now seen corresponding path program 1 times [2024-11-28 03:43:35,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:35,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540241417] [2024-11-28 03:43:35,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:35,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:35,367 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:43:35,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:35,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540241417] [2024-11-28 03:43:35,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540241417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:35,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:35,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:43:35,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971731500] [2024-11-28 03:43:35,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:35,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:43:35,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:35,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:43:35,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:43:35,369 INFO L87 Difference]: Start difference. First operand 191 states and 227 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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 03:43:35,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:35,615 INFO L93 Difference]: Finished difference Result 190 states and 225 transitions. [2024-11-28 03:43:35,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:43:35,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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 24 [2024-11-28 03:43:35,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:35,617 INFO L225 Difference]: With dead ends: 190 [2024-11-28 03:43:35,617 INFO L226 Difference]: Without dead ends: 190 [2024-11-28 03:43:35,617 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 03:43:35,619 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:35,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 275 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:43:35,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-28 03:43:35,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-11-28 03:43:35,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 162 states have (on average 1.3888888888888888) internal successors, (225), 189 states have internal predecessors, (225), 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 03:43:35,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 225 transitions. [2024-11-28 03:43:35,626 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 225 transitions. Word has length 24 [2024-11-28 03:43:35,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:35,626 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 225 transitions. [2024-11-28 03:43:35,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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 03:43:35,626 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 225 transitions. [2024-11-28 03:43:35,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-28 03:43:35,628 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:35,629 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] [2024-11-28 03:43:35,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 03:43:35,630 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:35,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:35,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1008958534, now seen corresponding path program 1 times [2024-11-28 03:43:35,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:35,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042301598] [2024-11-28 03:43:35,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:35,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:35,964 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:43:35,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:35,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042301598] [2024-11-28 03:43:35,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042301598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:35,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:35,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:43:35,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736466992] [2024-11-28 03:43:35,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:35,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:43:35,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:35,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:43:35,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:43:35,966 INFO L87 Difference]: Start difference. First operand 190 states and 225 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 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 03:43:36,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:36,492 INFO L93 Difference]: Finished difference Result 228 states and 264 transitions. [2024-11-28 03:43:36,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 03:43:36,493 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 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 25 [2024-11-28 03:43:36,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:36,494 INFO L225 Difference]: With dead ends: 228 [2024-11-28 03:43:36,494 INFO L226 Difference]: Without dead ends: 228 [2024-11-28 03:43:36,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2024-11-28 03:43:36,495 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 193 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:36,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 409 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:43:36,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-28 03:43:36,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 203. [2024-11-28 03:43:36,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 175 states have (on average 1.3828571428571428) internal successors, (242), 202 states have internal predecessors, (242), 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 03:43:36,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 242 transitions. [2024-11-28 03:43:36,502 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 242 transitions. Word has length 25 [2024-11-28 03:43:36,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:36,503 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 242 transitions. [2024-11-28 03:43:36,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 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 03:43:36,503 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 242 transitions. [2024-11-28 03:43:36,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-28 03:43:36,504 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:36,504 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] [2024-11-28 03:43:36,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 03:43:36,504 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:36,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:36,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1008970510, now seen corresponding path program 1 times [2024-11-28 03:43:36,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:36,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53194279] [2024-11-28 03:43:36,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:36,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:36,695 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:43:36,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:36,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53194279] [2024-11-28 03:43:36,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53194279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:36,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:36,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:43:36,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168141542] [2024-11-28 03:43:36,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:36,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:43:36,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:36,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:43:36,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:43:36,699 INFO L87 Difference]: Start difference. First operand 203 states and 242 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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 03:43:36,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:36,985 INFO L93 Difference]: Finished difference Result 246 states and 292 transitions. [2024-11-28 03:43:36,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:43:36,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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 25 [2024-11-28 03:43:36,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:36,987 INFO L225 Difference]: With dead ends: 246 [2024-11-28 03:43:36,987 INFO L226 Difference]: Without dead ends: 246 [2024-11-28 03:43:36,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:43:36,988 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 179 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:36,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 160 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:43:36,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-28 03:43:36,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 180. [2024-11-28 03:43:36,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 158 states have (on average 1.3417721518987342) internal successors, (212), 179 states have internal predecessors, (212), 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 03:43:36,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 212 transitions. [2024-11-28 03:43:36,995 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 212 transitions. Word has length 25 [2024-11-28 03:43:36,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:36,996 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 212 transitions. [2024-11-28 03:43:36,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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 03:43:36,996 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 212 transitions. [2024-11-28 03:43:36,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 03:43:36,997 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:36,997 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] [2024-11-28 03:43:36,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-28 03:43:36,997 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:36,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:36,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1022223888, now seen corresponding path program 1 times [2024-11-28 03:43:36,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:36,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770875273] [2024-11-28 03:43:36,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:36,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:37,334 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:43:37,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:37,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770875273] [2024-11-28 03:43:37,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770875273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:37,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:37,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:43:37,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007113358] [2024-11-28 03:43:37,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:37,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:43:37,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:37,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:43:37,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:43:37,336 INFO L87 Difference]: Start difference. First operand 180 states and 212 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 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 03:43:37,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:37,848 INFO L93 Difference]: Finished difference Result 209 states and 246 transitions. [2024-11-28 03:43:37,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 03:43:37,849 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 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 26 [2024-11-28 03:43:37,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:37,850 INFO L225 Difference]: With dead ends: 209 [2024-11-28 03:43:37,850 INFO L226 Difference]: Without dead ends: 209 [2024-11-28 03:43:37,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-11-28 03:43:37,851 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 138 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:37,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 357 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:43:37,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-28 03:43:37,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 179. [2024-11-28 03:43:37,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 158 states have (on average 1.3291139240506329) internal successors, (210), 178 states have internal predecessors, (210), 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 03:43:37,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 210 transitions. [2024-11-28 03:43:37,863 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 210 transitions. Word has length 26 [2024-11-28 03:43:37,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:37,863 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 210 transitions. [2024-11-28 03:43:37,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 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 03:43:37,864 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 210 transitions. [2024-11-28 03:43:37,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 03:43:37,864 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:37,864 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] [2024-11-28 03:43:37,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-28 03:43:37,864 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:37,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:37,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1022223889, now seen corresponding path program 1 times [2024-11-28 03:43:37,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:37,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61562194] [2024-11-28 03:43:37,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:37,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:38,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 03:43:38,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:38,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61562194] [2024-11-28 03:43:38,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61562194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:38,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:38,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:43:38,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244180879] [2024-11-28 03:43:38,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:38,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:43:38,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:38,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:43:38,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:43:38,314 INFO L87 Difference]: Start difference. First operand 179 states and 210 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 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 03:43:38,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:38,920 INFO L93 Difference]: Finished difference Result 193 states and 225 transitions. [2024-11-28 03:43:38,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:43:38,921 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 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 26 [2024-11-28 03:43:38,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:38,922 INFO L225 Difference]: With dead ends: 193 [2024-11-28 03:43:38,922 INFO L226 Difference]: Without dead ends: 193 [2024-11-28 03:43:38,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-28 03:43:38,923 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 124 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:38,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 412 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 03:43:38,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-28 03:43:38,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 178. [2024-11-28 03:43:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 158 states have (on average 1.3164556962025316) internal successors, (208), 177 states have internal predecessors, (208), 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 03:43:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 208 transitions. [2024-11-28 03:43:38,928 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 208 transitions. Word has length 26 [2024-11-28 03:43:38,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:38,928 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 208 transitions. [2024-11-28 03:43:38,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 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 03:43:38,929 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 208 transitions. [2024-11-28 03:43:38,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 03:43:38,929 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:38,929 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] [2024-11-28 03:43:38,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-28 03:43:38,930 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:38,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:38,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1569329945, now seen corresponding path program 1 times [2024-11-28 03:43:38,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:38,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699989185] [2024-11-28 03:43:38,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:38,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:39,818 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:43:39,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:39,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699989185] [2024-11-28 03:43:39,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699989185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:39,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:39,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 03:43:39,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042062490] [2024-11-28 03:43:39,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:39,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 03:43:39,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:39,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 03:43:39,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:43:39,820 INFO L87 Difference]: Start difference. First operand 178 states and 208 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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 03:43:40,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:40,713 INFO L93 Difference]: Finished difference Result 214 states and 246 transitions. [2024-11-28 03:43:40,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 03:43:40,714 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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 26 [2024-11-28 03:43:40,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:40,715 INFO L225 Difference]: With dead ends: 214 [2024-11-28 03:43:40,715 INFO L226 Difference]: Without dead ends: 214 [2024-11-28 03:43:40,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2024-11-28 03:43:40,716 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 153 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:40,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 658 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 03:43:40,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-28 03:43:40,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 192. [2024-11-28 03:43:40,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 172 states have (on average 1.2906976744186047) internal successors, (222), 191 states have internal predecessors, (222), 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 03:43:40,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 222 transitions. [2024-11-28 03:43:40,723 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 222 transitions. Word has length 26 [2024-11-28 03:43:40,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:40,723 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 222 transitions. [2024-11-28 03:43:40,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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 03:43:40,723 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 222 transitions. [2024-11-28 03:43:40,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-28 03:43:40,724 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:40,724 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] [2024-11-28 03:43:40,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 03:43:40,724 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:40,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:40,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1751675432, now seen corresponding path program 1 times [2024-11-28 03:43:40,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:40,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987874226] [2024-11-28 03:43:40,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:40,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:40,992 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:43:40,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:40,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987874226] [2024-11-28 03:43:40,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987874226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:40,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:40,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:43:40,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078461486] [2024-11-28 03:43:40,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:40,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:43:40,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:40,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:43:40,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:43:40,994 INFO L87 Difference]: Start difference. First operand 192 states and 222 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 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 03:43:41,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:41,502 INFO L93 Difference]: Finished difference Result 215 states and 247 transitions. [2024-11-28 03:43:41,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:43:41,503 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 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 27 [2024-11-28 03:43:41,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:41,504 INFO L225 Difference]: With dead ends: 215 [2024-11-28 03:43:41,504 INFO L226 Difference]: Without dead ends: 215 [2024-11-28 03:43:41,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:43:41,505 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 119 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:41,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 359 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:43:41,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-28 03:43:41,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 191. [2024-11-28 03:43:41,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 172 states have (on average 1.2848837209302326) internal successors, (221), 190 states have internal predecessors, (221), 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 03:43:41,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 221 transitions. [2024-11-28 03:43:41,514 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 221 transitions. Word has length 27 [2024-11-28 03:43:41,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:41,514 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 221 transitions. [2024-11-28 03:43:41,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 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 03:43:41,515 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 221 transitions. [2024-11-28 03:43:41,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-28 03:43:41,515 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:41,515 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] [2024-11-28 03:43:41,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-28 03:43:41,516 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:41,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:41,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1751675431, now seen corresponding path program 1 times [2024-11-28 03:43:41,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:41,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72202843] [2024-11-28 03:43:41,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:41,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:41,855 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:43:41,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:41,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72202843] [2024-11-28 03:43:41,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72202843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:41,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:41,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:43:41,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113286583] [2024-11-28 03:43:41,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:41,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:43:41,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:41,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:43:41,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:43:41,856 INFO L87 Difference]: Start difference. First operand 191 states and 221 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 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 03:43:42,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:42,393 INFO L93 Difference]: Finished difference Result 214 states and 246 transitions. [2024-11-28 03:43:42,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:43:42,394 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 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 27 [2024-11-28 03:43:42,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:42,395 INFO L225 Difference]: With dead ends: 214 [2024-11-28 03:43:42,395 INFO L226 Difference]: Without dead ends: 214 [2024-11-28 03:43:42,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:43:42,396 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 116 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:42,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 363 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:43:42,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-28 03:43:42,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 190. [2024-11-28 03:43:42,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 172 states have (on average 1.2790697674418605) internal successors, (220), 189 states have internal predecessors, (220), 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 03:43:42,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 220 transitions. [2024-11-28 03:43:42,408 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 220 transitions. Word has length 27 [2024-11-28 03:43:42,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:42,408 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 220 transitions. [2024-11-28 03:43:42,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 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 03:43:42,409 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 220 transitions. [2024-11-28 03:43:42,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 03:43:42,409 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:42,409 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:43:42,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-28 03:43:42,409 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:42,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:42,409 INFO L85 PathProgramCache]: Analyzing trace with hash -2059175961, now seen corresponding path program 1 times [2024-11-28 03:43:42,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:42,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971867429] [2024-11-28 03:43:42,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:42,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:42,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 03:43:42,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:42,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971867429] [2024-11-28 03:43:42,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971867429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:42,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:42,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:43:42,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835655257] [2024-11-28 03:43:42,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:42,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:43:42,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:42,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:43:42,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:43:42,738 INFO L87 Difference]: Start difference. First operand 190 states and 220 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:43,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:43,309 INFO L93 Difference]: Finished difference Result 252 states and 289 transitions. [2024-11-28 03:43:43,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 03:43:43,312 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-28 03:43:43,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:43,313 INFO L225 Difference]: With dead ends: 252 [2024-11-28 03:43:43,313 INFO L226 Difference]: Without dead ends: 252 [2024-11-28 03:43:43,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2024-11-28 03:43:43,314 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 179 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:43,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 523 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 03:43:43,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-28 03:43:43,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 190. [2024-11-28 03:43:43,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 172 states have (on average 1.2732558139534884) internal successors, (219), 189 states have internal predecessors, (219), 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 03:43:43,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 219 transitions. [2024-11-28 03:43:43,322 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 219 transitions. Word has length 28 [2024-11-28 03:43:43,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:43,322 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 219 transitions. [2024-11-28 03:43:43,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:43,323 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 219 transitions. [2024-11-28 03:43:43,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 03:43:43,323 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:43,323 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 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:43:43,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-28 03:43:43,324 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:43,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:43,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1231684097, now seen corresponding path program 1 times [2024-11-28 03:43:43,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:43,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512985555] [2024-11-28 03:43:43,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:43,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:43,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:43:43,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:43,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512985555] [2024-11-28 03:43:43,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512985555] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:43:43,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061800341] [2024-11-28 03:43:43,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:43,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:43:43,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:43:43,507 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:43:43,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:43:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:43,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-28 03:43:43,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:43:43,735 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 11 treesize of output 7 [2024-11-28 03:43:43,745 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 11 treesize of output 7 [2024-11-28 03:43:43,762 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-28 03:43:43,771 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 27 treesize of output 11 [2024-11-28 03:43:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:43:43,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:43:43,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:43:43,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061800341] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:43:43,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:43:43,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-11-28 03:43:43,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125808839] [2024-11-28 03:43:43,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:43:43,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:43:43,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:43,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:43:43,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:43:43,961 INFO L87 Difference]: Start difference. First operand 190 states and 219 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 03:43:44,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:44,078 INFO L93 Difference]: Finished difference Result 193 states and 222 transitions. [2024-11-28 03:43:44,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:43:44,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 29 [2024-11-28 03:43:44,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:44,080 INFO L225 Difference]: With dead ends: 193 [2024-11-28 03:43:44,080 INFO L226 Difference]: Without dead ends: 193 [2024-11-28 03:43:44,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:43:44,081 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 2 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:44,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 356 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:43:44,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-28 03:43:44,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2024-11-28 03:43:44,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 174 states have (on average 1.2701149425287357) internal successors, (221), 191 states have internal predecessors, (221), 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 03:43:44,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 221 transitions. [2024-11-28 03:43:44,087 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 221 transitions. Word has length 29 [2024-11-28 03:43:44,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:44,087 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 221 transitions. [2024-11-28 03:43:44,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 03:43:44,088 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 221 transitions. [2024-11-28 03:43:44,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 03:43:44,088 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:44,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] [2024-11-28 03:43:44,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 03:43:44,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:43:44,289 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:44,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:44,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1231680191, now seen corresponding path program 1 times [2024-11-28 03:43:44,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:44,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213873969] [2024-11-28 03:43:44,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:44,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:44,722 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:43:44,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:44,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213873969] [2024-11-28 03:43:44,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213873969] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:43:44,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855211339] [2024-11-28 03:43:44,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:44,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:43:44,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:43:44,725 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:43:44,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:43:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:44,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-28 03:43:44,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:43:45,071 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 15 treesize of output 1 [2024-11-28 03:43:45,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:43:45,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 36 [2024-11-28 03:43:45,716 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~n~0#1.base_88| Int) (|v_ULTIMATE.start_main_~st~0#1.base_30| Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~n~0#1.base_88|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~st~0#1.base_30| 0) |v_ULTIMATE.start_main_~n~0#1.base_88| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~n~0#1.base_88| 1) |v_ULTIMATE.start_main_~st~0#1.base_30|) 0))) is different from true [2024-11-28 03:43:45,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-28 03:43:45,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:43:45,960 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 20 [2024-11-28 03:43:45,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2024-11-28 03:43:48,611 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:43:48,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855211339] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:43:48,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:43:48,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2024-11-28 03:43:48,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266260889] [2024-11-28 03:43:48,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:43:48,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 03:43:48,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:48,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 03:43:48,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=538, Unknown=1, NotChecked=46, Total=650 [2024-11-28 03:43:48,614 INFO L87 Difference]: Start difference. First operand 192 states and 221 transitions. Second operand has 26 states, 25 states have (on average 2.92) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:50,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:50,803 INFO L93 Difference]: Finished difference Result 208 states and 238 transitions. [2024-11-28 03:43:50,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 03:43:50,804 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.92) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-28 03:43:50,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:50,805 INFO L225 Difference]: With dead ends: 208 [2024-11-28 03:43:50,805 INFO L226 Difference]: Without dead ends: 202 [2024-11-28 03:43:50,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=134, Invalid=1059, Unknown=1, NotChecked=66, Total=1260 [2024-11-28 03:43:50,806 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 69 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:50,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 985 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1224 Invalid, 0 Unknown, 155 Unchecked, 1.6s Time] [2024-11-28 03:43:50,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-28 03:43:50,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 194. [2024-11-28 03:43:50,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 176 states have (on average 1.2670454545454546) internal successors, (223), 193 states have internal predecessors, (223), 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 03:43:50,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 223 transitions. [2024-11-28 03:43:50,815 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 223 transitions. Word has length 29 [2024-11-28 03:43:50,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:50,815 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 223 transitions. [2024-11-28 03:43:50,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.92) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:50,815 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 223 transitions. [2024-11-28 03:43:50,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-28 03:43:50,816 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:50,816 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] [2024-11-28 03:43:50,827 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 03:43:51,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:43:51,020 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:51,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:51,021 INFO L85 PathProgramCache]: Analyzing trace with hash -310044012, now seen corresponding path program 1 times [2024-11-28 03:43:51,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:51,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478560607] [2024-11-28 03:43:51,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:51,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:51,379 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:43:51,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:51,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478560607] [2024-11-28 03:43:51,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478560607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:51,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:51,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:43:51,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309562459] [2024-11-28 03:43:51,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:51,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:43:51,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:51,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:43:51,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:43:51,381 INFO L87 Difference]: Start difference. First operand 194 states and 223 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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 03:43:51,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:51,939 INFO L93 Difference]: Finished difference Result 217 states and 248 transitions. [2024-11-28 03:43:51,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:43:51,940 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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 30 [2024-11-28 03:43:51,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:51,941 INFO L225 Difference]: With dead ends: 217 [2024-11-28 03:43:51,941 INFO L226 Difference]: Without dead ends: 217 [2024-11-28 03:43:51,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-28 03:43:51,942 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 115 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:51,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 353 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:43:51,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-28 03:43:51,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 193. [2024-11-28 03:43:51,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 176 states have (on average 1.2613636363636365) internal successors, (222), 192 states have internal predecessors, (222), 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 03:43:51,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 222 transitions. [2024-11-28 03:43:51,949 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 222 transitions. Word has length 30 [2024-11-28 03:43:51,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:51,949 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 222 transitions. [2024-11-28 03:43:51,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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 03:43:51,949 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 222 transitions. [2024-11-28 03:43:51,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-28 03:43:51,950 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:51,950 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] [2024-11-28 03:43:51,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-28 03:43:51,950 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:51,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:51,951 INFO L85 PathProgramCache]: Analyzing trace with hash -310044011, now seen corresponding path program 1 times [2024-11-28 03:43:51,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:51,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297212859] [2024-11-28 03:43:51,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:51,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:51,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:52,406 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:43:52,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:52,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297212859] [2024-11-28 03:43:52,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297212859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:52,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:52,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:43:52,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262621081] [2024-11-28 03:43:52,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:52,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:43:52,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:52,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:43:52,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:43:52,408 INFO L87 Difference]: Start difference. First operand 193 states and 222 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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 03:43:53,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:53,056 INFO L93 Difference]: Finished difference Result 216 states and 247 transitions. [2024-11-28 03:43:53,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:43:53,057 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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 30 [2024-11-28 03:43:53,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:53,059 INFO L225 Difference]: With dead ends: 216 [2024-11-28 03:43:53,059 INFO L226 Difference]: Without dead ends: 216 [2024-11-28 03:43:53,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-28 03:43:53,059 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 113 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:53,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 362 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 03:43:53,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-28 03:43:53,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 192. [2024-11-28 03:43:53,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 176 states have (on average 1.2556818181818181) internal successors, (221), 191 states have internal predecessors, (221), 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 03:43:53,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 221 transitions. [2024-11-28 03:43:53,068 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 221 transitions. Word has length 30 [2024-11-28 03:43:53,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:53,068 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 221 transitions. [2024-11-28 03:43:53,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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 03:43:53,068 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 221 transitions. [2024-11-28 03:43:53,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-28 03:43:53,069 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:53,069 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 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:43:53,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-28 03:43:53,069 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:53,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:53,070 INFO L85 PathProgramCache]: Analyzing trace with hash -171617479, now seen corresponding path program 1 times [2024-11-28 03:43:53,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:53,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252622405] [2024-11-28 03:43:53,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:53,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:53,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:43:53,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:53,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252622405] [2024-11-28 03:43:53,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252622405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:53,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:53,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:43:53,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724618978] [2024-11-28 03:43:53,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:53,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:43:53,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:53,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:43:53,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:43:53,207 INFO L87 Difference]: Start difference. First operand 192 states and 221 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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 03:43:53,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:53,496 INFO L93 Difference]: Finished difference Result 221 states and 248 transitions. [2024-11-28 03:43:53,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:43:53,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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 33 [2024-11-28 03:43:53,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:53,497 INFO L225 Difference]: With dead ends: 221 [2024-11-28 03:43:53,497 INFO L226 Difference]: Without dead ends: 221 [2024-11-28 03:43:53,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:43:53,498 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 81 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:53,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 213 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:43:53,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-28 03:43:53,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 192. [2024-11-28 03:43:53,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 176 states have (on average 1.25) internal successors, (220), 191 states have internal predecessors, (220), 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 03:43:53,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 220 transitions. [2024-11-28 03:43:53,503 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 220 transitions. Word has length 33 [2024-11-28 03:43:53,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:53,503 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 220 transitions. [2024-11-28 03:43:53,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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 03:43:53,504 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 220 transitions. [2024-11-28 03:43:53,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-28 03:43:53,504 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:53,504 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] [2024-11-28 03:43:53,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-28 03:43:53,504 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:53,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:53,505 INFO L85 PathProgramCache]: Analyzing trace with hash -171613573, now seen corresponding path program 1 times [2024-11-28 03:43:53,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:53,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680107857] [2024-11-28 03:43:53,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:53,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:43:53,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:53,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680107857] [2024-11-28 03:43:53,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680107857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:53,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:53,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:43:53,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337921583] [2024-11-28 03:43:53,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:53,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:43:53,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:53,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:43:53,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:43:53,557 INFO L87 Difference]: Start difference. First operand 192 states and 220 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 03:43:53,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:53,618 INFO L93 Difference]: Finished difference Result 198 states and 222 transitions. [2024-11-28 03:43:53,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:43:53,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-11-28 03:43:53,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:53,619 INFO L225 Difference]: With dead ends: 198 [2024-11-28 03:43:53,619 INFO L226 Difference]: Without dead ends: 198 [2024-11-28 03:43:53,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 03:43:53,620 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 19 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:53,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 268 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:43:53,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-28 03:43:53,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 192. [2024-11-28 03:43:53,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 176 states have (on average 1.2443181818181819) internal successors, (219), 191 states have internal predecessors, (219), 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 03:43:53,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 219 transitions. [2024-11-28 03:43:53,624 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 219 transitions. Word has length 33 [2024-11-28 03:43:53,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:53,625 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 219 transitions. [2024-11-28 03:43:53,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 03:43:53,625 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 219 transitions. [2024-11-28 03:43:53,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-28 03:43:53,625 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:53,625 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 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:43:53,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-28 03:43:53,626 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:53,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:53,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1715635622, now seen corresponding path program 1 times [2024-11-28 03:43:53,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:53,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131048133] [2024-11-28 03:43:53,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:53,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:53,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:43:53,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:53,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131048133] [2024-11-28 03:43:53,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131048133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:53,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:53,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:43:53,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870074539] [2024-11-28 03:43:53,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:53,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:43:53,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:53,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:43:53,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:43:53,685 INFO L87 Difference]: Start difference. First operand 192 states and 219 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 03:43:53,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:53,812 INFO L93 Difference]: Finished difference Result 191 states and 217 transitions. [2024-11-28 03:43:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:43:53,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 03:43:53,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:53,813 INFO L225 Difference]: With dead ends: 191 [2024-11-28 03:43:53,814 INFO L226 Difference]: Without dead ends: 191 [2024-11-28 03:43:53,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:43:53,814 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 11 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:53,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 179 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:43:53,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-28 03:43:53,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-11-28 03:43:53,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 176 states have (on average 1.2329545454545454) internal successors, (217), 190 states have internal predecessors, (217), 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 03:43:53,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 217 transitions. [2024-11-28 03:43:53,819 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 217 transitions. Word has length 35 [2024-11-28 03:43:53,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:53,819 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 217 transitions. [2024-11-28 03:43:53,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 03:43:53,819 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 217 transitions. [2024-11-28 03:43:53,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-28 03:43:53,819 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:53,820 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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:43:53,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-28 03:43:53,820 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:53,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:53,821 INFO L85 PathProgramCache]: Analyzing trace with hash -984206536, now seen corresponding path program 1 times [2024-11-28 03:43:53,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:53,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326282142] [2024-11-28 03:43:53,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:53,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:54,586 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:43:54,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:54,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326282142] [2024-11-28 03:43:54,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326282142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:54,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:54,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 03:43:54,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960109622] [2024-11-28 03:43:54,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:54,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 03:43:54,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:54,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 03:43:54,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-28 03:43:54,587 INFO L87 Difference]: Start difference. First operand 191 states and 217 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 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 03:43:55,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:55,285 INFO L93 Difference]: Finished difference Result 213 states and 239 transitions. [2024-11-28 03:43:55,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-28 03:43:55,286 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 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 40 [2024-11-28 03:43:55,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:55,286 INFO L225 Difference]: With dead ends: 213 [2024-11-28 03:43:55,287 INFO L226 Difference]: Without dead ends: 189 [2024-11-28 03:43:55,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2024-11-28 03:43:55,287 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 194 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:55,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 544 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 03:43:55,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-28 03:43:55,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 175. [2024-11-28 03:43:55,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 160 states have (on average 1.25) internal successors, (200), 174 states have internal predecessors, (200), 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 03:43:55,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 200 transitions. [2024-11-28 03:43:55,292 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 200 transitions. Word has length 40 [2024-11-28 03:43:55,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:55,292 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 200 transitions. [2024-11-28 03:43:55,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 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 03:43:55,292 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 200 transitions. [2024-11-28 03:43:55,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-28 03:43:55,293 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:55,293 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:55,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-28 03:43:55,293 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:43:55,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:55,294 INFO L85 PathProgramCache]: Analyzing trace with hash 69220979, now seen corresponding path program 1 times [2024-11-28 03:43:55,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:55,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701146910] [2024-11-28 03:43:55,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:55,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:56,159 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:43:56,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:56,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701146910] [2024-11-28 03:43:56,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701146910] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:43:56,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108235537] [2024-11-28 03:43:56,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:56,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:43:56,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:43:56,163 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:43:56,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:43:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:56,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-28 03:43:56,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:43:56,345 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 11 treesize of output 7 [2024-11-28 03:43:56,350 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 11 treesize of output 7 [2024-11-28 03:43:56,358 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-28 03:43:56,367 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 27 treesize of output 11 [2024-11-28 03:43:56,403 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-28 03:43:56,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2024-11-28 03:43:56,897 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:43:56,897 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 03:43:56,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:43:56,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:43:56,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2024-11-28 03:43:57,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:43:57,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:43:57,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:43:57,005 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:43:57,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 26 [2024-11-28 03:43:57,213 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:43:57,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 60 [2024-11-28 03:43:57,226 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 37 treesize of output 18 [2024-11-28 03:43:57,389 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:43:57,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 60 [2024-11-28 03:43:57,399 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 37 treesize of output 18 [2024-11-28 03:43:57,551 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:43:57,551 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 67 treesize of output 60 [2024-11-28 03:43:57,557 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 37 treesize of output 18 [2024-11-28 03:43:57,720 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:43:57,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:43:57,824 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)))) (and (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1455) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_1454 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1454) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)))) is different from false [2024-11-28 03:43:57,844 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem23#1.base| v_ArrVal_1453))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1454)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem23#1.base| v_ArrVal_1452) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem23#1.base| v_ArrVal_1453) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1455) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)))) is different from false [2024-11-28 03:43:57,858 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1453))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1454)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1452) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1453) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1455) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))))) is different from false [2024-11-28 03:43:57,883 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1450 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1451))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1450) .cse0 v_ArrVal_1452) (select (select (store .cse1 .cse0 v_ArrVal_1453) |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_1455))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (= (select (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1451))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_1453)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_1454)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)))) is different from false [2024-11-28 03:43:58,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:43:58,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 194 treesize of output 212 [2024-11-28 03:43:58,587 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((v_ArrVal_1455 (Array Int Int)) (v_prenex_1 Int) (v_ArrVal_1452 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_ArrVal_1450 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_ArrVal_1448 Int)) (or (= (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse3 .cse0 v_prenex_1)) v_prenex_1 v_prenex_3))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 v_ArrVal_1448)) v_prenex_1 v_ArrVal_1450) .cse1 v_ArrVal_1452) (select (select (store .cse2 .cse1 v_prenex_2) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1455))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0) (= v_prenex_1 |c_ULTIMATE.start_main_~n~0#1.base|))) (forall ((v_ArrVal_1454 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc21#1.base_9| Int) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (or (= (select (select (let ((.cse4 (let ((.cse5 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse3 .cse0 |v_ULTIMATE.start_main_#t~malloc21#1.base_9|)) |v_ULTIMATE.start_main_#t~malloc21#1.base_9| v_ArrVal_1451))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1453)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1454)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0) (= |v_ULTIMATE.start_main_#t~malloc21#1.base_9| |c_ULTIMATE.start_main_~n~0#1.base|))))) is different from false [2024-11-28 03:43:58,684 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2024-11-28 03:43:58,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108235537] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:43:58,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:43:58,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 36 [2024-11-28 03:43:58,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212567224] [2024-11-28 03:43:58,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:43:58,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-28 03:43:58,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:58,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-28 03:43:58,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=782, Unknown=22, NotChecked=310, Total=1260 [2024-11-28 03:43:58,687 INFO L87 Difference]: Start difference. First operand 175 states and 200 transitions. Second operand has 36 states, 36 states have (on average 2.861111111111111) internal successors, (103), 36 states have internal predecessors, (103), 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 03:44:01,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:44:01,082 INFO L93 Difference]: Finished difference Result 293 states and 337 transitions. [2024-11-28 03:44:01,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-28 03:44:01,082 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.861111111111111) internal successors, (103), 36 states have internal predecessors, (103), 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 45 [2024-11-28 03:44:01,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:44:01,083 INFO L225 Difference]: With dead ends: 293 [2024-11-28 03:44:01,083 INFO L226 Difference]: Without dead ends: 293 [2024-11-28 03:44:01,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 69 SyntacticMatches, 10 SemanticMatches, 57 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=495, Invalid=2363, Unknown=24, NotChecked=540, Total=3422 [2024-11-28 03:44:01,085 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 301 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1197 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:44:01,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 1026 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 978 Invalid, 0 Unknown, 1197 Unchecked, 1.2s Time] [2024-11-28 03:44:01,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-28 03:44:01,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 201. [2024-11-28 03:44:01,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 186 states have (on average 1.2419354838709677) internal successors, (231), 200 states have internal predecessors, (231), 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 03:44:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 231 transitions. [2024-11-28 03:44:01,090 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 231 transitions. Word has length 45 [2024-11-28 03:44:01,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:44:01,090 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 231 transitions. [2024-11-28 03:44:01,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.861111111111111) internal successors, (103), 36 states have internal predecessors, (103), 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 03:44:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 231 transitions. [2024-11-28 03:44:01,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-28 03:44:01,092 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:44:01,092 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:01,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 03:44:01,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:44:01,293 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:44:01,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:44:01,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1194077392, now seen corresponding path program 1 times [2024-11-28 03:44:01,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:44:01,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340581696] [2024-11-28 03:44:01,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:44:01,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:44:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:44:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:44:01,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:44:01,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340581696] [2024-11-28 03:44:01,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340581696] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:44:01,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582095741] [2024-11-28 03:44:01,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:44:01,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:44:01,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:44:01,798 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:44:01,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 03:44:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:44:01,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-28 03:44:01,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:44:02,075 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:44:02,076 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:44:02,130 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 15 treesize of output 1 [2024-11-28 03:44:02,239 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:44:02,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-28 03:44:02,328 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:44:02,328 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 34 treesize of output 33 [2024-11-28 03:44:02,404 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:44:02,405 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 34 treesize of output 33 [2024-11-28 03:44:02,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-28 03:44:02,630 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:44:02,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:44:02,771 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1552 (Array Int Int)) (v_ArrVal_1551 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_1551))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1552)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2024-11-28 03:44:02,778 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1552 (Array Int Int)) (v_ArrVal_1551 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1551))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1552)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2024-11-28 03:44:02,790 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1552 (Array Int Int)) (v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1550))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1551)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1552)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2024-11-28 03:44:02,802 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1552 (Array Int Int)) (v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1550))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1551)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1552)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2024-11-28 03:44:02,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:44:02,815 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 51 [2024-11-28 03:44:02,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:44:02,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6300 treesize of output 5451 [2024-11-28 03:44:03,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:44:03,003 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 924 treesize of output 892 [2024-11-28 03:44:03,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 884 treesize of output 852 [2024-11-28 03:44:03,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:44:03,046 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 852 treesize of output 768 [2024-11-28 03:44:09,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:44:09,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 174 treesize of output 672 [2024-11-28 03:46:29,190 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:46:29,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582095741] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:46:29,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:46:29,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 31 [2024-11-28 03:46:29,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525772938] [2024-11-28 03:46:29,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:46:29,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-28 03:46:29,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:46:29,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-28 03:46:29,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=601, Unknown=17, NotChecked=220, Total=992 [2024-11-28 03:46:29,192 INFO L87 Difference]: Start difference. First operand 201 states and 231 transitions. Second operand has 32 states, 31 states have (on average 3.2903225806451615) internal successors, (102), 32 states have internal predecessors, (102), 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 03:46:30,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:46:30,844 INFO L93 Difference]: Finished difference Result 401 states and 480 transitions. [2024-11-28 03:46:30,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 03:46:30,844 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.2903225806451615) internal successors, (102), 32 states have internal predecessors, (102), 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 45 [2024-11-28 03:46:30,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:46:30,846 INFO L225 Difference]: With dead ends: 401 [2024-11-28 03:46:30,846 INFO L226 Difference]: Without dead ends: 401 [2024-11-28 03:46:30,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=252, Invalid=936, Unknown=18, NotChecked=276, Total=1482 [2024-11-28 03:46:30,847 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 381 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 2326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1145 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:46:30,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1127 Invalid, 2326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1145 Invalid, 0 Unknown, 1145 Unchecked, 1.3s Time] [2024-11-28 03:46:30,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-28 03:46:30,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 263. [2024-11-28 03:46:30,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 248 states have (on average 1.2741935483870968) internal successors, (316), 262 states have internal predecessors, (316), 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 03:46:30,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 316 transitions. [2024-11-28 03:46:30,853 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 316 transitions. Word has length 45 [2024-11-28 03:46:30,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:46:30,854 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 316 transitions. [2024-11-28 03:46:30,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.2903225806451615) internal successors, (102), 32 states have internal predecessors, (102), 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 03:46:30,854 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 316 transitions. [2024-11-28 03:46:30,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-28 03:46:30,855 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:46:30,855 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:30,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 03:46:31,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:46:31,056 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:46:31,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:46:31,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1194077391, now seen corresponding path program 1 times [2024-11-28 03:46:31,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:46:31,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548695729] [2024-11-28 03:46:31,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:46:31,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:46:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:46:31,817 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:46:31,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:46:31,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548695729] [2024-11-28 03:46:31,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548695729] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:46:31,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615586517] [2024-11-28 03:46:31,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:46:31,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:46:31,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:46:31,820 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:46:31,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 03:46:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:46:32,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-28 03:46:32,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:46:32,026 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:46:32,031 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:46:32,058 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-28 03:46:32,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-28 03:46:32,305 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:46:32,305 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 03:46:32,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-28 03:46:32,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-28 03:46:32,535 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:46:32,535 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 59 treesize of output 52 [2024-11-28 03:46:32,550 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 35 treesize of output 20 [2024-11-28 03:46:32,686 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:46:32,687 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 59 treesize of output 52 [2024-11-28 03:46:32,698 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 35 treesize of output 20 [2024-11-28 03:46:32,835 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:46:32,835 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 59 treesize of output 52 [2024-11-28 03:46:32,849 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 35 treesize of output 20 [2024-11-28 03:46:32,957 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:46:32,957 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:46:32,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615586517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:46:32,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 03:46:32,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 25 [2024-11-28 03:46:32,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844771166] [2024-11-28 03:46:32,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:46:32,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 03:46:32,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:46:32,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 03:46:32,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2024-11-28 03:46:32,959 INFO L87 Difference]: Start difference. First operand 263 states and 316 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 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 03:46:33,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:46:33,794 INFO L93 Difference]: Finished difference Result 288 states and 342 transitions. [2024-11-28 03:46:33,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 03:46:33,794 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 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 45 [2024-11-28 03:46:33,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:46:33,795 INFO L225 Difference]: With dead ends: 288 [2024-11-28 03:46:33,795 INFO L226 Difference]: Without dead ends: 288 [2024-11-28 03:46:33,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=153, Invalid=1107, Unknown=0, NotChecked=0, Total=1260 [2024-11-28 03:46:33,796 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 65 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:46:33,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 509 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:46:33,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-28 03:46:33,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 276. [2024-11-28 03:46:33,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 261 states have (on average 1.2567049808429118) internal successors, (328), 275 states have internal predecessors, (328), 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 03:46:33,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 328 transitions. [2024-11-28 03:46:33,802 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 328 transitions. Word has length 45 [2024-11-28 03:46:33,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:46:33,803 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 328 transitions. [2024-11-28 03:46:33,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 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 03:46:33,803 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 328 transitions. [2024-11-28 03:46:33,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-28 03:46:33,804 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:46:33,804 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:33,816 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 03:46:34,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:46:34,005 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:46:34,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:46:34,005 INFO L85 PathProgramCache]: Analyzing trace with hash -173009037, now seen corresponding path program 1 times [2024-11-28 03:46:34,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:46:34,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297440890] [2024-11-28 03:46:34,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:46:34,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:46:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:46:34,994 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:46:34,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:46:34,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297440890] [2024-11-28 03:46:34,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297440890] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:46:34,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021103884] [2024-11-28 03:46:34,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:46:34,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:46:34,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:46:34,997 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:46:34,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 03:46:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:46:35,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-28 03:46:35,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:46:35,329 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 03:46:35,346 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:46:35,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:46:35,397 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 11 treesize of output 7 [2024-11-28 03:46:35,408 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 15 treesize of output 1 [2024-11-28 03:46:35,524 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-28 03:46:35,524 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 53 treesize of output 35 [2024-11-28 03:46:35,540 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 24 treesize of output 11 [2024-11-28 03:46:35,712 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2024-11-28 03:46:35,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 50 [2024-11-28 03:46:35,723 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 24 treesize of output 11 [2024-11-28 03:46:35,800 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:46:35,800 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 50 treesize of output 45 [2024-11-28 03:46:35,808 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 24 treesize of output 11 [2024-11-28 03:46:35,985 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 25 treesize of output 13 [2024-11-28 03:46:35,991 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 7 treesize of output 3 [2024-11-28 03:46:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:46:35,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:46:36,218 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1758 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem17#1.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem17#1.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem17#1.base| v_ArrVal_1759) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))) is different from false [2024-11-28 03:46:36,233 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (and (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1758) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1759) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))) (forall ((v_ArrVal_1758 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1758) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))) is different from false [2024-11-28 03:46:36,275 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_1757) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_1756) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1758) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_1756))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_1757) .cse0 v_ArrVal_1758) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 4) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1759) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))))) is different from false [2024-11-28 03:46:36,301 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (and (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1757) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1756) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1758) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1756))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1757) .cse1 v_ArrVal_1758) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1759) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))))))) is different from false [2024-11-28 03:46:36,350 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem15#1.base|))) (and (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (|ULTIMATE.start_main_#t~mem15#1.offset| Int)) (<= 0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem15#1.base| (store .cse2 |ULTIMATE.start_main_#t~mem15#1.offset| 0)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1755) .cse0 v_ArrVal_1757) (select (select (store .cse1 .cse0 v_ArrVal_1756) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1758))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (|ULTIMATE.start_main_#t~mem15#1.offset| Int) (v_ArrVal_1759 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem15#1.base| (store .cse2 |ULTIMATE.start_main_#t~mem15#1.offset| 0)))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1756))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1755) .cse3 v_ArrVal_1757) .cse4 v_ArrVal_1758) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 4) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1759) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))))))))) is different from false [2024-11-28 03:46:36,389 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse0))) (and (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (|ULTIMATE.start_main_#t~mem15#1.offset| Int) (v_ArrVal_1759 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse0 (store .cse5 |ULTIMATE.start_main_#t~mem15#1.offset| 0)))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (let ((.cse3 (store .cse4 .cse1 v_ArrVal_1756))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1755) .cse1 v_ArrVal_1757) .cse2 v_ArrVal_1758) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 4) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1759) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))))))) (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (|ULTIMATE.start_main_#t~mem15#1.offset| Int)) (<= 0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 (store .cse5 |ULTIMATE.start_main_#t~mem15#1.offset| 0)))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1755) .cse6 v_ArrVal_1757) (select (select (store .cse7 .cse6 v_ArrVal_1756) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1758))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))))) is different from false [2024-11-28 03:46:36,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:46:36,429 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 112 [2024-11-28 03:46:36,493 INFO L349 Elim1Store]: treesize reduction 15, result has 70.0 percent of original size [2024-11-28 03:46:36,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 113 [2024-11-28 03:46:36,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:46:36,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 424 treesize of output 419 [2024-11-28 03:46:36,556 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 742 treesize of output 722 [2024-11-28 03:46:36,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 328 treesize of output 304 [2024-11-28 03:46:36,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 227 [2024-11-28 03:46:36,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 302 treesize of output 296 [2024-11-28 03:46:36,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 284 [2024-11-28 03:46:36,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 03:46:37,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:46:37,204 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 67 treesize of output 69 [2024-11-28 03:46:37,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:46:37,266 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 237 [2024-11-28 03:46:37,270 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:46:37,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:46:37,278 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-11-28 03:46:37,282 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:46:37,283 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:46:37,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2024-11-28 03:46:37,291 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:46:37,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-11-28 03:46:37,301 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 03:46:37,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:46:37,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2024-11-28 03:46:37,619 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:46:37,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021103884] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:46:37,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:46:37,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 36 [2024-11-28 03:46:37,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224525060] [2024-11-28 03:46:37,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:46:37,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-28 03:46:37,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:46:37,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-28 03:46:37,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=783, Unknown=6, NotChecked=378, Total=1332 [2024-11-28 03:46:37,626 INFO L87 Difference]: Start difference. First operand 276 states and 328 transitions. Second operand has 37 states, 36 states have (on average 3.4444444444444446) internal successors, (124), 37 states have internal predecessors, (124), 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 03:46:40,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:46:40,001 INFO L93 Difference]: Finished difference Result 442 states and 517 transitions. [2024-11-28 03:46:40,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-28 03:46:40,001 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.4444444444444446) internal successors, (124), 37 states have internal predecessors, (124), 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 45 [2024-11-28 03:46:40,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:46:40,003 INFO L225 Difference]: With dead ends: 442 [2024-11-28 03:46:40,003 INFO L226 Difference]: Without dead ends: 442 [2024-11-28 03:46:40,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=502, Invalid=1966, Unknown=6, NotChecked=606, Total=3080 [2024-11-28 03:46:40,004 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 918 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 3024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1789 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:46:40,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 1180 Invalid, 3024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1143 Invalid, 0 Unknown, 1789 Unchecked, 1.2s Time] [2024-11-28 03:46:40,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-28 03:46:40,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 280. [2024-11-28 03:46:40,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 265 states have (on average 1.2528301886792452) internal successors, (332), 279 states have internal predecessors, (332), 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 03:46:40,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 332 transitions. [2024-11-28 03:46:40,013 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 332 transitions. Word has length 45 [2024-11-28 03:46:40,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:46:40,013 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 332 transitions. [2024-11-28 03:46:40,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.4444444444444446) internal successors, (124), 37 states have internal predecessors, (124), 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 03:46:40,013 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 332 transitions. [2024-11-28 03:46:40,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-28 03:46:40,014 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:46:40,014 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:40,033 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 03:46:40,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:46:40,215 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:46:40,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:46:40,216 INFO L85 PathProgramCache]: Analyzing trace with hash -172824340, now seen corresponding path program 1 times [2024-11-28 03:46:40,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:46:40,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610715571] [2024-11-28 03:46:40,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:46:40,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:46:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:46:40,639 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:46:40,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:46:40,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610715571] [2024-11-28 03:46:40,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610715571] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:46:40,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933017424] [2024-11-28 03:46:40,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:46:40,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:46:40,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:46:40,643 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:46:40,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 03:46:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:46:40,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-28 03:46:40,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:46:41,179 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:46:41,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:46:41,318 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-28 03:46:41,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 25 [2024-11-28 03:46:41,332 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-28 03:46:41,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 12 [2024-11-28 03:46:41,435 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:46:41,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933017424] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:46:41,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:46:41,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2024-11-28 03:46:41,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535806208] [2024-11-28 03:46:41,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:46:41,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 03:46:41,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:46:41,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 03:46:41,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-28 03:46:41,438 INFO L87 Difference]: Start difference. First operand 280 states and 332 transitions. Second operand has 19 states, 19 states have (on average 4.578947368421052) internal successors, (87), 19 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:46:42,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:46:42,095 INFO L93 Difference]: Finished difference Result 379 states and 450 transitions. [2024-11-28 03:46:42,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 03:46:42,095 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.578947368421052) internal successors, (87), 19 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-28 03:46:42,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:46:42,096 INFO L225 Difference]: With dead ends: 379 [2024-11-28 03:46:42,097 INFO L226 Difference]: Without dead ends: 379 [2024-11-28 03:46:42,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2024-11-28 03:46:42,098 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 326 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:46:42,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 585 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:46:42,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-28 03:46:42,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 314. [2024-11-28 03:46:42,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 299 states have (on average 1.2575250836120402) internal successors, (376), 313 states have internal predecessors, (376), 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 03:46:42,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 376 transitions. [2024-11-28 03:46:42,105 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 376 transitions. Word has length 45 [2024-11-28 03:46:42,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:46:42,105 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 376 transitions. [2024-11-28 03:46:42,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.578947368421052) internal successors, (87), 19 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:46:42,106 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 376 transitions. [2024-11-28 03:46:42,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-28 03:46:42,106 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:46:42,107 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:42,119 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 03:46:42,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:46:42,312 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:46:42,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:46:42,312 INFO L85 PathProgramCache]: Analyzing trace with hash 48270575, now seen corresponding path program 1 times [2024-11-28 03:46:42,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:46:42,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45305092] [2024-11-28 03:46:42,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:46:42,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:46:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:46:43,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:46:43,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:46:43,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45305092] [2024-11-28 03:46:43,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45305092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:46:43,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:46:43,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 03:46:43,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30688634] [2024-11-28 03:46:43,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:46:43,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 03:46:43,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:46:43,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 03:46:43,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:46:43,165 INFO L87 Difference]: Start difference. First operand 314 states and 376 transitions. Second operand has 14 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 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 03:46:44,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:46:44,149 INFO L93 Difference]: Finished difference Result 352 states and 417 transitions. [2024-11-28 03:46:44,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 03:46:44,150 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 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 52 [2024-11-28 03:46:44,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:46:44,151 INFO L225 Difference]: With dead ends: 352 [2024-11-28 03:46:44,151 INFO L226 Difference]: Without dead ends: 352 [2024-11-28 03:46:44,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2024-11-28 03:46:44,152 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 191 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:46:44,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 413 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 03:46:44,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-28 03:46:44,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 314. [2024-11-28 03:46:44,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 299 states have (on average 1.254180602006689) internal successors, (375), 313 states have internal predecessors, (375), 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 03:46:44,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 375 transitions. [2024-11-28 03:46:44,158 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 375 transitions. Word has length 52 [2024-11-28 03:46:44,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:46:44,159 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 375 transitions. [2024-11-28 03:46:44,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 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 03:46:44,159 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 375 transitions. [2024-11-28 03:46:44,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 03:46:44,160 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:46:44,160 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:44,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-28 03:46:44,160 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:46:44,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:46:44,161 INFO L85 PathProgramCache]: Analyzing trace with hash -827649991, now seen corresponding path program 1 times [2024-11-28 03:46:44,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:46:44,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731511551] [2024-11-28 03:46:44,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:46:44,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:46:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:46:45,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:46:45,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:46:45,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731511551] [2024-11-28 03:46:45,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731511551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:46:45,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245122767] [2024-11-28 03:46:45,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:46:45,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:46:45,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:46:45,381 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:46:45,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 03:46:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:46:45,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-28 03:46:45,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:46:45,837 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:46:45,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:46:45,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 03:46:46,037 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:46:46,037 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 33 treesize of output 32 [2024-11-28 03:46:46,138 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:46:46,138 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 33 treesize of output 32 [2024-11-28 03:46:46,199 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:46:46,200 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 33 treesize of output 32 [2024-11-28 03:46:46,283 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 03:46:46,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2024-11-28 03:46:46,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 03:46:46,350 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-28 03:46:46,350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 41 [2024-11-28 03:46:46,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:46:46,754 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-11-28 03:46:46,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 78 [2024-11-28 03:46:46,963 INFO L349 Elim1Store]: treesize reduction 16, result has 44.8 percent of original size [2024-11-28 03:46:46,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 27 [2024-11-28 03:46:47,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:46:47,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:46:47,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-28 03:46:47,655 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~s~0#1.base| Int) (v_ArrVal_2056 (Array Int Int)) (v_ArrVal_2055 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~root~0#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem24#1.base| v_ArrVal_2055) |ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2056) |c_ULTIMATE.start_main_~root~0#1.base|) 4) 0)))) is different from false [2024-11-28 03:46:47,667 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~s~0#1.base| Int) (v_ArrVal_2056 (Array Int Int)) (v_ArrVal_2055 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~root~0#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_2055) |ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2056) |c_ULTIMATE.start_main_~root~0#1.base|) 4) 0)))) is different from false [2024-11-28 03:46:48,033 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~s~0#1.base| Int) (v_ArrVal_2056 (Array Int Int)) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2054 (Array Int Int)) (v_ArrVal_2053 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~root~0#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select (store (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_2053))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_2054)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_2055))) |ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2056) |c_ULTIMATE.start_main_~root~0#1.base|) 4) 0)))) is different from false [2024-11-28 03:46:48,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:46:48,199 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 61 [2024-11-28 03:46:48,201 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:46:48,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:46:48,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2129 treesize of output 1730 [2024-11-28 03:46:48,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:46:48,285 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 538 treesize of output 399 [2024-11-28 03:46:48,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:46:48,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 390 treesize of output 363 [2024-11-28 03:46:48,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 354 treesize of output 342 [2024-11-28 03:46:49,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:46:49,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 52 [2024-11-28 03:46:49,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:46:49,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245122767] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:46:49,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:46:49,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 24] total 54 [2024-11-28 03:46:49,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549710820] [2024-11-28 03:46:49,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:46:49,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-28 03:46:49,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:46:49,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-28 03:46:49,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=2290, Unknown=62, NotChecked=300, Total=2862 [2024-11-28 03:46:49,055 INFO L87 Difference]: Start difference. First operand 314 states and 375 transitions. Second operand has 54 states, 54 states have (on average 2.6296296296296298) internal successors, (142), 54 states have internal predecessors, (142), 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 03:46:52,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:46:52,864 INFO L93 Difference]: Finished difference Result 495 states and 591 transitions. [2024-11-28 03:46:52,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-28 03:46:52,865 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.6296296296296298) internal successors, (142), 54 states have internal predecessors, (142), 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 55 [2024-11-28 03:46:52,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:46:52,867 INFO L225 Difference]: With dead ends: 495 [2024-11-28 03:46:52,867 INFO L226 Difference]: Without dead ends: 494 [2024-11-28 03:46:52,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 78 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1417 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=619, Invalid=5173, Unknown=72, NotChecked=456, Total=6320 [2024-11-28 03:46:52,868 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 658 mSDsluCounter, 1650 mSDsCounter, 0 mSdLazyCounter, 2178 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 3043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 2178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 788 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:46:52,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1720 Invalid, 3043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 2178 Invalid, 0 Unknown, 788 Unchecked, 2.0s Time] [2024-11-28 03:46:52,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-11-28 03:46:52,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 431. [2024-11-28 03:46:52,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 416 states have (on average 1.2620192307692308) internal successors, (525), 430 states have internal predecessors, (525), 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 03:46:52,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 525 transitions. [2024-11-28 03:46:52,876 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 525 transitions. Word has length 55 [2024-11-28 03:46:52,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:46:52,876 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 525 transitions. [2024-11-28 03:46:52,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.6296296296296298) internal successors, (142), 54 states have internal predecessors, (142), 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 03:46:52,877 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 525 transitions. [2024-11-28 03:46:52,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 03:46:52,877 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:46:52,877 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:52,888 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 03:46:53,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:46:53,078 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:46:53,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:46:53,078 INFO L85 PathProgramCache]: Analyzing trace with hash 853932664, now seen corresponding path program 1 times [2024-11-28 03:46:53,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:46:53,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002789467] [2024-11-28 03:46:53,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:46:53,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:46:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:46:54,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:46:54,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:46:54,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002789467] [2024-11-28 03:46:54,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002789467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:46:54,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:46:54,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-28 03:46:54,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24302771] [2024-11-28 03:46:54,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:46:54,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 03:46:54,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:46:54,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 03:46:54,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2024-11-28 03:46:54,227 INFO L87 Difference]: Start difference. First operand 431 states and 525 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 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 03:46:55,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:46:55,245 INFO L93 Difference]: Finished difference Result 631 states and 760 transitions. [2024-11-28 03:46:55,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-28 03:46:55,245 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 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 55 [2024-11-28 03:46:55,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:46:55,247 INFO L225 Difference]: With dead ends: 631 [2024-11-28 03:46:55,247 INFO L226 Difference]: Without dead ends: 631 [2024-11-28 03:46:55,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=939, Unknown=0, NotChecked=0, Total=1122 [2024-11-28 03:46:55,248 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 352 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:46:55,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1018 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 03:46:55,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-28 03:46:55,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 492. [2024-11-28 03:46:55,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 477 states have (on average 1.2557651991614256) internal successors, (599), 491 states have internal predecessors, (599), 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 03:46:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 599 transitions. [2024-11-28 03:46:55,256 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 599 transitions. Word has length 55 [2024-11-28 03:46:55,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:46:55,257 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 599 transitions. [2024-11-28 03:46:55,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 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 03:46:55,257 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 599 transitions. [2024-11-28 03:46:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-28 03:46:55,257 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:46:55,257 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:55,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-28 03:46:55,258 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 03:46:55,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:46:55,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1754063334, now seen corresponding path program 1 times [2024-11-28 03:46:55,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:46:55,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801990980] [2024-11-28 03:46:55,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:46:55,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:46:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:46:56,131 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:46:56,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:46:56,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801990980] [2024-11-28 03:46:56,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801990980] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:46:56,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404800722] [2024-11-28 03:46:56,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:46:56,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:46:56,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:46:56,134 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:46:56,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bfb18e-ccb8-4046-9a54-7324c60db734/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 03:46:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:46:56,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-28 03:46:56,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:46:56,441 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:46:56,441 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:46:56,486 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 15 treesize of output 1 [2024-11-28 03:46:56,542 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:46:56,543 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 34 treesize of output 33 [2024-11-28 03:46:56,619 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:46:56,619 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 34 treesize of output 33 [2024-11-28 03:46:56,713 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:46:56,713 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 34 treesize of output 33 [2024-11-28 03:46:56,810 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-28 03:46:56,811 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 28 treesize of output 36 [2024-11-28 03:46:56,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:46:56,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 51 treesize of output 27 [2024-11-28 03:46:57,063 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:46:57,064 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 55 [2024-11-28 03:46:57,196 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:46:57,196 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 64 [2024-11-28 03:46:57,384 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:46:57,384 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 64 [2024-11-28 03:46:57,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:46:57,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 60 treesize of output 26 [2024-11-28 03:46:57,897 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:46:57,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:46:57,994 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2275 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_2275) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2024-11-28 03:46:58,381 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc21#1.base_16| Int) (v_ArrVal_2275 (Array Int Int)) (v_ArrVal_2274 (Array Int Int)) (v_ArrVal_2273 (Array Int Int)) (v_ArrVal_2270 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse4 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse3 |v_ULTIMATE.start_main_#t~malloc21#1.base_16|)) |v_ULTIMATE.start_main_#t~malloc21#1.base_16| v_ArrVal_2273))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc21#1.base_16| v_ArrVal_2270)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~n~0#1.base|) .cse3))) (or (not (= (select .cse0 .cse1) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc21#1.base_16|) 0)) (= (select .cse0 (select (select (let ((.cse2 (store .cse4 .cse1 v_ArrVal_2274))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse3) v_ArrVal_2275)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)))))) is different from false [2024-11-28 03:47:04,409 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:47:04,761 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-28 03:47:04,769 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 2 case distinctions, treesize of input 170336250 treesize of output 126033940 [2024-11-28 03:47:05,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:47:05,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 153566 treesize of output 149890 [2024-11-28 03:47:05,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:47:05,698 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 9540 treesize of output 8970 [2024-11-28 03:47:06,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:47:06,138 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 8994 treesize of output 8630 [2024-11-28 03:47:06,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7511 treesize of output 7311 [2024-11-28 03:47:06,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1654 treesize of output 1622 [2024-11-28 03:47:06,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 03:49:43,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:49:43,789 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 8766 treesize of output 8434