./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_of_cslls.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_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1 --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 e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 13:56:31,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 13:56:31,087 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-12-02 13:56:31,091 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 13:56:31,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 13:56:31,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 13:56:31,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 13:56:31,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 13:56:31,113 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 13:56:31,113 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 13:56:31,113 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 13:56:31,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 13:56:31,113 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 13:56:31,113 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 13:56:31,114 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 13:56:31,114 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 13:56:31,114 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 13:56:31,114 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 13:56:31,114 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 13:56:31,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 13:56:31,114 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-02 13:56:31,114 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-02 13:56:31,114 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-02 13:56:31,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 13:56:31,115 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 13:56:31,115 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 13:56:31,115 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 13:56:31,115 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 13:56:31,115 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 13:56:31,115 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 13:56:31,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 13:56:31,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 13:56:31,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 13:56:31,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 13:56:31,116 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 13:56:31,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 13:56:31,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 13:56:31,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 13:56:31,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 13:56:31,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 13:56:31,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 13:56:31,117 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 13:56:31,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 13:56:31,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 13:56:31,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 13:56:31,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 13:56:31,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 13:56:31,117 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_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1 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 -> e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c [2024-12-02 13:56:31,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 13:56:31,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 13:56:31,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 13:56:31,345 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 13:56:31,346 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 13:56:31,347 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2024-12-02 13:56:33,942 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/data/fa1832df7/6272c831ddad4aef9677ce80be26ffea/FLAGf0f8a3274 [2024-12-02 13:56:34,187 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 13:56:34,188 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2024-12-02 13:56:34,200 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/data/fa1832df7/6272c831ddad4aef9677ce80be26ffea/FLAGf0f8a3274 [2024-12-02 13:56:34,521 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/data/fa1832df7/6272c831ddad4aef9677ce80be26ffea [2024-12-02 13:56:34,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 13:56:34,524 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 13:56:34,525 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 13:56:34,525 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 13:56:34,529 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 13:56:34,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:56:34" (1/1) ... [2024-12-02 13:56:34,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@433ed6f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:34, skipping insertion in model container [2024-12-02 13:56:34,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:56:34" (1/1) ... [2024-12-02 13:56:34,559 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 13:56:34,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 13:56:34,824 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 13:56:34,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 13:56:34,897 INFO L204 MainTranslator]: Completed translation [2024-12-02 13:56:34,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:34 WrapperNode [2024-12-02 13:56:34,897 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 13:56:34,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 13:56:34,898 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 13:56:34,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 13:56:34,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:34" (1/1) ... [2024-12-02 13:56:34,916 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:34" (1/1) ... [2024-12-02 13:56:34,939 INFO L138 Inliner]: procedures = 123, calls = 63, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 217 [2024-12-02 13:56:34,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 13:56:34,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 13:56:34,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 13:56:34,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 13:56:34,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:34" (1/1) ... [2024-12-02 13:56:34,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:34" (1/1) ... [2024-12-02 13:56:34,953 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:34" (1/1) ... [2024-12-02 13:56:34,975 INFO L175 MemorySlicer]: Split 49 memory accesses to 2 slices as follows [2, 47]. 96 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-12-02 13:56:34,975 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:34" (1/1) ... [2024-12-02 13:56:34,975 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:34" (1/1) ... [2024-12-02 13:56:34,986 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:34" (1/1) ... [2024-12-02 13:56:34,987 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:34" (1/1) ... [2024-12-02 13:56:34,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:34" (1/1) ... [2024-12-02 13:56:34,993 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:34" (1/1) ... [2024-12-02 13:56:34,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:34" (1/1) ... [2024-12-02 13:56:34,998 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 13:56:34,999 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 13:56:34,999 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 13:56:34,999 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 13:56:35,000 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:34" (1/1) ... [2024-12-02 13:56:35,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 13:56:35,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:56:35,031 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 13:56:35,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 13:56:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-02 13:56:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 13:56:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-12-02 13:56:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-12-02 13:56:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-12-02 13:56:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-12-02 13:56:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-02 13:56:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 13:56:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-12-02 13:56:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 13:56:35,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 13:56:35,153 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 13:56:35,154 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 13:56:35,673 INFO L? ?]: Removed 233 outVars from TransFormulas that were not future-live. [2024-12-02 13:56:35,673 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 13:56:35,687 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 13:56:35,687 INFO L312 CfgBuilder]: Removed 7 assume(true) statements. [2024-12-02 13:56:35,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:56:35 BoogieIcfgContainer [2024-12-02 13:56:35,688 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 13:56:35,690 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 13:56:35,690 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 13:56:35,694 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 13:56:35,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:56:34" (1/3) ... [2024-12-02 13:56:35,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a69467d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:56:35, skipping insertion in model container [2024-12-02 13:56:35,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:34" (2/3) ... [2024-12-02 13:56:35,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a69467d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:56:35, skipping insertion in model container [2024-12-02 13:56:35,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:56:35" (3/3) ... [2024-12-02 13:56:35,696 INFO L128 eAbstractionObserver]: Analyzing ICFG tree_of_cslls.i [2024-12-02 13:56:35,707 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 13:56:35,708 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tree_of_cslls.i that has 1 procedures, 217 locations, 1 initial locations, 7 loop locations, and 104 error locations. [2024-12-02 13:56:35,745 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 13:56:35,754 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;@1c7ddb7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 13:56:35,755 INFO L334 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2024-12-02 13:56:35,758 INFO L276 IsEmpty]: Start isEmpty. Operand has 217 states, 112 states have (on average 2.142857142857143) internal successors, (240), 216 states have internal predecessors, (240), 0 states have call successors, (0), 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-12-02 13:56:35,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-12-02 13:56:35,762 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:56:35,762 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-12-02 13:56:35,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:56:35,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:56:35,767 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-12-02 13:56:35,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:56:35,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055121904] [2024-12-02 13:56:35,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:56:35,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:56:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:56:35,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:56:35,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:56:35,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055121904] [2024-12-02 13:56:35,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055121904] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:56:35,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:56:35,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:56:35,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24016217] [2024-12-02 13:56:35,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:56:35,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:56:35,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:56:35,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:56:35,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:56:35,962 INFO L87 Difference]: Start difference. First operand has 217 states, 112 states have (on average 2.142857142857143) internal successors, (240), 216 states have internal predecessors, (240), 0 states have call successors, (0), 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-12-02 13:56:36,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:56:36,259 INFO L93 Difference]: Finished difference Result 286 states and 309 transitions. [2024-12-02 13:56:36,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:56:36,261 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-12-02 13:56:36,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:56:36,268 INFO L225 Difference]: With dead ends: 286 [2024-12-02 13:56:36,268 INFO L226 Difference]: Without dead ends: 284 [2024-12-02 13:56:36,269 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-12-02 13:56:36,272 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 193 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 13:56:36,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 208 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 13:56:36,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-12-02 13:56:36,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 206. [2024-12-02 13:56:36,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 111 states have (on average 2.0) internal successors, (222), 205 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-12-02 13:56:36,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 222 transitions. [2024-12-02 13:56:36,310 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 222 transitions. Word has length 3 [2024-12-02 13:56:36,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:56:36,310 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 222 transitions. [2024-12-02 13:56:36,310 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-12-02 13:56:36,310 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 222 transitions. [2024-12-02 13:56:36,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-12-02 13:56:36,310 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:56:36,310 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-12-02 13:56:36,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 13:56:36,311 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:56:36,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:56:36,311 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-12-02 13:56:36,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:56:36,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405136472] [2024-12-02 13:56:36,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:56:36,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:56:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:56:36,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:56:36,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:56:36,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405136472] [2024-12-02 13:56:36,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405136472] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:56:36,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:56:36,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:56:36,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150455448] [2024-12-02 13:56:36,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:56:36,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:56:36,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:56:36,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:56:36,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:56:36,390 INFO L87 Difference]: Start difference. First operand 206 states and 222 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-12-02 13:56:36,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:56:36,538 INFO L93 Difference]: Finished difference Result 204 states and 220 transitions. [2024-12-02 13:56:36,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:56:36,539 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-12-02 13:56:36,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:56:36,540 INFO L225 Difference]: With dead ends: 204 [2024-12-02 13:56:36,540 INFO L226 Difference]: Without dead ends: 204 [2024-12-02 13:56:36,540 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-12-02 13:56:36,541 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 2 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 13:56:36,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 332 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 13:56:36,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-12-02 13:56:36,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-12-02 13:56:36,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 111 states have (on average 1.981981981981982) internal successors, (220), 203 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-12-02 13:56:36,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 220 transitions. [2024-12-02 13:56:36,548 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 220 transitions. Word has length 3 [2024-12-02 13:56:36,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:56:36,548 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 220 transitions. [2024-12-02 13:56:36,549 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-12-02 13:56:36,549 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 220 transitions. [2024-12-02 13:56:36,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-02 13:56:36,549 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:56:36,549 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-12-02 13:56:36,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 13:56:36,549 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:56:36,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:56:36,550 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2024-12-02 13:56:36,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:56:36,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589549435] [2024-12-02 13:56:36,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:56:36,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:56:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:56:36,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:56:36,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:56:36,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589549435] [2024-12-02 13:56:36,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589549435] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:56:36,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:56:36,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 13:56:36,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282259924] [2024-12-02 13:56:36,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:56:36,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 13:56:36,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:56:36,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 13:56:36,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 13:56:36,743 INFO L87 Difference]: Start difference. First operand 204 states and 220 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:56:37,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:56:37,054 INFO L93 Difference]: Finished difference Result 359 states and 389 transitions. [2024-12-02 13:56:37,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 13:56:37,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-12-02 13:56:37,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:56:37,056 INFO L225 Difference]: With dead ends: 359 [2024-12-02 13:56:37,056 INFO L226 Difference]: Without dead ends: 359 [2024-12-02 13:56:37,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 13:56:37,057 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 473 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 13:56:37,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 210 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 13:56:37,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-12-02 13:56:37,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 197. [2024-12-02 13:56:37,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 111 states have (on average 1.9189189189189189) internal successors, (213), 196 states have internal predecessors, (213), 0 states have call successors, (0), 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-12-02 13:56:37,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 213 transitions. [2024-12-02 13:56:37,068 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 213 transitions. Word has length 6 [2024-12-02 13:56:37,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:56:37,068 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 213 transitions. [2024-12-02 13:56:37,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:56:37,068 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 213 transitions. [2024-12-02 13:56:37,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-02 13:56:37,069 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:56:37,069 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:56:37,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 13:56:37,069 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:56:37,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:56:37,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924364, now seen corresponding path program 1 times [2024-12-02 13:56:37,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:56:37,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946200108] [2024-12-02 13:56:37,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:56:37,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:56:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:56:37,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:56:37,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:56:37,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946200108] [2024-12-02 13:56:37,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946200108] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:56:37,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:56:37,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 13:56:37,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669161825] [2024-12-02 13:56:37,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:56:37,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 13:56:37,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:56:37,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 13:56:37,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 13:56:37,196 INFO L87 Difference]: Start difference. First operand 197 states and 213 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:56:37,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:56:37,432 INFO L93 Difference]: Finished difference Result 196 states and 212 transitions. [2024-12-02 13:56:37,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 13:56:37,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-12-02 13:56:37,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:56:37,433 INFO L225 Difference]: With dead ends: 196 [2024-12-02 13:56:37,433 INFO L226 Difference]: Without dead ends: 196 [2024-12-02 13:56:37,433 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-12-02 13:56:37,434 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 3 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 13:56:37,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 535 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 13:56:37,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-12-02 13:56:37,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2024-12-02 13:56:37,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 111 states have (on average 1.90990990990991) internal successors, (212), 195 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-12-02 13:56:37,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 212 transitions. [2024-12-02 13:56:37,443 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 212 transitions. Word has length 10 [2024-12-02 13:56:37,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:56:37,443 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 212 transitions. [2024-12-02 13:56:37,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:56:37,444 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 212 transitions. [2024-12-02 13:56:37,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-02 13:56:37,444 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:56:37,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:56:37,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 13:56:37,445 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:56:37,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:56:37,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924365, now seen corresponding path program 1 times [2024-12-02 13:56:37,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:56:37,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492688298] [2024-12-02 13:56:37,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:56:37,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:56:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:56:37,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:56:37,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:56:37,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492688298] [2024-12-02 13:56:37,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492688298] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:56:37,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:56:37,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 13:56:37,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80394263] [2024-12-02 13:56:37,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:56:37,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 13:56:37,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:56:37,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 13:56:37,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 13:56:37,665 INFO L87 Difference]: Start difference. First operand 196 states and 212 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:56:37,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:56:37,924 INFO L93 Difference]: Finished difference Result 195 states and 211 transitions. [2024-12-02 13:56:37,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 13:56:37,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-12-02 13:56:37,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:56:37,926 INFO L225 Difference]: With dead ends: 195 [2024-12-02 13:56:37,926 INFO L226 Difference]: Without dead ends: 195 [2024-12-02 13:56:37,926 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-12-02 13:56:37,927 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 2 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 13:56:37,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 556 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 13:56:37,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-12-02 13:56:37,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-12-02 13:56:37,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 111 states have (on average 1.9009009009009008) internal successors, (211), 194 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-12-02 13:56:37,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 211 transitions. [2024-12-02 13:56:37,934 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 211 transitions. Word has length 10 [2024-12-02 13:56:37,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:56:37,934 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 211 transitions. [2024-12-02 13:56:37,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:56:37,934 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 211 transitions. [2024-12-02 13:56:37,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-02 13:56:37,934 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:56:37,934 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:56:37,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 13:56:37,935 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:56:37,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:56:37,935 INFO L85 PathProgramCache]: Analyzing trace with hash 191727319, now seen corresponding path program 1 times [2024-12-02 13:56:37,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:56:37,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224831888] [2024-12-02 13:56:37,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:56:37,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:56:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:56:38,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:56:38,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:56:38,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224831888] [2024-12-02 13:56:38,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224831888] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:56:38,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:56:38,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 13:56:38,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197903013] [2024-12-02 13:56:38,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:56:38,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 13:56:38,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:56:38,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 13:56:38,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-12-02 13:56:38,281 INFO L87 Difference]: Start difference. First operand 195 states and 211 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 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-12-02 13:56:38,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:56:38,734 INFO L93 Difference]: Finished difference Result 361 states and 399 transitions. [2024-12-02 13:56:38,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 13:56:38,735 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-12-02 13:56:38,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:56:38,736 INFO L225 Difference]: With dead ends: 361 [2024-12-02 13:56:38,736 INFO L226 Difference]: Without dead ends: 361 [2024-12-02 13:56:38,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-12-02 13:56:38,737 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 474 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 13:56:38,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 641 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 13:56:38,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-12-02 13:56:38,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 200. [2024-12-02 13:56:38,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 116 states have (on average 1.8793103448275863) internal successors, (218), 199 states have internal predecessors, (218), 0 states have call successors, (0), 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-12-02 13:56:38,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 218 transitions. [2024-12-02 13:56:38,744 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 218 transitions. Word has length 16 [2024-12-02 13:56:38,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:56:38,744 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 218 transitions. [2024-12-02 13:56:38,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 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-12-02 13:56:38,744 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 218 transitions. [2024-12-02 13:56:38,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-02 13:56:38,745 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:56:38,745 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:56:38,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 13:56:38,745 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:56:38,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:56:38,745 INFO L85 PathProgramCache]: Analyzing trace with hash 191727320, now seen corresponding path program 1 times [2024-12-02 13:56:38,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:56:38,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741825233] [2024-12-02 13:56:38,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:56:38,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:56:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:56:39,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:56:39,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:56:39,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741825233] [2024-12-02 13:56:39,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741825233] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:56:39,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:56:39,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 13:56:39,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18143131] [2024-12-02 13:56:39,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:56:39,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 13:56:39,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:56:39,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 13:56:39,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-12-02 13:56:39,269 INFO L87 Difference]: Start difference. First operand 200 states and 218 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 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-12-02 13:56:39,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:56:39,726 INFO L93 Difference]: Finished difference Result 282 states and 313 transitions. [2024-12-02 13:56:39,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 13:56:39,726 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-12-02 13:56:39,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:56:39,727 INFO L225 Difference]: With dead ends: 282 [2024-12-02 13:56:39,727 INFO L226 Difference]: Without dead ends: 282 [2024-12-02 13:56:39,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-12-02 13:56:39,728 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 478 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 13:56:39,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 490 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 13:56:39,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-12-02 13:56:39,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 200. [2024-12-02 13:56:39,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 116 states have (on average 1.8706896551724137) internal successors, (217), 199 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-12-02 13:56:39,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 217 transitions. [2024-12-02 13:56:39,734 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 217 transitions. Word has length 16 [2024-12-02 13:56:39,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:56:39,734 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 217 transitions. [2024-12-02 13:56:39,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 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-12-02 13:56:39,735 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 217 transitions. [2024-12-02 13:56:39,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-02 13:56:39,735 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:56:39,735 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:56:39,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 13:56:39,735 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:56:39,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:56:39,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1648579604, now seen corresponding path program 1 times [2024-12-02 13:56:39,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:56:39,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236165891] [2024-12-02 13:56:39,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:56:39,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:56:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:56:39,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:56:39,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:56:39,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236165891] [2024-12-02 13:56:39,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236165891] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:56:39,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:56:39,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:56:39,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219839773] [2024-12-02 13:56:39,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:56:39,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:56:39,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:56:39,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:56:39,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:56:39,793 INFO L87 Difference]: Start difference. First operand 200 states and 217 transitions. Second operand has 3 states, 2 states have (on average 8.5) 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-12-02 13:56:39,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:56:39,912 INFO L93 Difference]: Finished difference Result 197 states and 214 transitions. [2024-12-02 13:56:39,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:56:39,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) 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-12-02 13:56:39,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:56:39,914 INFO L225 Difference]: With dead ends: 197 [2024-12-02 13:56:39,914 INFO L226 Difference]: Without dead ends: 197 [2024-12-02 13:56:39,914 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-12-02 13:56:39,915 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 23 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 13:56:39,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 283 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 13:56:39,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-12-02 13:56:39,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2024-12-02 13:56:39,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 116 states have (on average 1.8448275862068966) internal successors, (214), 196 states have internal predecessors, (214), 0 states have call successors, (0), 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-12-02 13:56:39,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 214 transitions. [2024-12-02 13:56:39,920 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 214 transitions. Word has length 17 [2024-12-02 13:56:39,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:56:39,920 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 214 transitions. [2024-12-02 13:56:39,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) 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-12-02 13:56:39,920 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 214 transitions. [2024-12-02 13:56:39,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-02 13:56:39,921 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:56:39,921 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:56:39,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 13:56:39,921 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:56:39,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:56:39,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1648579605, now seen corresponding path program 1 times [2024-12-02 13:56:39,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:56:39,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945230442] [2024-12-02 13:56:39,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:56:39,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:56:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:56:40,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:56:40,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:56:40,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945230442] [2024-12-02 13:56:40,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945230442] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:56:40,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:56:40,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:56:40,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426144844] [2024-12-02 13:56:40,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:56:40,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:56:40,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:56:40,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:56:40,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:56:40,010 INFO L87 Difference]: Start difference. First operand 197 states and 214 transitions. Second operand has 3 states, 2 states have (on average 8.5) 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-12-02 13:56:40,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:56:40,135 INFO L93 Difference]: Finished difference Result 195 states and 212 transitions. [2024-12-02 13:56:40,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:56:40,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) 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-12-02 13:56:40,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:56:40,137 INFO L225 Difference]: With dead ends: 195 [2024-12-02 13:56:40,137 INFO L226 Difference]: Without dead ends: 195 [2024-12-02 13:56:40,137 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-12-02 13:56:40,138 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 16 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 13:56:40,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 295 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 13:56:40,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-12-02 13:56:40,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-12-02 13:56:40,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 116 states have (on average 1.8275862068965518) internal successors, (212), 194 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-12-02 13:56:40,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 212 transitions. [2024-12-02 13:56:40,143 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 212 transitions. Word has length 17 [2024-12-02 13:56:40,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:56:40,143 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 212 transitions. [2024-12-02 13:56:40,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) 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-12-02 13:56:40,143 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 212 transitions. [2024-12-02 13:56:40,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-02 13:56:40,144 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:56:40,144 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:56:40,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 13:56:40,144 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:56:40,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:56:40,144 INFO L85 PathProgramCache]: Analyzing trace with hash -354432464, now seen corresponding path program 1 times [2024-12-02 13:56:40,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:56:40,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340390147] [2024-12-02 13:56:40,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:56:40,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:56:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:56:40,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:56:40,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:56:40,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340390147] [2024-12-02 13:56:40,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340390147] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:56:40,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:56:40,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 13:56:40,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180598938] [2024-12-02 13:56:40,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:56:40,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 13:56:40,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:56:40,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 13:56:40,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 13:56:40,197 INFO L87 Difference]: Start difference. First operand 195 states and 212 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-12-02 13:56:40,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:56:40,436 INFO L93 Difference]: Finished difference Result 259 states and 287 transitions. [2024-12-02 13:56:40,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 13:56:40,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-12-02 13:56:40,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:56:40,438 INFO L225 Difference]: With dead ends: 259 [2024-12-02 13:56:40,438 INFO L226 Difference]: Without dead ends: 259 [2024-12-02 13:56:40,438 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-12-02 13:56:40,439 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 271 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 13:56:40,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 180 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 13:56:40,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-12-02 13:56:40,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 185. [2024-12-02 13:56:40,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 121 states have (on average 1.7024793388429753) internal successors, (206), 184 states have internal predecessors, (206), 0 states have call successors, (0), 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-12-02 13:56:40,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 206 transitions. [2024-12-02 13:56:40,444 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 206 transitions. Word has length 18 [2024-12-02 13:56:40,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:56:40,444 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 206 transitions. [2024-12-02 13:56:40,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-12-02 13:56:40,444 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 206 transitions. [2024-12-02 13:56:40,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-02 13:56:40,444 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:56:40,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:56:40,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 13:56:40,445 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:56:40,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:56:40,445 INFO L85 PathProgramCache]: Analyzing trace with hash -354432463, now seen corresponding path program 1 times [2024-12-02 13:56:40,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:56:40,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727612979] [2024-12-02 13:56:40,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:56:40,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:56:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:56:40,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:56:40,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:56:40,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727612979] [2024-12-02 13:56:40,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727612979] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:56:40,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:56:40,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 13:56:40,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800828100] [2024-12-02 13:56:40,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:56:40,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 13:56:40,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:56:40,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 13:56:40,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 13:56:40,534 INFO L87 Difference]: Start difference. First operand 185 states and 206 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-12-02 13:56:40,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:56:40,878 INFO L93 Difference]: Finished difference Result 428 states and 485 transitions. [2024-12-02 13:56:40,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 13:56:40,878 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-12-02 13:56:40,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:56:40,879 INFO L225 Difference]: With dead ends: 428 [2024-12-02 13:56:40,879 INFO L226 Difference]: Without dead ends: 428 [2024-12-02 13:56:40,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-12-02 13:56:40,880 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 670 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 13:56:40,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 329 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 13:56:40,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-12-02 13:56:40,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 335. [2024-12-02 13:56:40,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 271 states have (on average 1.7121771217712176) internal successors, (464), 334 states have internal predecessors, (464), 0 states have call successors, (0), 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-12-02 13:56:40,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 464 transitions. [2024-12-02 13:56:40,886 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 464 transitions. Word has length 18 [2024-12-02 13:56:40,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:56:40,886 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 464 transitions. [2024-12-02 13:56:40,886 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-12-02 13:56:40,887 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 464 transitions. [2024-12-02 13:56:40,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-02 13:56:40,887 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:56:40,887 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-12-02 13:56:40,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 13:56:40,887 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:56:40,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:56:40,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1897700132, now seen corresponding path program 1 times [2024-12-02 13:56:40,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:56:40,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532724904] [2024-12-02 13:56:40,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:56:40,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:56:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:56:40,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:56:40,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:56:40,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532724904] [2024-12-02 13:56:40,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532724904] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:56:40,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:56:40,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 13:56:40,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88612003] [2024-12-02 13:56:40,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:56:40,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:56:40,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:56:40,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:56:40,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:56:40,926 INFO L87 Difference]: Start difference. First operand 335 states and 464 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:56:40,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:56:40,948 INFO L93 Difference]: Finished difference Result 411 states and 544 transitions. [2024-12-02 13:56:40,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:56:40,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-12-02 13:56:40,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:56:40,950 INFO L225 Difference]: With dead ends: 411 [2024-12-02 13:56:40,950 INFO L226 Difference]: Without dead ends: 411 [2024-12-02 13:56:40,950 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-12-02 13:56:40,950 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 171 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:56:40,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 304 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:56:40,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-12-02 13:56:40,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 377. [2024-12-02 13:56:40,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 313 states have (on average 1.7380191693290734) internal successors, (544), 376 states have internal predecessors, (544), 0 states have call successors, (0), 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-12-02 13:56:40,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 544 transitions. [2024-12-02 13:56:40,958 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 544 transitions. Word has length 19 [2024-12-02 13:56:40,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:56:40,958 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 544 transitions. [2024-12-02 13:56:40,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:56:40,958 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 544 transitions. [2024-12-02 13:56:40,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-02 13:56:40,959 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:56:40,959 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-12-02 13:56:40,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 13:56:40,959 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:56:40,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:56:40,959 INFO L85 PathProgramCache]: Analyzing trace with hash -116033059, now seen corresponding path program 1 times [2024-12-02 13:56:40,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:56:40,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996165351] [2024-12-02 13:56:40,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:56:40,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:56:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:56:41,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:56:41,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:56:41,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996165351] [2024-12-02 13:56:41,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996165351] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:56:41,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:56:41,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 13:56:41,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764806268] [2024-12-02 13:56:41,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:56:41,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 13:56:41,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:56:41,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 13:56:41,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-12-02 13:56:41,065 INFO L87 Difference]: Start difference. First operand 377 states and 544 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-12-02 13:56:41,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:56:41,383 INFO L93 Difference]: Finished difference Result 511 states and 745 transitions. [2024-12-02 13:56:41,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 13:56:41,383 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-12-02 13:56:41,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:56:41,385 INFO L225 Difference]: With dead ends: 511 [2024-12-02 13:56:41,385 INFO L226 Difference]: Without dead ends: 511 [2024-12-02 13:56:41,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-12-02 13:56:41,386 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 179 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 13:56:41,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 580 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 13:56:41,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-12-02 13:56:41,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 376. [2024-12-02 13:56:41,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 313 states have (on average 1.7348242811501597) internal successors, (543), 375 states have internal predecessors, (543), 0 states have call successors, (0), 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-12-02 13:56:41,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 543 transitions. [2024-12-02 13:56:41,392 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 543 transitions. Word has length 20 [2024-12-02 13:56:41,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:56:41,393 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 543 transitions. [2024-12-02 13:56:41,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-12-02 13:56:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 543 transitions. [2024-12-02 13:56:41,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-02 13:56:41,393 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:56:41,393 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-12-02 13:56:41,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 13:56:41,394 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:56:41,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:56:41,394 INFO L85 PathProgramCache]: Analyzing trace with hash -116033058, now seen corresponding path program 1 times [2024-12-02 13:56:41,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:56:41,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651490747] [2024-12-02 13:56:41,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:56:41,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:56:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:56:41,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:56:41,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:56:41,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651490747] [2024-12-02 13:56:41,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651490747] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:56:41,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:56:41,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 13:56:41,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769574999] [2024-12-02 13:56:41,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:56:41,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 13:56:41,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:56:41,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 13:56:41,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-12-02 13:56:41,577 INFO L87 Difference]: Start difference. First operand 376 states and 543 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-12-02 13:56:42,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:56:42,124 INFO L93 Difference]: Finished difference Result 510 states and 744 transitions. [2024-12-02 13:56:42,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 13:56:42,124 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-12-02 13:56:42,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:56:42,126 INFO L225 Difference]: With dead ends: 510 [2024-12-02 13:56:42,126 INFO L226 Difference]: Without dead ends: 510 [2024-12-02 13:56:42,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-12-02 13:56:42,126 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 173 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 13:56:42,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 721 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 13:56:42,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-12-02 13:56:42,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 375. [2024-12-02 13:56:42,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 313 states have (on average 1.731629392971246) internal successors, (542), 374 states have internal predecessors, (542), 0 states have call successors, (0), 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-12-02 13:56:42,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 542 transitions. [2024-12-02 13:56:42,133 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 542 transitions. Word has length 20 [2024-12-02 13:56:42,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:56:42,134 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 542 transitions. [2024-12-02 13:56:42,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-12-02 13:56:42,134 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 542 transitions. [2024-12-02 13:56:42,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-02 13:56:42,134 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:56:42,134 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-12-02 13:56:42,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 13:56:42,135 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:56:42,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:56:42,135 INFO L85 PathProgramCache]: Analyzing trace with hash -973202430, now seen corresponding path program 1 times [2024-12-02 13:56:42,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:56:42,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297855217] [2024-12-02 13:56:42,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:56:42,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:56:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:56:42,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:56:42,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:56:42,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297855217] [2024-12-02 13:56:42,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297855217] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:56:42,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:56:42,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 13:56:42,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387444863] [2024-12-02 13:56:42,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:56:42,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:56:42,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:56:42,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:56:42,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:56:42,164 INFO L87 Difference]: Start difference. First operand 375 states and 542 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-12-02 13:56:42,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:56:42,175 INFO L93 Difference]: Finished difference Result 379 states and 546 transitions. [2024-12-02 13:56:42,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:56:42,175 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-12-02 13:56:42,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:56:42,177 INFO L225 Difference]: With dead ends: 379 [2024-12-02 13:56:42,177 INFO L226 Difference]: Without dead ends: 379 [2024-12-02 13:56:42,177 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-12-02 13:56:42,177 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 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-12-02 13:56:42,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:56:42,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-12-02 13:56:42,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2024-12-02 13:56:42,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 317 states have (on average 1.722397476340694) internal successors, (546), 378 states have internal predecessors, (546), 0 states have call successors, (0), 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-12-02 13:56:42,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 546 transitions. [2024-12-02 13:56:42,186 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 546 transitions. Word has length 24 [2024-12-02 13:56:42,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:56:42,186 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 546 transitions. [2024-12-02 13:56:42,186 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-12-02 13:56:42,186 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 546 transitions. [2024-12-02 13:56:42,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-02 13:56:42,187 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:56:42,187 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-12-02 13:56:42,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 13:56:42,187 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:56:42,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:56:42,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1582542525, now seen corresponding path program 1 times [2024-12-02 13:56:42,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:56:42,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15089453] [2024-12-02 13:56:42,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:56:42,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:56:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:56:42,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:56:42,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:56:42,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15089453] [2024-12-02 13:56:42,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15089453] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:56:42,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:56:42,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 13:56:42,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977668661] [2024-12-02 13:56:42,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:56:42,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:56:42,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:56:42,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:56:42,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:56:42,215 INFO L87 Difference]: Start difference. First operand 379 states and 546 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-12-02 13:56:42,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:56:42,227 INFO L93 Difference]: Finished difference Result 382 states and 549 transitions. [2024-12-02 13:56:42,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:56:42,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-12-02 13:56:42,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:56:42,229 INFO L225 Difference]: With dead ends: 382 [2024-12-02 13:56:42,229 INFO L226 Difference]: Without dead ends: 382 [2024-12-02 13:56:42,229 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-12-02 13:56:42,229 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 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-12-02 13:56:42,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:56:42,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-12-02 13:56:42,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2024-12-02 13:56:42,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 320 states have (on average 1.715625) internal successors, (549), 381 states have internal predecessors, (549), 0 states have call successors, (0), 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-12-02 13:56:42,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 549 transitions. [2024-12-02 13:56:42,235 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 549 transitions. Word has length 26 [2024-12-02 13:56:42,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:56:42,235 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 549 transitions. [2024-12-02 13:56:42,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-12-02 13:56:42,236 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 549 transitions. [2024-12-02 13:56:42,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-02 13:56:42,236 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:56:42,236 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-12-02 13:56:42,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 13:56:42,237 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:56:42,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:56:42,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1103340637, now seen corresponding path program 1 times [2024-12-02 13:56:42,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:56:42,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405350398] [2024-12-02 13:56:42,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:56:42,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:56:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:56:42,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:56:42,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:56:42,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405350398] [2024-12-02 13:56:42,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405350398] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:56:42,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:56:42,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 13:56:42,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190232068] [2024-12-02 13:56:42,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:56:42,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:56:42,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:56:42,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:56:42,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:56:42,275 INFO L87 Difference]: Start difference. First operand 382 states and 549 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-12-02 13:56:42,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:56:42,297 INFO L93 Difference]: Finished difference Result 379 states and 530 transitions. [2024-12-02 13:56:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:56:42,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-12-02 13:56:42,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:56:42,298 INFO L225 Difference]: With dead ends: 379 [2024-12-02 13:56:42,298 INFO L226 Difference]: Without dead ends: 379 [2024-12-02 13:56:42,299 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-12-02 13:56:42,299 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 5 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:56:42,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 365 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:56:42,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-12-02 13:56:42,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 371. [2024-12-02 13:56:42,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 309 states have (on average 1.6990291262135921) internal successors, (525), 370 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-12-02 13:56:42,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 525 transitions. [2024-12-02 13:56:42,306 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 525 transitions. Word has length 26 [2024-12-02 13:56:42,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:56:42,306 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 525 transitions. [2024-12-02 13:56:42,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-12-02 13:56:42,306 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 525 transitions. [2024-12-02 13:56:42,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-02 13:56:42,307 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:56:42,307 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] [2024-12-02 13:56:42,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-02 13:56:42,307 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:56:42,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:56:42,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1245483444, now seen corresponding path program 1 times [2024-12-02 13:56:42,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:56:42,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692240059] [2024-12-02 13:56:42,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:56:42,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:56:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:56:42,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:56:42,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:56:42,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692240059] [2024-12-02 13:56:42,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692240059] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:56:42,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568902578] [2024-12-02 13:56:42,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:56:42,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:56:42,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:56:42,608 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:56:42,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 13:56:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:56:42,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-12-02 13:56:42,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:56:42,776 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-12-02 13:56:42,802 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 13:56:42,802 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-12-02 13:56:42,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 13:56:42,891 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 13:56:42,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 13:56:42,920 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 13:56:42,920 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-12-02 13:56:43,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-12-02 13:56:43,070 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 13:56:43,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 13:56:43,105 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-12-02 13:56:43,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 18 treesize of output 20 [2024-12-02 13:56:43,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-12-02 13:56:43,158 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:56:43,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:56:43,259 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_517 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_517) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) 1)) is different from false [2024-12-02 13:56:43,272 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_517 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_516))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_517)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) 1)) is different from false [2024-12-02 13:56:43,288 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-12-02 13:56:43,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-12-02 13:56:43,295 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_517 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem9#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_516))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_517)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) is different from false [2024-12-02 13:56:43,304 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_517 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_516))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_517)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)))) is different from false [2024-12-02 13:56:43,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 13:56:43,514 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 69 treesize of output 50 [2024-12-02 13:56:43,518 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 13:56:43,520 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 580 treesize of output 454 [2024-12-02 13:56:43,533 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-12-02 13:56:43,534 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 13 treesize of output 12 [2024-12-02 13:56:43,538 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 20 treesize of output 12 [2024-12-02 13:56:43,541 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 7 treesize of output 3 [2024-12-02 13:56:43,572 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-12-02 13:56:43,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568902578] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:56:43,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:56:43,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 13] total 26 [2024-12-02 13:56:43,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809211340] [2024-12-02 13:56:43,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:56:43,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-12-02 13:56:43,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:56:43,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-12-02 13:56:43,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=411, Unknown=18, NotChecked=180, Total=702 [2024-12-02 13:56:43,574 INFO L87 Difference]: Start difference. First operand 371 states and 525 transitions. Second operand has 27 states, 26 states have (on average 2.769230769230769) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 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-12-02 13:56:44,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:56:44,778 INFO L93 Difference]: Finished difference Result 597 states and 822 transitions. [2024-12-02 13:56:44,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 13:56:44,779 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.769230769230769) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 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-12-02 13:56:44,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:56:44,780 INFO L225 Difference]: With dead ends: 597 [2024-12-02 13:56:44,780 INFO L226 Difference]: Without dead ends: 597 [2024-12-02 13:56:44,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=162, Invalid=592, Unknown=18, NotChecked=220, Total=992 [2024-12-02 13:56:44,781 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 629 mSDsluCounter, 1974 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 2122 SdHoareTripleChecker+Invalid, 2582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1159 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:56:44,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 2122 Invalid, 2582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1395 Invalid, 0 Unknown, 1159 Unchecked, 1.0s Time] [2024-12-02 13:56:44,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-12-02 13:56:44,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 370. [2024-12-02 13:56:44,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 309 states have (on average 1.6957928802588997) internal successors, (524), 369 states have internal predecessors, (524), 0 states have call successors, (0), 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-12-02 13:56:44,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 524 transitions. [2024-12-02 13:56:44,788 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 524 transitions. Word has length 26 [2024-12-02 13:56:44,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:56:44,789 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 524 transitions. [2024-12-02 13:56:44,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.769230769230769) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 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-12-02 13:56:44,789 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 524 transitions. [2024-12-02 13:56:44,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-02 13:56:44,789 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:56:44,789 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] [2024-12-02 13:56:44,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 13:56:44,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-12-02 13:56:44,990 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:56:44,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:56:44,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1245483443, now seen corresponding path program 1 times [2024-12-02 13:56:44,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:56:44,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825193890] [2024-12-02 13:56:44,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:56:44,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:56:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:56:45,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:56:45,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:56:45,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825193890] [2024-12-02 13:56:45,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825193890] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:56:45,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136559875] [2024-12-02 13:56:45,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:56:45,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:56:45,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:56:45,553 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:56:45,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 13:56:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:56:45,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-12-02 13:56:45,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:56:45,685 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-12-02 13:56:45,721 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 13:56:45,721 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-12-02 13:56:45,752 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-12-02 13:56:45,755 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-12-02 13:56:45,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 13:56:45,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 34 [2024-12-02 13:56:45,881 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-12-02 13:56:45,928 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 13:56:45,928 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-12-02 13:56:46,066 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 26 [2024-12-02 13:56:46,078 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 16 treesize of output 11 [2024-12-02 13:56:46,197 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-12-02 13:56:46,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 61 [2024-12-02 13:56:46,203 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 11 [2024-12-02 13:56:46,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 13:56:46,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-12-02 13:56:46,275 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-12-02 13:56:46,276 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 15 treesize of output 15 [2024-12-02 13:56:46,314 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-12-02 13:56:46,318 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-12-02 13:56:46,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:56:46,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:56:46,823 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) 0))) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_616 Int)) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_612))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (or (< .cse0 0) (< 0 (+ (select (select (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_613) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse0 v_ArrVal_616))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) 1))))))) (forall ((v_ArrVal_612 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_612))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (or (< .cse4 0) (forall ((v_ArrVal_613 (Array Int Int)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int) (v_ArrVal_615 (Array Int Int)) (v_ArrVal_616 Int)) (or (forall ((v_ArrVal_617 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_613))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (<= (+ (select (select (store .cse5 .cse6 (store (select .cse5 .cse6) .cse4 v_ArrVal_616)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_617) (select (select (store .cse7 .cse6 v_ArrVal_615) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) 0)))))))))) is different from false [2024-12-02 13:56:46,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 13:56:46,877 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 277 treesize of output 281 [2024-12-02 13:56:46,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 13:56:46,913 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 253 treesize of output 271 [2024-12-02 13:56:47,174 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (or (forall ((v_prenex_8 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_8) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 0)) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_615 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_9))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_615)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem9#1.base|))) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_616 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_612))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (or (< .cse2 0) (< 0 (+ (select (select (let ((.cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_613) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse2 v_ArrVal_616))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 1)))))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_prenex_11 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_8))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (or (< .cse5 0) (< (select (select (let ((.cse7 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_9) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse5 v_prenex_11))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| 1)))))))) is different from false [2024-12-02 13:56:47,218 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (or (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_615 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_9))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_615)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (forall ((v_prenex_8 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_8) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) 0))) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_616 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_612))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (or (< .cse2 0) (< 0 (+ (select (select (let ((.cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_613) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse2 v_ArrVal_616))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) 1)))))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_prenex_11 Int)) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_8))) (let ((.cse7 (select (select .cse5 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (or (< (select (select (let ((.cse6 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_9) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_prenex_11))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) 1)) (< .cse7 0))))))) is different from false [2024-12-02 13:56:48,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 13:56:48,469 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 533 treesize of output 444 [2024-12-02 13:56:48,670 INFO L349 Elim1Store]: treesize reduction 57, result has 61.5 percent of original size [2024-12-02 13:56:48,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 500 treesize of output 409 [2024-12-02 13:56:48,728 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-12-02 13:56:48,728 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 2 case distinctions, treesize of input 7558 treesize of output 7538 [2024-12-02 13:56:48,813 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 773 treesize of output 733 [2024-12-02 13:56:48,838 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 733 treesize of output 673 [2024-12-02 13:56:49,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 13:56:49,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52254 treesize of output 48751 [2024-12-02 13:56:49,409 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 2709 treesize of output 2613 [2024-12-02 13:56:49,472 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 2623 treesize of output 2543 [2024-12-02 13:56:49,618 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 2681 treesize of output 2557 [2024-12-02 13:56:49,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 13:56:49,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2548 treesize of output 2588 [2024-12-02 13:56:49,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 2581 treesize of output 2457 [2024-12-02 13:56:50,033 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 3323 treesize of output 2963 [2024-12-02 13:56:50,137 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 2031 treesize of output 2023 [2024-12-02 13:56:50,212 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 2167 treesize of output 2047 [2024-12-02 13:56:50,278 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 2111 treesize of output 2047 [2024-12-02 13:56:50,342 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 2047 treesize of output 2043 [2024-12-02 13:56:50,417 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 2119 treesize of output 1995 [2024-12-02 13:57:33,264 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-12-02 13:57:33,273 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 43 treesize of output 35 [2024-12-02 13:57:33,278 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 8 treesize of output 4 [2024-12-02 13:57:33,361 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-12-02 13:57:33,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136559875] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:57:33,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:57:33,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 14] total 34 [2024-12-02 13:57:33,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670192596] [2024-12-02 13:57:33,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:57:33,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-12-02 13:57:33,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:57:33,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-12-02 13:57:33,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=860, Unknown=11, NotChecked=186, Total=1190 [2024-12-02 13:57:33,363 INFO L87 Difference]: Start difference. First operand 370 states and 524 transitions. Second operand has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 35 states have internal predecessors, (75), 0 states have call successors, (0), 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-12-02 13:57:36,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:57:36,634 INFO L93 Difference]: Finished difference Result 596 states and 821 transitions. [2024-12-02 13:57:36,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 13:57:36,635 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 35 states have internal predecessors, (75), 0 states have call successors, (0), 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-12-02 13:57:36,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:57:36,636 INFO L225 Difference]: With dead ends: 596 [2024-12-02 13:57:36,636 INFO L226 Difference]: Without dead ends: 596 [2024-12-02 13:57:36,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=225, Invalid=1108, Unknown=11, NotChecked=216, Total=1560 [2024-12-02 13:57:36,637 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 855 mSDsluCounter, 1932 mSDsCounter, 0 mSdLazyCounter, 1972 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 2064 SdHoareTripleChecker+Invalid, 2892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 879 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-12-02 13:57:36,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 2064 Invalid, 2892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1972 Invalid, 0 Unknown, 879 Unchecked, 2.9s Time] [2024-12-02 13:57:36,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-12-02 13:57:36,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 364. [2024-12-02 13:57:36,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 304 states have (on average 1.700657894736842) internal successors, (517), 363 states have internal predecessors, (517), 0 states have call successors, (0), 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-12-02 13:57:36,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 517 transitions. [2024-12-02 13:57:36,643 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 517 transitions. Word has length 26 [2024-12-02 13:57:36,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:57:36,643 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 517 transitions. [2024-12-02 13:57:36,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 35 states have internal predecessors, (75), 0 states have call successors, (0), 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-12-02 13:57:36,643 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 517 transitions. [2024-12-02 13:57:36,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-02 13:57:36,644 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:57:36,644 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-12-02 13:57:36,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 13:57:36,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:57:36,845 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:57:36,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:57:36,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1311422610, now seen corresponding path program 1 times [2024-12-02 13:57:36,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:57:36,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972739487] [2024-12-02 13:57:36,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:57:36,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:57:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:57:36,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:57:36,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:57:36,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972739487] [2024-12-02 13:57:36,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972739487] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:57:36,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:57:36,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:57:36,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966675077] [2024-12-02 13:57:36,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:57:36,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:57:36,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:57:36,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:57:36,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:57:36,888 INFO L87 Difference]: Start difference. First operand 364 states and 517 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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-12-02 13:57:36,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:57:36,995 INFO L93 Difference]: Finished difference Result 359 states and 512 transitions. [2024-12-02 13:57:36,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:57:36,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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-12-02 13:57:36,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:57:36,996 INFO L225 Difference]: With dead ends: 359 [2024-12-02 13:57:36,997 INFO L226 Difference]: Without dead ends: 359 [2024-12-02 13:57:36,997 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-12-02 13:57:36,997 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 8 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 13:57:36,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 267 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 13:57:36,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-12-02 13:57:37,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-12-02 13:57:37,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 304 states have (on average 1.6842105263157894) internal successors, (512), 358 states have internal predecessors, (512), 0 states have call successors, (0), 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-12-02 13:57:37,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 512 transitions. [2024-12-02 13:57:37,004 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 512 transitions. Word has length 28 [2024-12-02 13:57:37,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:57:37,005 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 512 transitions. [2024-12-02 13:57:37,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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-12-02 13:57:37,005 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 512 transitions. [2024-12-02 13:57:37,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-02 13:57:37,005 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:57:37,005 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-12-02 13:57:37,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-02 13:57:37,005 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:57:37,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:57:37,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1311422609, now seen corresponding path program 1 times [2024-12-02 13:57:37,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:57:37,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662341842] [2024-12-02 13:57:37,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:57:37,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:57:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:57:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:57:37,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:57:37,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662341842] [2024-12-02 13:57:37,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662341842] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:57:37,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:57:37,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:57:37,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500608056] [2024-12-02 13:57:37,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:57:37,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:57:37,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:57:37,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:57:37,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:57:37,078 INFO L87 Difference]: Start difference. First operand 359 states and 512 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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-12-02 13:57:37,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:57:37,187 INFO L93 Difference]: Finished difference Result 357 states and 510 transitions. [2024-12-02 13:57:37,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:57:37,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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-12-02 13:57:37,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:57:37,188 INFO L225 Difference]: With dead ends: 357 [2024-12-02 13:57:37,188 INFO L226 Difference]: Without dead ends: 357 [2024-12-02 13:57:37,188 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-12-02 13:57:37,189 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 5 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 13:57:37,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 265 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 13:57:37,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-12-02 13:57:37,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2024-12-02 13:57:37,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 304 states have (on average 1.6776315789473684) internal successors, (510), 356 states have internal predecessors, (510), 0 states have call successors, (0), 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-12-02 13:57:37,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 510 transitions. [2024-12-02 13:57:37,195 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 510 transitions. Word has length 28 [2024-12-02 13:57:37,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:57:37,195 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 510 transitions. [2024-12-02 13:57:37,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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-12-02 13:57:37,196 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 510 transitions. [2024-12-02 13:57:37,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-02 13:57:37,196 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:57:37,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:57:37,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-02 13:57:37,196 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:57:37,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:57:37,197 INFO L85 PathProgramCache]: Analyzing trace with hash -807259654, now seen corresponding path program 1 times [2024-12-02 13:57:37,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:57:37,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319218954] [2024-12-02 13:57:37,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:57:37,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:57:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:57:37,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:57:37,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:57:37,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319218954] [2024-12-02 13:57:37,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319218954] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:57:37,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:57:37,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 13:57:37,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696037684] [2024-12-02 13:57:37,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:57:37,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 13:57:37,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:57:37,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 13:57:37,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-12-02 13:57:37,549 INFO L87 Difference]: Start difference. First operand 357 states and 510 transitions. Second operand has 10 states, 10 states have (on average 2.8) 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-12-02 13:57:38,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:57:38,129 INFO L93 Difference]: Finished difference Result 571 states and 751 transitions. [2024-12-02 13:57:38,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 13:57:38,129 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) 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-12-02 13:57:38,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:57:38,131 INFO L225 Difference]: With dead ends: 571 [2024-12-02 13:57:38,131 INFO L226 Difference]: Without dead ends: 571 [2024-12-02 13:57:38,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-12-02 13:57:38,132 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 344 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 13:57:38,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1078 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 13:57:38,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2024-12-02 13:57:38,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 376. [2024-12-02 13:57:38,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 323 states have (on average 1.6563467492260062) internal successors, (535), 375 states have internal predecessors, (535), 0 states have call successors, (0), 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-12-02 13:57:38,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 535 transitions. [2024-12-02 13:57:38,141 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 535 transitions. Word has length 28 [2024-12-02 13:57:38,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:57:38,141 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 535 transitions. [2024-12-02 13:57:38,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) 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-12-02 13:57:38,141 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 535 transitions. [2024-12-02 13:57:38,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-02 13:57:38,141 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:57:38,141 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-12-02 13:57:38,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-02 13:57:38,142 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:57:38,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:57:38,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1883159683, now seen corresponding path program 1 times [2024-12-02 13:57:38,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:57:38,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425261979] [2024-12-02 13:57:38,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:57:38,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:57:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:57:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:57:38,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:57:38,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425261979] [2024-12-02 13:57:38,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425261979] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:57:38,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:57:38,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 13:57:38,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678162165] [2024-12-02 13:57:38,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:57:38,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 13:57:38,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:57:38,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 13:57:38,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 13:57:38,247 INFO L87 Difference]: Start difference. First operand 376 states and 535 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-12-02 13:57:38,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:57:38,440 INFO L93 Difference]: Finished difference Result 392 states and 557 transitions. [2024-12-02 13:57:38,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 13:57:38,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-12-02 13:57:38,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:57:38,442 INFO L225 Difference]: With dead ends: 392 [2024-12-02 13:57:38,442 INFO L226 Difference]: Without dead ends: 392 [2024-12-02 13:57:38,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-12-02 13:57:38,442 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 4 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 13:57:38,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 520 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 13:57:38,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-12-02 13:57:38,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2024-12-02 13:57:38,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 335 states have (on average 1.6417910447761195) internal successors, (550), 387 states have internal predecessors, (550), 0 states have call successors, (0), 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-12-02 13:57:38,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 550 transitions. [2024-12-02 13:57:38,450 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 550 transitions. Word has length 28 [2024-12-02 13:57:38,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:57:38,450 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 550 transitions. [2024-12-02 13:57:38,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-12-02 13:57:38,450 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 550 transitions. [2024-12-02 13:57:38,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-02 13:57:38,450 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:57:38,450 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-12-02 13:57:38,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-02 13:57:38,450 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:57:38,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:57:38,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1883344381, now seen corresponding path program 1 times [2024-12-02 13:57:38,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:57:38,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184906295] [2024-12-02 13:57:38,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:57:38,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:57:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:57:38,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:57:38,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:57:38,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184906295] [2024-12-02 13:57:38,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184906295] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:57:38,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:57:38,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 13:57:38,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733488653] [2024-12-02 13:57:38,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:57:38,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 13:57:38,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:57:38,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 13:57:38,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-12-02 13:57:38,787 INFO L87 Difference]: Start difference. First operand 388 states and 550 transitions. Second operand has 10 states, 10 states have (on average 2.8) 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-12-02 13:57:39,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:57:39,455 INFO L93 Difference]: Finished difference Result 587 states and 770 transitions. [2024-12-02 13:57:39,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 13:57:39,456 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) 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-12-02 13:57:39,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:57:39,457 INFO L225 Difference]: With dead ends: 587 [2024-12-02 13:57:39,457 INFO L226 Difference]: Without dead ends: 587 [2024-12-02 13:57:39,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-12-02 13:57:39,457 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 435 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 13:57:39,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1070 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 13:57:39,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2024-12-02 13:57:39,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 437. [2024-12-02 13:57:39,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 384 states have (on average 1.6458333333333333) internal successors, (632), 436 states have internal predecessors, (632), 0 states have call successors, (0), 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-12-02 13:57:39,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 632 transitions. [2024-12-02 13:57:39,463 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 632 transitions. Word has length 28 [2024-12-02 13:57:39,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:57:39,463 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 632 transitions. [2024-12-02 13:57:39,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) 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-12-02 13:57:39,464 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 632 transitions. [2024-12-02 13:57:39,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-02 13:57:39,464 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:57:39,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:57:39,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-12-02 13:57:39,464 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:57:39,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:57:39,465 INFO L85 PathProgramCache]: Analyzing trace with hash -546036285, now seen corresponding path program 1 times [2024-12-02 13:57:39,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:57:39,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754331602] [2024-12-02 13:57:39,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:57:39,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:57:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:57:39,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:57:39,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:57:39,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754331602] [2024-12-02 13:57:39,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754331602] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:57:39,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:57:39,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 13:57:39,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362524374] [2024-12-02 13:57:39,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:57:39,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 13:57:39,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:57:39,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 13:57:39,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-12-02 13:57:39,643 INFO L87 Difference]: Start difference. First operand 437 states and 632 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-12-02 13:57:40,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:57:40,161 INFO L93 Difference]: Finished difference Result 657 states and 921 transitions. [2024-12-02 13:57:40,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 13:57:40,161 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-12-02 13:57:40,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:57:40,162 INFO L225 Difference]: With dead ends: 657 [2024-12-02 13:57:40,162 INFO L226 Difference]: Without dead ends: 657 [2024-12-02 13:57:40,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-12-02 13:57:40,162 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 696 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 13:57:40,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 899 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 13:57:40,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-12-02 13:57:40,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 446. [2024-12-02 13:57:40,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 393 states have (on average 1.6361323155216285) internal successors, (643), 445 states have internal predecessors, (643), 0 states have call successors, (0), 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-12-02 13:57:40,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 643 transitions. [2024-12-02 13:57:40,169 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 643 transitions. Word has length 28 [2024-12-02 13:57:40,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:57:40,169 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 643 transitions. [2024-12-02 13:57:40,170 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-12-02 13:57:40,170 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 643 transitions. [2024-12-02 13:57:40,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-02 13:57:40,170 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:57:40,170 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:57:40,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-12-02 13:57:40,170 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:57:40,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:57:40,171 INFO L85 PathProgramCache]: Analyzing trace with hash -546036284, now seen corresponding path program 1 times [2024-12-02 13:57:40,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:57:40,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75854286] [2024-12-02 13:57:40,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:57:40,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:57:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:57:40,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:57:40,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:57:40,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75854286] [2024-12-02 13:57:40,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75854286] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:57:40,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:57:40,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 13:57:40,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621572097] [2024-12-02 13:57:40,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:57:40,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 13:57:40,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:57:40,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 13:57:40,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-12-02 13:57:40,444 INFO L87 Difference]: Start difference. First operand 446 states and 643 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 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-12-02 13:57:41,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:57:41,022 INFO L93 Difference]: Finished difference Result 654 states and 918 transitions. [2024-12-02 13:57:41,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 13:57:41,022 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 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-12-02 13:57:41,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:57:41,024 INFO L225 Difference]: With dead ends: 654 [2024-12-02 13:57:41,024 INFO L226 Difference]: Without dead ends: 654 [2024-12-02 13:57:41,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-12-02 13:57:41,024 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 405 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 13:57:41,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 574 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 13:57:41,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2024-12-02 13:57:41,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 446. [2024-12-02 13:57:41,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 393 states have (on average 1.633587786259542) internal successors, (642), 445 states have internal predecessors, (642), 0 states have call successors, (0), 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-12-02 13:57:41,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 642 transitions. [2024-12-02 13:57:41,032 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 642 transitions. Word has length 28 [2024-12-02 13:57:41,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:57:41,032 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 642 transitions. [2024-12-02 13:57:41,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 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-12-02 13:57:41,033 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 642 transitions. [2024-12-02 13:57:41,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-12-02 13:57:41,033 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:57:41,033 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-12-02 13:57:41,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-02 13:57:41,033 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:57:41,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:57:41,033 INFO L85 PathProgramCache]: Analyzing trace with hash 579151448, now seen corresponding path program 1 times [2024-12-02 13:57:41,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:57:41,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815523218] [2024-12-02 13:57:41,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:57:41,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:57:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:57:41,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:57:41,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:57:41,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815523218] [2024-12-02 13:57:41,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815523218] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:57:41,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:57:41,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-12-02 13:57:41,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820573459] [2024-12-02 13:57:41,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:57:41,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 13:57:41,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:57:41,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 13:57:41,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-12-02 13:57:41,380 INFO L87 Difference]: Start difference. First operand 446 states and 642 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 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-12-02 13:57:41,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:57:41,893 INFO L93 Difference]: Finished difference Result 568 states and 782 transitions. [2024-12-02 13:57:41,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 13:57:41,893 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 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-12-02 13:57:41,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:57:41,895 INFO L225 Difference]: With dead ends: 568 [2024-12-02 13:57:41,895 INFO L226 Difference]: Without dead ends: 568 [2024-12-02 13:57:41,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2024-12-02 13:57:41,895 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 416 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 13:57:41,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 671 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 13:57:41,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-12-02 13:57:41,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 400. [2024-12-02 13:57:41,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 347 states have (on average 1.6195965417867435) internal successors, (562), 399 states have internal predecessors, (562), 0 states have call successors, (0), 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-12-02 13:57:41,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 562 transitions. [2024-12-02 13:57:41,901 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 562 transitions. Word has length 30 [2024-12-02 13:57:41,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:57:41,901 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 562 transitions. [2024-12-02 13:57:41,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 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-12-02 13:57:41,901 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 562 transitions. [2024-12-02 13:57:41,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-02 13:57:41,902 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:57:41,902 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] [2024-12-02 13:57:41,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-12-02 13:57:41,902 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:57:41,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:57:41,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1568332822, now seen corresponding path program 1 times [2024-12-02 13:57:41,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:57:41,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231387103] [2024-12-02 13:57:41,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:57:41,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:57:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:57:42,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:57:42,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:57:42,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231387103] [2024-12-02 13:57:42,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231387103] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:57:42,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:57:42,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 13:57:42,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173146738] [2024-12-02 13:57:42,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:57:42,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 13:57:42,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:57:42,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 13:57:42,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 13:57:42,011 INFO L87 Difference]: Start difference. First operand 400 states and 562 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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-12-02 13:57:42,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:57:42,161 INFO L93 Difference]: Finished difference Result 397 states and 559 transitions. [2024-12-02 13:57:42,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:57:42,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-12-02 13:57:42,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:57:42,163 INFO L225 Difference]: With dead ends: 397 [2024-12-02 13:57:42,163 INFO L226 Difference]: Without dead ends: 397 [2024-12-02 13:57:42,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 13:57:42,163 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 7 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 13:57:42,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 330 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 13:57:42,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-12-02 13:57:42,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2024-12-02 13:57:42,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 347 states have (on average 1.6109510086455332) internal successors, (559), 396 states have internal predecessors, (559), 0 states have call successors, (0), 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-12-02 13:57:42,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 559 transitions. [2024-12-02 13:57:42,167 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 559 transitions. Word has length 31 [2024-12-02 13:57:42,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:57:42,167 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 559 transitions. [2024-12-02 13:57:42,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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-12-02 13:57:42,167 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 559 transitions. [2024-12-02 13:57:42,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-02 13:57:42,167 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:57:42,167 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] [2024-12-02 13:57:42,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-12-02 13:57:42,168 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:57:42,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:57:42,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1925560158, now seen corresponding path program 1 times [2024-12-02 13:57:42,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:57:42,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283799831] [2024-12-02 13:57:42,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:57:42,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:57:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:57:42,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:57:42,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:57:42,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283799831] [2024-12-02 13:57:42,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283799831] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:57:42,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:57:42,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 13:57:42,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730344401] [2024-12-02 13:57:42,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:57:42,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 13:57:42,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:57:42,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 13:57:42,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 13:57:42,215 INFO L87 Difference]: Start difference. First operand 397 states and 559 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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-12-02 13:57:42,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:57:42,432 INFO L93 Difference]: Finished difference Result 396 states and 555 transitions. [2024-12-02 13:57:42,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 13:57:42,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-12-02 13:57:42,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:57:42,433 INFO L225 Difference]: With dead ends: 396 [2024-12-02 13:57:42,433 INFO L226 Difference]: Without dead ends: 396 [2024-12-02 13:57:42,434 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-12-02 13:57:42,434 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 17 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 13:57:42,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 400 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 13:57:42,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-12-02 13:57:42,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-12-02 13:57:42,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 347 states have (on average 1.5994236311239194) internal successors, (555), 395 states have internal predecessors, (555), 0 states have call successors, (0), 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-12-02 13:57:42,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 555 transitions. [2024-12-02 13:57:42,438 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 555 transitions. Word has length 31 [2024-12-02 13:57:42,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:57:42,438 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 555 transitions. [2024-12-02 13:57:42,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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-12-02 13:57:42,438 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 555 transitions. [2024-12-02 13:57:42,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-02 13:57:42,438 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:57:42,439 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] [2024-12-02 13:57:42,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-12-02 13:57:42,439 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:57:42,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:57:42,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1925560157, now seen corresponding path program 1 times [2024-12-02 13:57:42,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:57:42,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911034389] [2024-12-02 13:57:42,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:57:42,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:57:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:57:42,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:57:42,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:57:42,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911034389] [2024-12-02 13:57:42,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911034389] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:57:42,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:57:42,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 13:57:42,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208555883] [2024-12-02 13:57:42,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:57:42,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 13:57:42,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:57:42,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 13:57:42,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 13:57:42,522 INFO L87 Difference]: Start difference. First operand 396 states and 555 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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-12-02 13:57:42,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:57:42,704 INFO L93 Difference]: Finished difference Result 395 states and 551 transitions. [2024-12-02 13:57:42,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 13:57:42,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-12-02 13:57:42,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:57:42,705 INFO L225 Difference]: With dead ends: 395 [2024-12-02 13:57:42,705 INFO L226 Difference]: Without dead ends: 395 [2024-12-02 13:57:42,706 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-12-02 13:57:42,706 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 17 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 13:57:42,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 396 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 13:57:42,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-12-02 13:57:42,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2024-12-02 13:57:42,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 347 states have (on average 1.5878962536023056) internal successors, (551), 394 states have internal predecessors, (551), 0 states have call successors, (0), 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-12-02 13:57:42,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 551 transitions. [2024-12-02 13:57:42,710 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 551 transitions. Word has length 31 [2024-12-02 13:57:42,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:57:42,710 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 551 transitions. [2024-12-02 13:57:42,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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-12-02 13:57:42,710 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 551 transitions. [2024-12-02 13:57:42,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-02 13:57:42,711 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:57:42,711 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] [2024-12-02 13:57:42,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-12-02 13:57:42,711 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:57:42,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:57:42,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1925557405, now seen corresponding path program 1 times [2024-12-02 13:57:42,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:57:42,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719174685] [2024-12-02 13:57:42,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:57:42,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:57:42,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:57:42,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:57:42,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:57:42,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719174685] [2024-12-02 13:57:42,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719174685] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:57:42,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:57:42,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 13:57:42,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110690508] [2024-12-02 13:57:42,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:57:42,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 13:57:42,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:57:42,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 13:57:42,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-12-02 13:57:42,884 INFO L87 Difference]: Start difference. First operand 395 states and 551 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 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-12-02 13:57:43,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:57:43,333 INFO L93 Difference]: Finished difference Result 557 states and 763 transitions. [2024-12-02 13:57:43,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 13:57:43,334 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-12-02 13:57:43,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:57:43,335 INFO L225 Difference]: With dead ends: 557 [2024-12-02 13:57:43,335 INFO L226 Difference]: Without dead ends: 557 [2024-12-02 13:57:43,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-12-02 13:57:43,335 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 398 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 13:57:43,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 771 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 13:57:43,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-12-02 13:57:43,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 398. [2024-12-02 13:57:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 350 states have (on average 1.5857142857142856) internal successors, (555), 397 states have internal predecessors, (555), 0 states have call successors, (0), 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-12-02 13:57:43,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 555 transitions. [2024-12-02 13:57:43,339 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 555 transitions. Word has length 31 [2024-12-02 13:57:43,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:57:43,339 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 555 transitions. [2024-12-02 13:57:43,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 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-12-02 13:57:43,339 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 555 transitions. [2024-12-02 13:57:43,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-12-02 13:57:43,339 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:57:43,339 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] [2024-12-02 13:57:43,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-12-02 13:57:43,339 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr98ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:57:43,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:57:43,340 INFO L85 PathProgramCache]: Analyzing trace with hash 437262943, now seen corresponding path program 1 times [2024-12-02 13:57:43,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:57:43,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894726416] [2024-12-02 13:57:43,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:57:43,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:57:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:57:43,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:57:43,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:57:43,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894726416] [2024-12-02 13:57:43,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894726416] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:57:43,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:57:43,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 13:57:43,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204632816] [2024-12-02 13:57:43,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:57:43,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 13:57:43,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:57:43,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 13:57:43,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-12-02 13:57:43,522 INFO L87 Difference]: Start difference. First operand 398 states and 555 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 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-12-02 13:57:43,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:57:43,926 INFO L93 Difference]: Finished difference Result 552 states and 758 transitions. [2024-12-02 13:57:43,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 13:57:43,926 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-12-02 13:57:43,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:57:43,927 INFO L225 Difference]: With dead ends: 552 [2024-12-02 13:57:43,927 INFO L226 Difference]: Without dead ends: 552 [2024-12-02 13:57:43,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-12-02 13:57:43,927 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 294 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 13:57:43,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 631 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 13:57:43,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-12-02 13:57:43,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 399. [2024-12-02 13:57:43,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 351 states have (on average 1.584045584045584) internal successors, (556), 398 states have internal predecessors, (556), 0 states have call successors, (0), 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-12-02 13:57:43,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 556 transitions. [2024-12-02 13:57:43,934 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 556 transitions. Word has length 32 [2024-12-02 13:57:43,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:57:43,934 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 556 transitions. [2024-12-02 13:57:43,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 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-12-02 13:57:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 556 transitions. [2024-12-02 13:57:43,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-12-02 13:57:43,934 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:57:43,934 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-12-02 13:57:43,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-12-02 13:57:43,935 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:57:43,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:57:43,935 INFO L85 PathProgramCache]: Analyzing trace with hash 670249701, now seen corresponding path program 1 times [2024-12-02 13:57:43,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:57:43,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795636795] [2024-12-02 13:57:43,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:57:43,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:57:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:57:43,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:57:43,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:57:43,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795636795] [2024-12-02 13:57:43,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795636795] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:57:43,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:57:43,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 13:57:43,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149171222] [2024-12-02 13:57:43,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:57:43,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 13:57:43,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:57:43,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 13:57:43,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 13:57:43,982 INFO L87 Difference]: Start difference. First operand 399 states and 556 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 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-12-02 13:57:44,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:57:44,139 INFO L93 Difference]: Finished difference Result 398 states and 552 transitions. [2024-12-02 13:57:44,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 13:57:44,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 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-12-02 13:57:44,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:57:44,141 INFO L225 Difference]: With dead ends: 398 [2024-12-02 13:57:44,141 INFO L226 Difference]: Without dead ends: 398 [2024-12-02 13:57:44,141 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-12-02 13:57:44,142 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 16 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 13:57:44,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 393 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 13:57:44,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-12-02 13:57:44,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2024-12-02 13:57:44,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 351 states have (on average 1.5726495726495726) internal successors, (552), 397 states have internal predecessors, (552), 0 states have call successors, (0), 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-12-02 13:57:44,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 552 transitions. [2024-12-02 13:57:44,146 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 552 transitions. Word has length 33 [2024-12-02 13:57:44,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:57:44,146 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 552 transitions. [2024-12-02 13:57:44,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 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-12-02 13:57:44,147 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 552 transitions. [2024-12-02 13:57:44,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-02 13:57:44,147 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:57:44,147 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:57:44,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-12-02 13:57:44,147 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:57:44,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:57:44,148 INFO L85 PathProgramCache]: Analyzing trace with hash -779195442, now seen corresponding path program 1 times [2024-12-02 13:57:44,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:57:44,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454738475] [2024-12-02 13:57:44,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:57:44,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:57:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:57:44,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:57:44,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:57:44,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454738475] [2024-12-02 13:57:44,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454738475] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:57:44,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:57:44,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-12-02 13:57:44,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530303143] [2024-12-02 13:57:44,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:57:44,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 13:57:44,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:57:44,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 13:57:44,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-12-02 13:57:44,503 INFO L87 Difference]: Start difference. First operand 398 states and 552 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 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-12-02 13:57:45,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:57:45,115 INFO L93 Difference]: Finished difference Result 539 states and 740 transitions. [2024-12-02 13:57:45,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 13:57:45,115 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 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 34 [2024-12-02 13:57:45,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:57:45,116 INFO L225 Difference]: With dead ends: 539 [2024-12-02 13:57:45,116 INFO L226 Difference]: Without dead ends: 539 [2024-12-02 13:57:45,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-12-02 13:57:45,116 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 285 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 13:57:45,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 1053 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 13:57:45,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-12-02 13:57:45,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 398. [2024-12-02 13:57:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 351 states have (on average 1.5698005698005697) internal successors, (551), 397 states have internal predecessors, (551), 0 states have call successors, (0), 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-12-02 13:57:45,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 551 transitions. [2024-12-02 13:57:45,120 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 551 transitions. Word has length 34 [2024-12-02 13:57:45,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:57:45,120 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 551 transitions. [2024-12-02 13:57:45,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 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-12-02 13:57:45,120 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 551 transitions. [2024-12-02 13:57:45,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-02 13:57:45,120 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:57:45,120 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:57:45,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-12-02 13:57:45,120 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:57:45,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:57:45,121 INFO L85 PathProgramCache]: Analyzing trace with hash -766917907, now seen corresponding path program 1 times [2024-12-02 13:57:45,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:57:45,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049666609] [2024-12-02 13:57:45,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:57:45,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:57:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:57:45,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:57:45,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:57:45,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049666609] [2024-12-02 13:57:45,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049666609] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:57:45,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:57:45,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 13:57:45,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671588664] [2024-12-02 13:57:45,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:57:45,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 13:57:45,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:57:45,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 13:57:45,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 13:57:45,188 INFO L87 Difference]: Start difference. First operand 398 states and 551 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:57:45,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:57:45,316 INFO L93 Difference]: Finished difference Result 397 states and 550 transitions. [2024-12-02 13:57:45,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 13:57:45,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-12-02 13:57:45,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:57:45,317 INFO L225 Difference]: With dead ends: 397 [2024-12-02 13:57:45,317 INFO L226 Difference]: Without dead ends: 397 [2024-12-02 13:57:45,317 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-12-02 13:57:45,318 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 13:57:45,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 466 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 13:57:45,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-12-02 13:57:45,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2024-12-02 13:57:45,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 351 states have (on average 1.566951566951567) internal successors, (550), 396 states have internal predecessors, (550), 0 states have call successors, (0), 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-12-02 13:57:45,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 550 transitions. [2024-12-02 13:57:45,321 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 550 transitions. Word has length 35 [2024-12-02 13:57:45,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:57:45,321 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 550 transitions. [2024-12-02 13:57:45,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:57:45,321 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 550 transitions. [2024-12-02 13:57:45,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-02 13:57:45,321 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:57:45,321 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:57:45,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-12-02 13:57:45,322 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:57:45,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:57:45,322 INFO L85 PathProgramCache]: Analyzing trace with hash -766917906, now seen corresponding path program 1 times [2024-12-02 13:57:45,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:57:45,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480695210] [2024-12-02 13:57:45,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:57:45,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:57:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:57:45,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:57:45,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:57:45,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480695210] [2024-12-02 13:57:45,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480695210] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:57:45,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:57:45,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 13:57:45,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922046598] [2024-12-02 13:57:45,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:57:45,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 13:57:45,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:57:45,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 13:57:45,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 13:57:45,435 INFO L87 Difference]: Start difference. First operand 397 states and 550 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:57:45,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:57:45,608 INFO L93 Difference]: Finished difference Result 396 states and 549 transitions. [2024-12-02 13:57:45,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 13:57:45,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-12-02 13:57:45,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:57:45,609 INFO L225 Difference]: With dead ends: 396 [2024-12-02 13:57:45,609 INFO L226 Difference]: Without dead ends: 396 [2024-12-02 13:57:45,610 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-12-02 13:57:45,610 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 13:57:45,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 436 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 13:57:45,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-12-02 13:57:45,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-12-02 13:57:45,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 351 states have (on average 1.564102564102564) internal successors, (549), 395 states have internal predecessors, (549), 0 states have call successors, (0), 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-12-02 13:57:45,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 549 transitions. [2024-12-02 13:57:45,613 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 549 transitions. Word has length 35 [2024-12-02 13:57:45,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:57:45,614 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 549 transitions. [2024-12-02 13:57:45,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:57:45,614 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 549 transitions. [2024-12-02 13:57:45,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-02 13:57:45,614 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:57:45,614 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:57:45,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-12-02 13:57:45,614 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:57:45,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:57:45,615 INFO L85 PathProgramCache]: Analyzing trace with hash -135120281, now seen corresponding path program 1 times [2024-12-02 13:57:45,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:57:45,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200596274] [2024-12-02 13:57:45,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:57:45,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:57:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:57:45,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:57:45,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:57:45,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200596274] [2024-12-02 13:57:45,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200596274] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:57:45,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:57:45,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 13:57:45,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244572989] [2024-12-02 13:57:45,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:57:45,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 13:57:45,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:57:45,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 13:57:45,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 13:57:45,649 INFO L87 Difference]: Start difference. First operand 396 states and 549 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:57:45,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:57:45,823 INFO L93 Difference]: Finished difference Result 505 states and 657 transitions. [2024-12-02 13:57:45,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 13:57:45,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-12-02 13:57:45,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:57:45,824 INFO L225 Difference]: With dead ends: 505 [2024-12-02 13:57:45,825 INFO L226 Difference]: Without dead ends: 505 [2024-12-02 13:57:45,825 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-12-02 13:57:45,825 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 250 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 13:57:45,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 348 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 13:57:45,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-12-02 13:57:45,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 418. [2024-12-02 13:57:45,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 373 states have (on average 1.581769436997319) internal successors, (590), 417 states have internal predecessors, (590), 0 states have call successors, (0), 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-12-02 13:57:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 590 transitions. [2024-12-02 13:57:45,829 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 590 transitions. Word has length 35 [2024-12-02 13:57:45,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:57:45,829 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 590 transitions. [2024-12-02 13:57:45,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:57:45,829 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 590 transitions. [2024-12-02 13:57:45,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-02 13:57:45,829 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:57:45,829 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:57:45,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-12-02 13:57:45,830 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:57:45,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:57:45,830 INFO L85 PathProgramCache]: Analyzing trace with hash 106238947, now seen corresponding path program 1 times [2024-12-02 13:57:45,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:57:45,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115911840] [2024-12-02 13:57:45,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:57:45,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:57:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:57:46,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:57:46,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:57:46,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115911840] [2024-12-02 13:57:46,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115911840] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:57:46,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:57:46,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-12-02 13:57:46,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278965883] [2024-12-02 13:57:46,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:57:46,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-12-02 13:57:46,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:57:46,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-12-02 13:57:46,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-12-02 13:57:46,178 INFO L87 Difference]: Start difference. First operand 418 states and 590 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 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-12-02 13:57:47,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:57:47,238 INFO L93 Difference]: Finished difference Result 684 states and 914 transitions. [2024-12-02 13:57:47,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-12-02 13:57:47,238 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-12-02 13:57:47,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:57:47,239 INFO L225 Difference]: With dead ends: 684 [2024-12-02 13:57:47,240 INFO L226 Difference]: Without dead ends: 684 [2024-12-02 13:57:47,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=782, Unknown=0, NotChecked=0, Total=992 [2024-12-02 13:57:47,240 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 512 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-12-02 13:57:47,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 782 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1403 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-12-02 13:57:47,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2024-12-02 13:57:47,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 446. [2024-12-02 13:57:47,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 401 states have (on average 1.5810473815461346) internal successors, (634), 445 states have internal predecessors, (634), 0 states have call successors, (0), 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-12-02 13:57:47,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 634 transitions. [2024-12-02 13:57:47,244 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 634 transitions. Word has length 36 [2024-12-02 13:57:47,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:57:47,244 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 634 transitions. [2024-12-02 13:57:47,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 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-12-02 13:57:47,244 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 634 transitions. [2024-12-02 13:57:47,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-02 13:57:47,244 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:57:47,245 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] [2024-12-02 13:57:47,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-12-02 13:57:47,245 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:57:47,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:57:47,245 INFO L85 PathProgramCache]: Analyzing trace with hash -545811985, now seen corresponding path program 1 times [2024-12-02 13:57:47,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:57:47,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295186062] [2024-12-02 13:57:47,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:57:47,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:57:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:57:47,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:57:47,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:57:47,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295186062] [2024-12-02 13:57:47,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295186062] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:57:47,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674258436] [2024-12-02 13:57:47,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:57:47,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:57:47,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:57:47,664 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:57:47,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 13:57:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:57:47,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-12-02 13:57:47,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:57:47,791 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-12-02 13:57:47,806 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-12-02 13:57:47,811 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-12-02 13:57:47,844 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-12-02 13:57:47,844 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-12-02 13:57:47,886 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 29 treesize of output 13 [2024-12-02 13:57:47,894 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 29 treesize of output 13 [2024-12-02 13:57:47,988 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 13:57:47,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 64 [2024-12-02 13:57:47,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 13:57:48,047 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-12-02 13:57:48,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2024-12-02 13:57:48,105 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 38 treesize of output 29 [2024-12-02 13:57:48,110 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 18 treesize of output 13 [2024-12-02 13:57:48,183 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 13:57:48,183 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 60 treesize of output 55 [2024-12-02 13:57:48,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 13:57:48,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:57:48,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:57:48,386 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 4))) (and (forall ((v_ArrVal_1341 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1341) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_1342 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 0)))) is different from false [2024-12-02 13:57:48,395 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 4))) (and (forall ((v_ArrVal_1342 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1342) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1341 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1341) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) 0)))) is different from false [2024-12-02 13:57:52,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 13:57:52,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 51 [2024-12-02 13:57:52,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 13:57:52,635 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 737 treesize of output 557 [2024-12-02 13:57:52,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 13:57:52,654 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 120 treesize of output 96 [2024-12-02 13:57:52,665 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 96 treesize of output 84 [2024-12-02 13:57:52,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 13:57:52,683 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 58 treesize of output 46 [2024-12-02 13:57:52,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 13:57:52,834 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 2 case distinctions, treesize of input 60 treesize of output 66 [2024-12-02 13:57:52,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 13:57:52,867 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 2 case distinctions, treesize of input 45 treesize of output 51 [2024-12-02 13:57:52,877 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 0 case distinctions, treesize of input 365 treesize of output 251 [2024-12-02 13:57:52,894 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 2022 treesize of output 1938 [2024-12-02 13:57:52,916 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 41 treesize of output 33 [2024-12-02 13:57:52,928 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 33 treesize of output 29 [2024-12-02 13:57:52,938 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 108 treesize of output 96 [2024-12-02 13:57:52,947 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 70 treesize of output 54 [2024-12-02 13:57:52,956 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 54 treesize of output 46 [2024-12-02 13:57:57,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:57:57,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674258436] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:57:57,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:57:57,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 15] total 33 [2024-12-02 13:57:57,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081113708] [2024-12-02 13:57:57,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:57:57,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-12-02 13:57:57,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:57:57,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-12-02 13:57:57,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=793, Unknown=28, NotChecked=118, Total=1056 [2024-12-02 13:57:57,547 INFO L87 Difference]: Start difference. First operand 446 states and 634 transitions. Second operand has 33 states, 33 states have (on average 3.0303030303030303) internal successors, (100), 33 states have internal predecessors, (100), 0 states have call successors, (0), 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-12-02 13:58:06,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:58:06,605 INFO L93 Difference]: Finished difference Result 801 states and 1061 transitions. [2024-12-02 13:58:06,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-12-02 13:58:06,605 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0303030303030303) internal successors, (100), 33 states have internal predecessors, (100), 0 states have call successors, (0), 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 38 [2024-12-02 13:58:06,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:58:06,607 INFO L225 Difference]: With dead ends: 801 [2024-12-02 13:58:06,607 INFO L226 Difference]: Without dead ends: 801 [2024-12-02 13:58:06,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=321, Invalid=1634, Unknown=33, NotChecked=174, Total=2162 [2024-12-02 13:58:06,608 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 1078 mSDsluCounter, 2837 mSDsCounter, 0 mSdLazyCounter, 2215 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 2970 SdHoareTripleChecker+Invalid, 3120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 853 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2024-12-02 13:58:06,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 2970 Invalid, 3120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2215 Invalid, 0 Unknown, 853 Unchecked, 7.3s Time] [2024-12-02 13:58:06,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2024-12-02 13:58:06,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 463. [2024-12-02 13:58:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 418 states have (on average 1.569377990430622) internal successors, (656), 462 states have internal predecessors, (656), 0 states have call successors, (0), 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-12-02 13:58:06,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 656 transitions. [2024-12-02 13:58:06,612 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 656 transitions. Word has length 38 [2024-12-02 13:58:06,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:58:06,612 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 656 transitions. [2024-12-02 13:58:06,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0303030303030303) internal successors, (100), 33 states have internal predecessors, (100), 0 states have call successors, (0), 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-12-02 13:58:06,613 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 656 transitions. [2024-12-02 13:58:06,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-02 13:58:06,613 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:58:06,613 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] [2024-12-02 13:58:06,620 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 13:58:06,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-12-02 13:58:06,814 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:58:06,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:58:06,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1621896712, now seen corresponding path program 1 times [2024-12-02 13:58:06,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:58:06,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019836239] [2024-12-02 13:58:06,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:58:06,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:58:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:58:08,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:58:08,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:58:08,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019836239] [2024-12-02 13:58:08,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019836239] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:58:08,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974254032] [2024-12-02 13:58:08,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:58:08,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:58:08,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:58:08,126 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:58:08,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 13:58:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:58:08,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-12-02 13:58:08,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:58:08,268 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-12-02 13:58:08,356 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-12-02 13:58:08,371 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-12-02 13:58:08,467 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-12-02 13:58:08,480 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 21 treesize of output 20 [2024-12-02 13:58:08,624 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 13:58:08,624 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-12-02 13:58:08,749 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 27 treesize of output 11 [2024-12-02 13:58:08,770 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 36 treesize of output 23 [2024-12-02 13:58:09,198 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 13:58:09,198 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 58 treesize of output 53 [2024-12-02 13:58:09,207 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-12-02 13:58:09,379 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 13:58:09,379 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-12-02 13:58:09,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-12-02 13:58:09,621 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 26 treesize of output 19 [2024-12-02 13:58:09,968 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 13:58:09,969 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 58 treesize of output 53 [2024-12-02 13:58:09,977 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-12-02 13:58:10,345 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 0 case distinctions, treesize of input 18 treesize of output 8 [2024-12-02 13:58:10,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:58:10,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:58:11,090 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)))) (and (forall ((v_ArrVal_1441 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1441) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (forall ((v_ArrVal_1440 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1440) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)))) is different from false [2024-12-02 13:58:16,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 13:58:16,742 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 118 treesize of output 136 [2024-12-02 13:58:39,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 13:58:39,789 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 3 case distinctions, treesize of input 64 treesize of output 75 [2024-12-02 13:58:39,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 13:58:39,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 57 [2024-12-02 13:58:39,930 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 13:58:39,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 53 [2024-12-02 13:58:39,975 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 13:58:39,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 13:58:39,999 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 118 treesize of output 100 [2024-12-02 13:58:40,047 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 28 treesize of output 20 [2024-12-02 13:58:40,069 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 9 treesize of output 7 [2024-12-02 13:58:40,095 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-12-02 13:58:40,151 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-12-02 13:58:40,151 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 3 case distinctions, treesize of input 64 treesize of output 1 [2024-12-02 13:58:48,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:58:48,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974254032] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:58:48,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:58:48,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 16] total 37 [2024-12-02 13:58:48,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551260700] [2024-12-02 13:58:48,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:58:48,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-12-02 13:58:48,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:58:48,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-12-02 13:58:48,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1055, Unknown=69, NotChecked=68, Total=1332 [2024-12-02 13:58:48,677 INFO L87 Difference]: Start difference. First operand 463 states and 656 transitions. Second operand has 37 states, 37 states have (on average 2.5675675675675675) internal successors, (95), 37 states have internal predecessors, (95), 0 states have call successors, (0), 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-12-02 13:59:22,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:59:22,559 INFO L93 Difference]: Finished difference Result 793 states and 1051 transitions. [2024-12-02 13:59:22,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-12-02 13:59:22,560 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.5675675675675675) internal successors, (95), 37 states have internal predecessors, (95), 0 states have call successors, (0), 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 38 [2024-12-02 13:59:22,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:59:22,561 INFO L225 Difference]: With dead ends: 793 [2024-12-02 13:59:22,561 INFO L226 Difference]: Without dead ends: 793 [2024-12-02 13:59:22,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 44.4s TimeCoverageRelationStatistics Valid=430, Invalid=2247, Unknown=83, NotChecked=102, Total=2862 [2024-12-02 13:59:22,562 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1262 mSDsluCounter, 2468 mSDsCounter, 0 mSdLazyCounter, 2589 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 2592 SdHoareTripleChecker+Invalid, 3121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 481 IncrementalHoareTripleChecker+Unchecked, 27.4s IncrementalHoareTripleChecker+Time [2024-12-02 13:59:22,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 2592 Invalid, 3121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2589 Invalid, 0 Unknown, 481 Unchecked, 27.4s Time] [2024-12-02 13:59:22,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2024-12-02 13:59:22,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 517. [2024-12-02 13:59:22,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 472 states have (on average 1.5741525423728813) internal successors, (743), 516 states have internal predecessors, (743), 0 states have call successors, (0), 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-12-02 13:59:22,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 743 transitions. [2024-12-02 13:59:22,571 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 743 transitions. Word has length 38 [2024-12-02 13:59:22,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:59:22,571 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 743 transitions. [2024-12-02 13:59:22,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.5675675675675675) internal successors, (95), 37 states have internal predecessors, (95), 0 states have call successors, (0), 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-12-02 13:59:22,571 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 743 transitions. [2024-12-02 13:59:22,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-02 13:59:22,572 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:59:22,572 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] [2024-12-02 13:59:22,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-12-02 13:59:22,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-12-02 13:59:22,772 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:59:22,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:59:22,773 INFO L85 PathProgramCache]: Analyzing trace with hash -284588616, now seen corresponding path program 1 times [2024-12-02 13:59:22,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:59:22,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004296184] [2024-12-02 13:59:22,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:59:22,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:59:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:59:25,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:59:25,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:59:25,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004296184] [2024-12-02 13:59:25,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004296184] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:59:25,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755733971] [2024-12-02 13:59:25,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:59:25,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:59:25,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:59:25,578 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:59:25,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 13:59:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:59:25,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-12-02 13:59:25,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:59:25,751 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-12-02 13:59:26,152 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 13:59:26,153 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-12-02 13:59:26,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 13:59:26,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 13:59:27,039 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 19 treesize of output 7 [2024-12-02 13:59:27,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 13:59:27,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2024-12-02 13:59:28,143 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 13:59:28,144 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-12-02 13:59:28,590 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 19 treesize of output 14 [2024-12-02 13:59:29,346 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 13:59:29,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 13:59:31,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-12-02 13:59:31,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:59:31,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:59:31,790 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-12-02 13:59:31,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-12-02 13:59:31,827 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1531 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem11#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1531) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)))) is different from false [2024-12-02 13:59:32,229 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1531 (Array Int Int)) (v_ArrVal_1530 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1530)) (.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1531) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))))) is different from false [2024-12-02 13:59:38,078 INFO L349 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2024-12-02 13:59:38,078 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 2 case distinctions, treesize of input 117 treesize of output 52 [2024-12-02 13:59:38,096 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 13:59:38,107 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 44 treesize of output 20 [2024-12-02 13:59:38,129 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 7 treesize of output 3 [2024-12-02 13:59:38,239 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-12-02 13:59:38,239 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 13 treesize of output 12 [2024-12-02 13:59:38,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:59:38,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755733971] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:59:38,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:59:38,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 33 [2024-12-02 13:59:38,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230470210] [2024-12-02 13:59:38,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:59:38,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-12-02 13:59:38,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:59:38,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-12-02 13:59:38,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=839, Unknown=9, NotChecked=122, Total=1122 [2024-12-02 13:59:38,980 INFO L87 Difference]: Start difference. First operand 517 states and 743 transitions. Second operand has 34 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 34 states have internal predecessors, (101), 0 states have call successors, (0), 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-12-02 13:59:58,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:59:58,501 INFO L93 Difference]: Finished difference Result 714 states and 1000 transitions. [2024-12-02 13:59:58,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 13:59:58,502 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 34 states have internal predecessors, (101), 0 states have call successors, (0), 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 38 [2024-12-02 13:59:58,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:59:58,503 INFO L225 Difference]: With dead ends: 714 [2024-12-02 13:59:58,503 INFO L226 Difference]: Without dead ends: 714 [2024-12-02 13:59:58,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=314, Invalid=1407, Unknown=9, NotChecked=162, Total=1892 [2024-12-02 13:59:58,504 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 794 mSDsluCounter, 1876 mSDsCounter, 0 mSdLazyCounter, 1574 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 2009 SdHoareTripleChecker+Invalid, 2302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 682 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2024-12-02 13:59:58,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 2009 Invalid, 2302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1574 Invalid, 0 Unknown, 682 Unchecked, 16.4s Time] [2024-12-02 13:59:58,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2024-12-02 13:59:58,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 521. [2024-12-02 13:59:58,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 476 states have (on average 1.5714285714285714) internal successors, (748), 520 states have internal predecessors, (748), 0 states have call successors, (0), 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-12-02 13:59:58,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 748 transitions. [2024-12-02 13:59:58,510 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 748 transitions. Word has length 38 [2024-12-02 13:59:58,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:59:58,510 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 748 transitions. [2024-12-02 13:59:58,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 34 states have internal predecessors, (101), 0 states have call successors, (0), 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-12-02 13:59:58,510 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 748 transitions. [2024-12-02 13:59:58,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-02 13:59:58,510 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:59:58,510 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] [2024-12-02 13:59:58,517 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 13:59:58,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2024-12-02 13:59:58,711 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 13:59:58,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:59:58,711 INFO L85 PathProgramCache]: Analyzing trace with hash -284588615, now seen corresponding path program 1 times [2024-12-02 13:59:58,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:59:58,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722569616] [2024-12-02 13:59:58,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:59:58,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:59:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:00:02,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:00:02,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:00:02,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722569616] [2024-12-02 14:00:02,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722569616] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:00:02,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774776569] [2024-12-02 14:00:02,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:00:02,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:00:02,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:00:02,024 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:00:02,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 14:00:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:00:02,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-12-02 14:00:02,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:00:02,186 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-12-02 14:00:02,514 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 14:00:02,515 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-12-02 14:00:02,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 14:00:03,607 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 14:00:03,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 14:00:03,866 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 14:00:03,866 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-12-02 14:00:04,960 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 38 treesize of output 31 [2024-12-02 14:00:04,983 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 30 [2024-12-02 14:00:05,932 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 14:00:05,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2024-12-02 14:00:05,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-12-02 14:00:07,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-12-02 14:00:07,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-12-02 14:00:07,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:00:07,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:00:09,236 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (forall ((v_ArrVal_1621 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1621) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (forall ((v_ArrVal_1622 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1621) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1622) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)))))) is different from false [2024-12-02 14:00:09,308 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1621 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1621) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (forall ((v_ArrVal_1622 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1621) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1622) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))))))) is different from false [2024-12-02 14:00:09,433 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (forall ((v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1620 (Array Int Int)) (v_ArrVal_1619 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1620) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1619) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_1621) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (forall ((v_ArrVal_1622 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1620 (Array Int Int)) (v_ArrVal_1619 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1619))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1620) .cse1 v_ArrVal_1621) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1622) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)))))))) is different from false [2024-12-02 14:00:09,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:00:09,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 86 [2024-12-02 14:00:10,234 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 349 treesize of output 301 [2024-12-02 14:00:10,258 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 172 treesize of output 168 [2024-12-02 14:00:10,281 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 168 treesize of output 160 [2024-12-02 14:00:10,304 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 160 treesize of output 156 [2024-12-02 14:00:10,327 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 156 treesize of output 148 [2024-12-02 14:00:12,607 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-12-02 14:00:12,607 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 13 treesize of output 12 [2024-12-02 14:00:12,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:00:12,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774776569] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:00:12,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:00:12,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 33 [2024-12-02 14:00:12,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899756964] [2024-12-02 14:00:12,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:00:12,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-12-02 14:00:12,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:00:12,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-12-02 14:00:12,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=820, Unknown=4, NotChecked=180, Total=1122 [2024-12-02 14:00:12,988 INFO L87 Difference]: Start difference. First operand 521 states and 748 transitions. Second operand has 34 states, 33 states have (on average 3.3636363636363638) internal successors, (111), 34 states have internal predecessors, (111), 0 states have call successors, (0), 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-12-02 14:00:39,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:00:39,611 INFO L93 Difference]: Finished difference Result 714 states and 999 transitions. [2024-12-02 14:00:39,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-12-02 14:00:39,612 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.3636363636363638) internal successors, (111), 34 states have internal predecessors, (111), 0 states have call successors, (0), 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 38 [2024-12-02 14:00:39,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:00:39,613 INFO L225 Difference]: With dead ends: 714 [2024-12-02 14:00:39,613 INFO L226 Difference]: Without dead ends: 714 [2024-12-02 14:00:39,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=335, Invalid=1743, Unknown=4, NotChecked=270, Total=2352 [2024-12-02 14:00:39,614 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 904 mSDsluCounter, 1851 mSDsCounter, 0 mSdLazyCounter, 2059 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 3240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1144 IncrementalHoareTripleChecker+Unchecked, 21.4s IncrementalHoareTripleChecker+Time [2024-12-02 14:00:39,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 2010 Invalid, 3240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2059 Invalid, 0 Unknown, 1144 Unchecked, 21.4s Time] [2024-12-02 14:00:39,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2024-12-02 14:00:39,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 521. [2024-12-02 14:00:39,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 476 states have (on average 1.569327731092437) internal successors, (747), 520 states have internal predecessors, (747), 0 states have call successors, (0), 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-12-02 14:00:39,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 747 transitions. [2024-12-02 14:00:39,622 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 747 transitions. Word has length 38 [2024-12-02 14:00:39,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:00:39,622 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 747 transitions. [2024-12-02 14:00:39,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.3636363636363638) internal successors, (111), 34 states have internal predecessors, (111), 0 states have call successors, (0), 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-12-02 14:00:39,623 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 747 transitions. [2024-12-02 14:00:39,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-02 14:00:39,623 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:00:39,623 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, 1, 1, 1, 1, 1, 1] [2024-12-02 14:00:39,631 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 14:00:39,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:00:39,823 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 14:00:39,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:00:39,824 INFO L85 PathProgramCache]: Analyzing trace with hash -426193586, now seen corresponding path program 1 times [2024-12-02 14:00:39,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:00:39,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099842691] [2024-12-02 14:00:39,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:00:39,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:00:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:00:39,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:00:39,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:00:39,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099842691] [2024-12-02 14:00:39,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099842691] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:00:39,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:00:39,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:00:39,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298518900] [2024-12-02 14:00:39,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:00:39,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:00:39,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:00:39,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:00:39,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:00:39,949 INFO L87 Difference]: Start difference. First operand 521 states and 747 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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-12-02 14:00:40,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:00:40,114 INFO L93 Difference]: Finished difference Result 510 states and 693 transitions. [2024-12-02 14:00:40,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:00:40,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-12-02 14:00:40,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:00:40,118 INFO L225 Difference]: With dead ends: 510 [2024-12-02 14:00:40,118 INFO L226 Difference]: Without dead ends: 510 [2024-12-02 14:00:40,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:00:40,119 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 30 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:00:40,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 328 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 14:00:40,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-12-02 14:00:40,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 491. [2024-12-02 14:00:40,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 446 states have (on average 1.553811659192825) internal successors, (693), 490 states have internal predecessors, (693), 0 states have call successors, (0), 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-12-02 14:00:40,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 693 transitions. [2024-12-02 14:00:40,123 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 693 transitions. Word has length 39 [2024-12-02 14:00:40,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:00:40,123 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 693 transitions. [2024-12-02 14:00:40,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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-12-02 14:00:40,124 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 693 transitions. [2024-12-02 14:00:40,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-02 14:00:40,124 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:00:40,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:00:40,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-12-02 14:00:40,124 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 14:00:40,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:00:40,124 INFO L85 PathProgramCache]: Analyzing trace with hash -426187603, now seen corresponding path program 1 times [2024-12-02 14:00:40,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:00:40,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668377482] [2024-12-02 14:00:40,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:00:40,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:00:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:00:41,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:00:41,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:00:41,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668377482] [2024-12-02 14:00:41,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668377482] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:00:41,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025347388] [2024-12-02 14:00:41,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:00:41,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:00:41,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:00:41,916 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:00:41,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 14:00:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:00:42,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-12-02 14:00:42,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:00:43,015 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-12-02 14:00:44,106 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-12-02 14:00:44,106 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 48 treesize of output 45 [2024-12-02 14:00:47,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:00:47,124 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 41 treesize of output 31 [2024-12-02 14:00:49,788 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~mem50#1.base_15| Int) (|v_ULTIMATE.start_main_~tmp~0#1.base_83| Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~mem50#1.base_15| 0) |v_ULTIMATE.start_main_~tmp~0#1.base_83| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~tmp~0#1.base_83| 1) |v_ULTIMATE.start_main_#t~mem50#1.base_15|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~tmp~0#1.base_83|) 0))) is different from true [2024-12-02 14:00:49,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-12-02 14:00:49,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:00:52,781 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1716 (Array Int Int))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1716) |c_ULTIMATE.start_main_~tree~0#1.base|) 8) 0) |c_ULTIMATE.start_main_~tree~0#1.base| 0))) is different from false [2024-12-02 14:00:52,847 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1716 (Array Int Int))) (= (store (store |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_1716) |c_ULTIMATE.start_main_~tree~0#1.base|) 8) 0) |c_ULTIMATE.start_main_~tree~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-12-02 14:00:52,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:00:52,924 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 30 treesize of output 31 [2024-12-02 14:00:53,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:00:53,007 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 52 treesize of output 50 [2024-12-02 14:00:53,031 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 19 treesize of output 17 [2024-12-02 14:00:57,424 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store (store |c_#valid| |c_ULTIMATE.start_main_#t~malloc4#1.base| 0) |c_ULTIMATE.start_main_~tree~0#1.base| 0)) (.cse0 (= |c_ULTIMATE.start_main_~tree~0#1.offset| 0)) (.cse2 (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|))) (and (or (and (or .cse0 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_154 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store |c_#valid| v_arrayElimCell_154 0) |c_ULTIMATE.start_main_~tree~0#1.base| 0) v_antiDerIndex_entry0_1)))) (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse1 v_antiDerIndex_entry0_1)))) .cse2) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_155 Int)) (let ((.cse3 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse3 (select .cse1 v_antiDerIndex_entry0_1)) (= .cse3 (select (store (store |c_#valid| v_arrayElimCell_155 0) |c_ULTIMATE.start_main_~tree~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse0 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_155 Int) (v_arrayElimCell_154 Int)) (let ((.cse4 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse4 (select (store (store |c_#valid| v_arrayElimCell_155 0) |c_ULTIMATE.start_main_~tree~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse4 (select (store (store |c_#valid| v_arrayElimCell_154 0) |c_ULTIMATE.start_main_~tree~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_155 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store |c_#valid| v_arrayElimCell_155 0) |c_ULTIMATE.start_main_~tree~0#1.base| 0) v_antiDerIndex_entry0_1))) (not .cse2)))) is different from false [2024-12-02 14:00:59,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:00:59,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025347388] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:00:59,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:00:59,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2024-12-02 14:00:59,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13026901] [2024-12-02 14:00:59,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:00:59,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-12-02 14:00:59,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:00:59,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-12-02 14:00:59,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=632, Unknown=4, NotChecked=212, Total=930 [2024-12-02 14:00:59,549 INFO L87 Difference]: Start difference. First operand 491 states and 693 transitions. Second operand has 31 states, 30 states have (on average 3.6666666666666665) internal successors, (110), 31 states have internal predecessors, (110), 0 states have call successors, (0), 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-12-02 14:01:20,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:01:20,576 INFO L93 Difference]: Finished difference Result 504 states and 706 transitions. [2024-12-02 14:01:20,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 14:01:20,577 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.6666666666666665) internal successors, (110), 31 states have internal predecessors, (110), 0 states have call successors, (0), 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 39 [2024-12-02 14:01:20,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:01:20,578 INFO L225 Difference]: With dead ends: 504 [2024-12-02 14:01:20,578 INFO L226 Difference]: Without dead ends: 479 [2024-12-02 14:01:20,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=143, Invalid=991, Unknown=4, NotChecked=268, Total=1406 [2024-12-02 14:01:20,579 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 127 mSDsluCounter, 1773 mSDsCounter, 0 mSdLazyCounter, 1726 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1921 SdHoareTripleChecker+Invalid, 2349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 614 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:01:20,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1921 Invalid, 2349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1726 Invalid, 0 Unknown, 614 Unchecked, 18.2s Time] [2024-12-02 14:01:20,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-12-02 14:01:20,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 475. [2024-12-02 14:01:20,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 430 states have (on average 1.572093023255814) internal successors, (676), 474 states have internal predecessors, (676), 0 states have call successors, (0), 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-12-02 14:01:20,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 676 transitions. [2024-12-02 14:01:20,583 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 676 transitions. Word has length 39 [2024-12-02 14:01:20,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:01:20,583 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 676 transitions. [2024-12-02 14:01:20,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.6666666666666665) internal successors, (110), 31 states have internal predecessors, (110), 0 states have call successors, (0), 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-12-02 14:01:20,583 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 676 transitions. [2024-12-02 14:01:20,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-02 14:01:20,584 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:01:20,584 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] [2024-12-02 14:01:20,591 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 14:01:20,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:01:20,784 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 14:01:20,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:01:20,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1572709107, now seen corresponding path program 1 times [2024-12-02 14:01:20,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:01:20,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906160096] [2024-12-02 14:01:20,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:01:20,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:01:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:01:23,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:01:23,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:01:23,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906160096] [2024-12-02 14:01:23,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906160096] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:01:23,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478556538] [2024-12-02 14:01:23,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:01:23,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:01:23,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:01:23,454 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:01:23,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 14:01:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:01:23,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-12-02 14:01:23,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:01:23,623 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-12-02 14:01:23,686 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-12-02 14:01:23,748 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-12-02 14:01:24,038 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 14:01:24,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 14:01:24,420 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 29 treesize of output 13 [2024-12-02 14:01:24,464 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 29 treesize of output 13 [2024-12-02 14:01:25,036 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 14:01:25,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 55 [2024-12-02 14:01:25,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 14:01:25,490 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 14:01:25,490 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-12-02 14:01:25,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2024-12-02 14:01:25,810 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 18 treesize of output 13 [2024-12-02 14:01:26,644 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 14:01:26,644 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 60 treesize of output 55 [2024-12-02 14:01:26,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 14:01:27,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:01:27,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:01:28,870 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 4))) (and (forall ((v_ArrVal_1814 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1814) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1815 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1815) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) 0)))) is different from false [2024-12-02 14:01:28,984 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) (.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 4))) (and (forall ((v_ArrVal_1812 (Array Int Int)) (v_ArrVal_1815 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1812))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_1815)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1812 (Array Int Int)) (v_ArrVal_1814 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1813) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1812) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_1814) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) 0)))) is different from false [2024-12-02 14:01:38,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:01:38,263 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 2 case distinctions, treesize of input 60 treesize of output 51 [2024-12-02 14:01:38,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:01:38,301 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 6622 treesize of output 4798 [2024-12-02 14:01:38,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:01:38,386 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 831 treesize of output 767 [2024-12-02 14:01:38,417 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 767 treesize of output 711 [2024-12-02 14:01:38,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:01:38,470 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 711 treesize of output 583 [2024-12-02 14:01:39,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:01:39,215 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 2 case distinctions, treesize of input 60 treesize of output 66 [2024-12-02 14:01:39,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:01:39,328 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 2 case distinctions, treesize of input 45 treesize of output 51 [2024-12-02 14:01:39,355 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 0 case distinctions, treesize of input 199 treesize of output 139 [2024-12-02 14:01:39,395 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:01:39,408 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 528 treesize of output 480 [2024-12-02 14:01:39,437 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 104 treesize of output 92 [2024-12-02 14:01:39,462 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 70 treesize of output 62 [2024-12-02 14:01:39,487 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 62 treesize of output 54 [2024-12-02 14:01:39,511 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 76 treesize of output 64 [2024-12-02 14:01:48,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:01:48,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478556538] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:01:48,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:01:48,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 26 [2024-12-02 14:01:48,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161092472] [2024-12-02 14:01:48,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:01:48,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-12-02 14:01:48,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:01:48,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-12-02 14:01:48,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=444, Unknown=24, NotChecked=90, Total=650 [2024-12-02 14:01:48,209 INFO L87 Difference]: Start difference. First operand 475 states and 676 transitions. Second operand has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 26 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:02:06,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:02:06,319 INFO L93 Difference]: Finished difference Result 573 states and 785 transitions. [2024-12-02 14:02:06,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 14:02:06,320 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 26 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-12-02 14:02:06,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:02:06,323 INFO L225 Difference]: With dead ends: 573 [2024-12-02 14:02:06,323 INFO L226 Difference]: Without dead ends: 573 [2024-12-02 14:02:06,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=163, Invalid=631, Unknown=26, NotChecked=110, Total=930 [2024-12-02 14:02:06,324 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 395 mSDsluCounter, 1966 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 487 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2024-12-02 14:02:06,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 2095 Invalid, 1977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1475 Invalid, 0 Unknown, 487 Unchecked, 16.4s Time] [2024-12-02 14:02:06,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2024-12-02 14:02:06,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 429. [2024-12-02 14:02:06,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 384 states have (on average 1.5546875) internal successors, (597), 428 states have internal predecessors, (597), 0 states have call successors, (0), 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-12-02 14:02:06,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 597 transitions. [2024-12-02 14:02:06,328 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 597 transitions. Word has length 40 [2024-12-02 14:02:06,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:02:06,328 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 597 transitions. [2024-12-02 14:02:06,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 26 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:02:06,328 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 597 transitions. [2024-12-02 14:02:06,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-12-02 14:02:06,329 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:02:06,329 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:02:06,336 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 14:02:06,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2024-12-02 14:02:06,529 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 14:02:06,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:02:06,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1747132616, now seen corresponding path program 1 times [2024-12-02 14:02:06,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:02:06,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351453818] [2024-12-02 14:02:06,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:02:06,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:02:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:02:10,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:02:10,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:02:10,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351453818] [2024-12-02 14:02:10,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351453818] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:02:10,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:02:10,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-12-02 14:02:10,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558165093] [2024-12-02 14:02:10,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:02:10,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-12-02 14:02:10,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:02:10,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-12-02 14:02:10,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-12-02 14:02:10,150 INFO L87 Difference]: Start difference. First operand 429 states and 597 transitions. Second operand has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 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-12-02 14:02:21,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:02:21,656 INFO L93 Difference]: Finished difference Result 687 states and 937 transitions. [2024-12-02 14:02:21,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 14:02:21,656 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2024-12-02 14:02:21,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:02:21,657 INFO L225 Difference]: With dead ends: 687 [2024-12-02 14:02:21,658 INFO L226 Difference]: Without dead ends: 687 [2024-12-02 14:02:21,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2024-12-02 14:02:21,658 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 646 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-12-02 14:02:21,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 862 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2024-12-02 14:02:21,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-12-02 14:02:21,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 484. [2024-12-02 14:02:21,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 439 states have (on average 1.542141230068337) internal successors, (677), 483 states have internal predecessors, (677), 0 states have call successors, (0), 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-12-02 14:02:21,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 677 transitions. [2024-12-02 14:02:21,663 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 677 transitions. Word has length 41 [2024-12-02 14:02:21,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:02:21,663 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 677 transitions. [2024-12-02 14:02:21,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 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-12-02 14:02:21,663 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 677 transitions. [2024-12-02 14:02:21,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-12-02 14:02:21,663 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:02:21,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:02:21,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-12-02 14:02:21,663 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 14:02:21,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:02:21,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1747132615, now seen corresponding path program 1 times [2024-12-02 14:02:21,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:02:21,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710432483] [2024-12-02 14:02:21,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:02:21,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:02:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:02:26,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:02:26,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:02:26,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710432483] [2024-12-02 14:02:26,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710432483] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:02:26,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:02:26,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-12-02 14:02:26,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796290003] [2024-12-02 14:02:26,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:02:26,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-12-02 14:02:26,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:02:26,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-12-02 14:02:26,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-12-02 14:02:26,872 INFO L87 Difference]: Start difference. First operand 484 states and 677 transitions. Second operand has 17 states, 16 states have (on average 2.5625) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 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-12-02 14:02:40,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:02:40,810 INFO L93 Difference]: Finished difference Result 686 states and 936 transitions. [2024-12-02 14:02:40,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-02 14:02:40,811 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.5625) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2024-12-02 14:02:40,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:02:40,813 INFO L225 Difference]: With dead ends: 686 [2024-12-02 14:02:40,813 INFO L226 Difference]: Without dead ends: 686 [2024-12-02 14:02:40,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2024-12-02 14:02:40,813 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 1060 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1060 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:02:40,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1060 Valid, 826 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2024-12-02 14:02:40,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-12-02 14:02:40,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 484. [2024-12-02 14:02:40,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 439 states have (on average 1.539863325740319) internal successors, (676), 483 states have internal predecessors, (676), 0 states have call successors, (0), 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-12-02 14:02:40,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 676 transitions. [2024-12-02 14:02:40,818 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 676 transitions. Word has length 41 [2024-12-02 14:02:40,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:02:40,818 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 676 transitions. [2024-12-02 14:02:40,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.5625) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 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-12-02 14:02:40,818 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 676 transitions. [2024-12-02 14:02:40,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-12-02 14:02:40,818 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:02:40,819 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] [2024-12-02 14:02:40,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-12-02 14:02:40,819 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 14:02:40,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:02:40,819 INFO L85 PathProgramCache]: Analyzing trace with hash 86242126, now seen corresponding path program 1 times [2024-12-02 14:02:40,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:02:40,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9015294] [2024-12-02 14:02:40,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:02:40,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:02:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:02:43,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:02:43,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:02:43,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9015294] [2024-12-02 14:02:43,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9015294] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:02:43,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783205310] [2024-12-02 14:02:43,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:02:43,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:02:43,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:02:43,112 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:02:43,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 14:02:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:02:43,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-12-02 14:02:43,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:02:43,305 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-12-02 14:02:43,605 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 14:02:43,605 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-12-02 14:02:43,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 14:02:43,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 14:02:44,802 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 14:02:44,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 14:02:44,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 14:02:45,238 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 14:02:45,238 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-12-02 14:02:45,652 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 18 treesize of output 13 [2024-12-02 14:02:45,675 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 19 treesize of output 14 [2024-12-02 14:02:45,994 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 20 treesize of output 8 [2024-12-02 14:02:46,293 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 18 treesize of output 13 [2024-12-02 14:02:47,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:02:47,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:02:48,728 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2035 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2035) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) 1)) is different from false [2024-12-02 14:02:48,778 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2035 (Array Int Int))) (< (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_2035) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)) 1)) is different from false [2024-12-02 14:02:48,852 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int))) (< (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_2033) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_2034) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_2035) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)) 1)) is different from false [2024-12-02 14:02:49,470 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_39| Int) (v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int)) (v_ArrVal_2031 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_39|) 0)) (< (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2031) |v_ULTIMATE.start_main_~tmpList~0#1.base_39| v_ArrVal_2033) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2032) |v_ULTIMATE.start_main_~tmpList~0#1.base_39| v_ArrVal_2034) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_2035) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)) 1))) is different from false [2024-12-02 14:02:50,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:02:50,011 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 50 treesize of output 51 [2024-12-02 14:02:50,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:02:50,059 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 40 treesize of output 41 [2024-12-02 14:02:50,077 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:02:50,089 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 66 treesize of output 54 [2024-12-02 14:02:50,107 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:02:50,120 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 200 treesize of output 176 [2024-12-02 14:02:50,263 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-12-02 14:02:50,263 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 13 treesize of output 12 [2024-12-02 14:02:50,287 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 32 treesize of output 24 [2024-12-02 14:02:50,311 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 11 treesize of output 7 [2024-12-02 14:02:50,334 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 12 treesize of output 8 [2024-12-02 14:02:58,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:02:58,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783205310] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:02:58,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:02:58,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 14] total 29 [2024-12-02 14:02:58,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887670450] [2024-12-02 14:02:58,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:02:58,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-12-02 14:02:58,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:02:58,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-12-02 14:02:58,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=541, Unknown=8, NotChecked=204, Total=870 [2024-12-02 14:02:58,665 INFO L87 Difference]: Start difference. First operand 484 states and 676 transitions. Second operand has 30 states, 29 states have (on average 3.413793103448276) internal successors, (99), 30 states have internal predecessors, (99), 0 states have call successors, (0), 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-12-02 14:03:13,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:13,492 INFO L93 Difference]: Finished difference Result 627 states and 863 transitions. [2024-12-02 14:03:13,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 14:03:13,493 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.413793103448276) internal successors, (99), 30 states have internal predecessors, (99), 0 states have call successors, (0), 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 41 [2024-12-02 14:03:13,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:13,494 INFO L225 Difference]: With dead ends: 627 [2024-12-02 14:03:13,494 INFO L226 Difference]: Without dead ends: 627 [2024-12-02 14:03:13,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=197, Invalid=867, Unknown=8, NotChecked=260, Total=1332 [2024-12-02 14:03:13,495 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 542 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 2391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1194 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:13,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 1448 Invalid, 2391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1168 Invalid, 0 Unknown, 1194 Unchecked, 12.7s Time] [2024-12-02 14:03:13,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-12-02 14:03:13,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 487. [2024-12-02 14:03:13,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 442 states have (on average 1.5384615384615385) internal successors, (680), 486 states have internal predecessors, (680), 0 states have call successors, (0), 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-12-02 14:03:13,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 680 transitions. [2024-12-02 14:03:13,499 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 680 transitions. Word has length 41 [2024-12-02 14:03:13,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:13,500 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 680 transitions. [2024-12-02 14:03:13,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.413793103448276) internal successors, (99), 30 states have internal predecessors, (99), 0 states have call successors, (0), 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-12-02 14:03:13,500 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 680 transitions. [2024-12-02 14:03:13,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-02 14:03:13,500 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:13,500 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] [2024-12-02 14:03:13,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-12-02 14:03:13,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2024-12-02 14:03:13,700 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr98ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 14:03:13,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:13,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1621461036, now seen corresponding path program 1 times [2024-12-02 14:03:13,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:13,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894026279] [2024-12-02 14:03:13,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:13,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:19,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:19,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:19,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894026279] [2024-12-02 14:03:19,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894026279] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:03:19,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227713473] [2024-12-02 14:03:19,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:19,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:03:19,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:03:19,130 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:03:19,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 14:03:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:19,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-12-02 14:03:19,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:03:19,314 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-12-02 14:03:19,732 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 14:03:19,732 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-12-02 14:03:20,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 14:03:21,258 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 14:03:21,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 14:03:21,604 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 14:03:21,604 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-12-02 14:03:22,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-12-02 14:03:23,230 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 14:03:23,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 14:03:24,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-12-02 14:03:24,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:24,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:03:26,658 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2124 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2124) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) |c_#StackHeapBarrier|)) is different from false [2024-12-02 14:03:26,709 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2124 (Array Int Int))) (< (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_2124) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)) |c_#StackHeapBarrier|)) is different from false [2024-12-02 14:03:26,781 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2124 (Array Int Int)) (v_ArrVal_2123 (Array Int Int))) (< (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_2123))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_2124)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)) |c_#StackHeapBarrier|)) is different from false [2024-12-02 14:03:36,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:36,931 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 50 treesize of output 41 [2024-12-02 14:03:36,948 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:03:36,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 162 treesize of output 126 [2024-12-02 14:03:36,989 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 17 treesize of output 13 [2024-12-02 14:03:37,011 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 32 treesize of output 20 [2024-12-02 14:03:37,151 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-12-02 14:03:37,151 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 13 treesize of output 12 [2024-12-02 14:03:49,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:49,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227713473] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:03:49,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:03:49,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 12] total 36 [2024-12-02 14:03:49,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865353423] [2024-12-02 14:03:49,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:03:49,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-12-02 14:03:49,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:49,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-12-02 14:03:49,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=939, Unknown=21, NotChecked=192, Total=1260 [2024-12-02 14:03:49,635 INFO L87 Difference]: Start difference. First operand 487 states and 680 transitions. Second operand has 36 states, 36 states have (on average 3.388888888888889) internal successors, (122), 36 states have internal predecessors, (122), 0 states have call successors, (0), 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-12-02 14:04:32,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:04:32,674 INFO L93 Difference]: Finished difference Result 633 states and 868 transitions. [2024-12-02 14:04:32,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-12-02 14:04:32,674 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.388888888888889) internal successors, (122), 36 states have internal predecessors, (122), 0 states have call successors, (0), 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 42 [2024-12-02 14:04:32,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:04:32,675 INFO L225 Difference]: With dead ends: 633 [2024-12-02 14:04:32,675 INFO L226 Difference]: Without dead ends: 631 [2024-12-02 14:04:32,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 40.8s TimeCoverageRelationStatistics Valid=459, Invalid=2724, Unknown=21, NotChecked=336, Total=3540 [2024-12-02 14:04:32,676 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 618 mSDsluCounter, 2576 mSDsCounter, 0 mSdLazyCounter, 2998 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 2725 SdHoareTripleChecker+Invalid, 4037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 990 IncrementalHoareTripleChecker+Unchecked, 32.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:04:32,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 2725 Invalid, 4037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2998 Invalid, 0 Unknown, 990 Unchecked, 32.1s Time] [2024-12-02 14:04:32,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-12-02 14:04:32,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 485. [2024-12-02 14:04:32,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 440 states have (on average 1.5386363636363636) internal successors, (677), 484 states have internal predecessors, (677), 0 states have call successors, (0), 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-12-02 14:04:32,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 677 transitions. [2024-12-02 14:04:32,680 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 677 transitions. Word has length 42 [2024-12-02 14:04:32,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:04:32,680 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 677 transitions. [2024-12-02 14:04:32,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.388888888888889) internal successors, (122), 36 states have internal predecessors, (122), 0 states have call successors, (0), 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-12-02 14:04:32,680 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 677 transitions. [2024-12-02 14:04:32,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-12-02 14:04:32,681 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:04:32,681 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:04:32,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-12-02 14:04:32,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2024-12-02 14:04:32,881 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 14:04:32,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:04:32,881 INFO L85 PathProgramCache]: Analyzing trace with hash -152276901, now seen corresponding path program 1 times [2024-12-02 14:04:32,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:04:32,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130211124] [2024-12-02 14:04:32,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:04:32,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:04:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:04:33,689 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:04:33,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:04:33,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130211124] [2024-12-02 14:04:33,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130211124] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:04:33,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172392599] [2024-12-02 14:04:33,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:04:33,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:04:33,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:04:33,691 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:04:33,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-02 14:04:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:04:33,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-12-02 14:04:33,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:04:35,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:04:35,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 11 [2024-12-02 14:04:35,427 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 14:04:35,427 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-12-02 14:04:36,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:04:36,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:04:37,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:04:37,507 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 49 treesize of output 53 [2024-12-02 14:04:37,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:04:37,742 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 46 treesize of output 64 [2024-12-02 14:04:39,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:04:39,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172392599] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:04:39,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:04:39,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-12-02 14:04:39,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039581356] [2024-12-02 14:04:39,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:04:39,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-02 14:04:39,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:04:39,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-02 14:04:39,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-12-02 14:04:39,175 INFO L87 Difference]: Start difference. First operand 485 states and 677 transitions. Second operand has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 0 states have call successors, (0), 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-12-02 14:04:45,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:04:45,532 INFO L93 Difference]: Finished difference Result 632 states and 819 transitions. [2024-12-02 14:04:45,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 14:04:45,532 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 0 states have call successors, (0), 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 44 [2024-12-02 14:04:45,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:04:45,534 INFO L225 Difference]: With dead ends: 632 [2024-12-02 14:04:45,535 INFO L226 Difference]: Without dead ends: 632 [2024-12-02 14:04:45,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2024-12-02 14:04:45,535 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 1264 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1264 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-12-02 14:04:45,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1264 Valid, 309 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-12-02 14:04:45,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-12-02 14:04:45,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 481. [2024-12-02 14:04:45,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 440 states have (on average 1.5022727272727272) internal successors, (661), 480 states have internal predecessors, (661), 0 states have call successors, (0), 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-12-02 14:04:45,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 661 transitions. [2024-12-02 14:04:45,539 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 661 transitions. Word has length 44 [2024-12-02 14:04:45,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:04:45,539 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 661 transitions. [2024-12-02 14:04:45,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 0 states have call successors, (0), 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-12-02 14:04:45,539 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 661 transitions. [2024-12-02 14:04:45,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-12-02 14:04:45,540 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:04:45,540 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] [2024-12-02 14:04:45,549 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-12-02 14:04:45,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2024-12-02 14:04:45,740 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-12-02 14:04:45,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:04:45,741 INFO L85 PathProgramCache]: Analyzing trace with hash 766984195, now seen corresponding path program 1 times [2024-12-02 14:04:45,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:04:45,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576897636] [2024-12-02 14:04:45,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:04:45,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:04:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:04:55,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:04:55,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:04:55,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576897636] [2024-12-02 14:04:55,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576897636] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:04:55,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500456173] [2024-12-02 14:04:55,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:04:55,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:04:55,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:04:55,213 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:04:55,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f87893d-88a6-49f7-b718-e0e036616a0d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-12-02 14:04:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:04:55,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-12-02 14:04:55,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:04:55,436 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-12-02 14:04:55,996 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 14:04:55,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 14:04:56,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 14:04:56,529 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-12-02 14:04:57,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:04:57,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 36 [2024-12-02 14:04:57,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 14:04:58,289 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 14:04:58,289 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-12-02 14:04:58,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-02 14:04:59,243 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 19 treesize of output 14 [2024-12-02 14:04:59,313 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 18 treesize of output 13 [2024-12-02 14:05:00,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:05:00,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 56 [2024-12-02 14:05:00,410 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 33 treesize of output 26 [2024-12-02 14:05:05,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:05:05,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:05:05,211 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 27 [2024-12-02 14:05:05,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2024-12-02 14:05:06,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:05:06,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:05:12,384 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (forall ((v_ArrVal_2341 (Array Int Int)) (v_ArrVal_2340 (Array Int Int))) (<= 0 (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_2341)) (.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_2340))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4)) (.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4))) (let ((.cse0 (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 |c_ULTIMATE.start_main_~tmpList~0#1.offset|)))) (select (select .cse0 (select (select (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 |c_ULTIMATE.start_main_~tmpList~0#1.base|)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4)) (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4))))))) (forall ((v_ArrVal_2341 (Array Int Int)) (v_ArrVal_2340 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_2341)) (.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_2340))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4)) (.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4))) (let ((.cse6 (store .cse13 .cse11 (store (select .cse13 .cse11) .cse12 |c_ULTIMATE.start_main_~tmpList~0#1.offset|))) (.cse9 (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 |c_ULTIMATE.start_main_~tmpList~0#1.base|)))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4))) (<= (+ (select (select .cse6 .cse7) .cse8) 4) (select |c_#length| (select (select .cse9 .cse7) .cse8)))))))))) is different from false [2024-12-02 14:05:12,667 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 860 treesize of output 719 [2024-12-02 14:05:20,940 INFO L349 Elim1Store]: treesize reduction 57, result has 61.5 percent of original size [2024-12-02 14:05:20,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 1432 treesize of output 837 [2024-12-02 14:05:21,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:05:21,007 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 706 treesize of output 527 [2024-12-02 14:05:39,323 WARN L286 SmtUtils]: Spent 17.92s on a formula simplification. DAG size of input: 241 DAG size of output: 165 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-12-02 14:05:39,324 INFO L349 Elim1Store]: treesize reduction 791, result has 62.6 percent of original size [2024-12-02 14:05:39,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 12 new quantified variables, introduced 45 case distinctions, treesize of input 14300813 treesize of output 13111879 [2024-12-02 14:06:18,916 WARN L286 SmtUtils]: Spent 34.73s on a formula simplification. DAG size of input: 810 DAG size of output: 183 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-12-02 14:06:18,916 INFO L349 Elim1Store]: treesize reduction 3104, result has 11.3 percent of original size [2024-12-02 14:06:18,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 23 new quantified variables, introduced 138 case distinctions, treesize of input 12597857 treesize of output 12397910 [2024-12-02 14:06:43,512 WARN L286 SmtUtils]: Spent 24.55s on a formula simplification. DAG size of input: 16119 DAG size of output: 2745 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 14:06:45,090 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 32626 treesize of output 32326 [2024-12-02 14:06:47,551 INFO L224 Elim1Store]: Index analysis took 373 ms [2024-12-02 14:06:54,133 WARN L286 SmtUtils]: Spent 6.57s on a formula simplification. DAG size of input: 176 DAG size of output: 108 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-12-02 14:06:54,133 INFO L349 Elim1Store]: treesize reduction 374, result has 51.4 percent of original size [2024-12-02 14:06:54,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 60152 treesize of output 58266 [2024-12-02 14:06:56,959 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 32159 treesize of output 31683 [2024-12-02 14:07:00,607 INFO L224 Elim1Store]: Index analysis took 210 ms [2024-12-02 14:07:01,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:07:01,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 30975 treesize of output 31015 [2024-12-02 14:07:07,673 INFO L224 Elim1Store]: Index analysis took 823 ms [2024-12-02 14:07:23,548 WARN L286 SmtUtils]: Spent 15.56s on a formula simplification. DAG size of input: 455 DAG size of output: 118 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-12-02 14:07:23,548 INFO L349 Elim1Store]: treesize reduction 2231, result has 11.0 percent of original size [2024-12-02 14:07:23,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 68 case distinctions, treesize of input 608082 treesize of output 549278 [2024-12-02 14:07:48,320 WARN L286 SmtUtils]: Spent 24.75s on a formula simplification. DAG size of input: 5622 DAG size of output: 3875 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 14:07:53,542 WARN L286 SmtUtils]: Spent 5.20s on a formula simplification that was a NOOP. DAG size: 3866 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 14:07:54,885 INFO L224 Elim1Store]: Index analysis took 571 ms [2024-12-02 14:08:03,477 WARN L286 SmtUtils]: Spent 8.58s on a formula simplification. DAG size of input: 174 DAG size of output: 106 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-12-02 14:08:03,477 INFO L349 Elim1Store]: treesize reduction 329, result has 49.9 percent of original size [2024-12-02 14:08:03,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 36 case distinctions, treesize of input 101217 treesize of output 95362 [2024-12-02 14:08:16,358 WARN L286 SmtUtils]: Spent 12.87s on a formula simplification. DAG size of input: 3998 DAG size of output: 3991 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 14:08:22,343 WARN L286 SmtUtils]: Spent 5.96s on a formula simplification that was a NOOP. DAG size: 3980 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 14:08:23,473 INFO L224 Elim1Store]: Index analysis took 530 ms [2024-12-02 14:08:35,020 WARN L286 SmtUtils]: Spent 11.54s on a formula simplification. DAG size of input: 174 DAG size of output: 114 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-12-02 14:08:35,020 INFO L349 Elim1Store]: treesize reduction 302, result has 54.0 percent of original size [2024-12-02 14:08:35,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 36 case distinctions, treesize of input 118495 treesize of output 111819 [2024-12-02 14:08:45,479 WARN L286 SmtUtils]: Spent 10.45s on a formula simplification. DAG size of input: 4118 DAG size of output: 4107 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 14:08:52,675 WARN L286 SmtUtils]: Spent 7.17s on a formula simplification that was a NOOP. DAG size: 4096 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 14:08:53,405 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 247438 treesize of output 220714 [2024-12-02 14:09:04,085 WARN L286 SmtUtils]: Spent 10.67s on a formula simplification. DAG size of input: 4233 DAG size of output: 4164 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 14:09:05,219 INFO L224 Elim1Store]: Index analysis took 459 ms [2024-12-02 14:09:13,068 WARN L286 SmtUtils]: Spent 7.84s on a formula simplification. DAG size of input: 106 DAG size of output: 90 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-12-02 14:09:13,068 INFO L349 Elim1Store]: treesize reduction 63, result has 78.2 percent of original size [2024-12-02 14:09:13,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 98884 treesize of output 91984 [2024-12-02 14:09:29,780 WARN L286 SmtUtils]: Spent 16.70s on a formula simplification. DAG size of input: 4293 DAG size of output: 4278 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 14:09:38,023 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 4263 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 14:09:39,050 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 299004 treesize of output 276216 [2024-12-02 14:10:01,738 WARN L286 SmtUtils]: Spent 22.67s on a formula simplification. DAG size of input: 4350 DAG size of output: 4280 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 14:10:02,996 INFO L224 Elim1Store]: Index analysis took 387 ms [2024-12-02 14:10:10,875 WARN L286 SmtUtils]: Spent 7.86s on a formula simplification. DAG size of input: 106 DAG size of output: 90 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-12-02 14:10:10,875 INFO L349 Elim1Store]: treesize reduction 63, result has 78.2 percent of original size [2024-12-02 14:10:10,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 118993 treesize of output 109041 [2024-12-02 14:10:30,026 WARN L286 SmtUtils]: Spent 19.14s on a formula simplification. DAG size of input: 4400 DAG size of output: 4385 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 14:10:39,865 WARN L286 SmtUtils]: Spent 9.81s on a formula simplification that was a NOOP. DAG size: 4372 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)