./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety/test-0521.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/memsafety/test-0521.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 8f93bb95cdf89e74505d1cec34fe12f91118330575417bcdc58953f5537fb98b --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:25:40,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:25:40,646 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:25:40,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:25:40,652 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:25:40,666 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:25:40,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:25:40,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:25:40,668 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:25:40,668 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:25:40,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:25:40,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:25:40,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:25:40,669 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:25:40,669 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:25:40,670 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:25:40,670 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:25:40,670 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:25:40,670 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:25:40,670 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:25:40,670 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:25:40,670 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:25:40,670 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:25:40,670 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:25:40,670 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:25:40,670 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:25:40,670 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:25:40,670 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:25:40,670 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:25:40,670 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:25:40,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:25:40,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:25:40,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:25:40,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:25:40,671 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:25:40,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:25:40,671 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:25:40,671 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:25:40,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:25:40,672 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:25:40,672 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:25:40,672 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:25:40,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:25:40,672 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:25:40,672 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:25:40,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:25:40,672 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 8f93bb95cdf89e74505d1cec34fe12f91118330575417bcdc58953f5537fb98b [2025-04-29 11:25:40,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:25:40,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:25:40,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:25:40,933 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:25:40,934 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:25:40,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0521.c [2025-04-29 11:25:42,310 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9a645530/3e3784b9790646c2a0382d95af147c0a/FLAG5be88cda0 [2025-04-29 11:25:42,524 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:25:42,525 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/test-0521.c [2025-04-29 11:25:42,527 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:25:42,527 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:25:42,531 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9a645530/3e3784b9790646c2a0382d95af147c0a/FLAG5be88cda0 [2025-04-29 11:25:43,510 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9a645530/3e3784b9790646c2a0382d95af147c0a [2025-04-29 11:25:43,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:25:43,513 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:25:43,514 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:25:43,514 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:25:43,517 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:25:43,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:25:43" (1/1) ... [2025-04-29 11:25:43,518 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b6c4c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:43, skipping insertion in model container [2025-04-29 11:25:43,518 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:25:43" (1/1) ... [2025-04-29 11:25:43,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:25:43,709 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:25:43,722 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:25:43,774 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:25:43,789 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:25:43,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:43 WrapperNode [2025-04-29 11:25:43,790 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:25:43,791 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:25:43,791 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:25:43,791 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:25:43,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:43" (1/1) ... [2025-04-29 11:25:43,808 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:43" (1/1) ... [2025-04-29 11:25:43,829 INFO L138 Inliner]: procedures = 14, calls = 91, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 291 [2025-04-29 11:25:43,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:25:43,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:25:43,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:25:43,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:25:43,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:43" (1/1) ... [2025-04-29 11:25:43,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:43" (1/1) ... [2025-04-29 11:25:43,842 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:43" (1/1) ... [2025-04-29 11:25:43,878 INFO L175 MemorySlicer]: Split 74 memory accesses to 5 slices as follows [8, 16, 3, 16, 31]. 42 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1, 0, 0]. The 26 writes are split as follows [1, 8, 1, 8, 8]. [2025-04-29 11:25:43,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:43" (1/1) ... [2025-04-29 11:25:43,879 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:43" (1/1) ... [2025-04-29 11:25:43,897 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:43" (1/1) ... [2025-04-29 11:25:43,898 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:43" (1/1) ... [2025-04-29 11:25:43,905 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:43" (1/1) ... [2025-04-29 11:25:43,906 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:43" (1/1) ... [2025-04-29 11:25:43,907 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:43" (1/1) ... [2025-04-29 11:25:43,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:25:43,917 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:25:43,917 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:25:43,917 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:25:43,918 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:43" (1/1) ... [2025-04-29 11:25:43,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:25:43,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:43,943 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:25:43,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:25:43,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:25:43,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:25:43,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-29 11:25:43,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-04-29 11:25:43,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-04-29 11:25:43,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:25:43,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:25:43,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-29 11:25:43,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-04-29 11:25:43,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-04-29 11:25:43,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:25:43,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:25:43,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:25:43,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-29 11:25:43,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-04-29 11:25:43,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-04-29 11:25:43,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:25:43,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:25:43,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-29 11:25:43,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-29 11:25:43,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-04-29 11:25:43,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:25:43,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:25:43,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:25:43,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:25:44,058 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:25:44,059 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:25:44,640 INFO L? ?]: Removed 333 outVars from TransFormulas that were not future-live. [2025-04-29 11:25:44,640 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:25:44,652 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:25:44,652 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-29 11:25:44,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:25:44 BoogieIcfgContainer [2025-04-29 11:25:44,652 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:25:44,653 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:25:44,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:25:44,657 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:25:44,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:25:43" (1/3) ... [2025-04-29 11:25:44,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c01b59d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:25:44, skipping insertion in model container [2025-04-29 11:25:44,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:43" (2/3) ... [2025-04-29 11:25:44,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c01b59d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:25:44, skipping insertion in model container [2025-04-29 11:25:44,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:25:44" (3/3) ... [2025-04-29 11:25:44,658 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0521.c [2025-04-29 11:25:44,668 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:25:44,669 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0521.c that has 1 procedures, 312 locations, 344 edges, 1 initial locations, 8 loop locations, and 152 error locations. [2025-04-29 11:25:44,697 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:25:44,707 INFO L340 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;@14a65a25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:25:44,707 INFO L341 AbstractCegarLoop]: Starting to check reachability of 152 error locations. [2025-04-29 11:25:44,710 INFO L278 IsEmpty]: Start isEmpty. Operand has 312 states, 159 states have (on average 2.1635220125786163) internal successors, (344), 311 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:44,713 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-29 11:25:44,713 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:44,714 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:25:44,714 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:44,717 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:44,717 INFO L85 PathProgramCache]: Analyzing trace with hash 28730505, now seen corresponding path program 1 times [2025-04-29 11:25:44,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:44,723 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176934088] [2025-04-29 11:25:44,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:44,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:44,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:25:44,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:25:44,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:44,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:44,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:44,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:44,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176934088] [2025-04-29 11:25:44,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176934088] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:44,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:44,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:25:44,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515240441] [2025-04-29 11:25:44,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:44,807 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-29 11:25:44,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:44,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-29 11:25:44,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 11:25:44,825 INFO L87 Difference]: Start difference. First operand has 312 states, 159 states have (on average 2.1635220125786163) internal successors, (344), 311 states have internal predecessors, (344), 0 states have call successors, (0), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:44,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:44,856 INFO L93 Difference]: Finished difference Result 312 states and 339 transitions. [2025-04-29 11:25:44,857 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-29 11:25:44,857 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2025-04-29 11:25:44,858 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:44,865 INFO L225 Difference]: With dead ends: 312 [2025-04-29 11:25:44,865 INFO L226 Difference]: Without dead ends: 310 [2025-04-29 11:25:44,866 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 11:25:44,867 INFO L437 NwaCegarLoop]: 339 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:44,868 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:25:44,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-04-29 11:25:44,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2025-04-29 11:25:44,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 158 states have (on average 2.132911392405063) internal successors, (337), 309 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:44,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 337 transitions. [2025-04-29 11:25:44,907 INFO L79 Accepts]: Start accepts. Automaton has 310 states and 337 transitions. Word has length 5 [2025-04-29 11:25:44,907 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:44,908 INFO L485 AbstractCegarLoop]: Abstraction has 310 states and 337 transitions. [2025-04-29 11:25:44,908 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:44,908 INFO L278 IsEmpty]: Start isEmpty. Operand 310 states and 337 transitions. [2025-04-29 11:25:44,908 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:25:44,908 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:44,908 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:25:44,908 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:25:44,909 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:44,909 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:44,909 INFO L85 PathProgramCache]: Analyzing trace with hash 889541450, now seen corresponding path program 1 times [2025-04-29 11:25:44,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:44,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641616851] [2025-04-29 11:25:44,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:44,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:44,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:25:44,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:25:44,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:44,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:44,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:44,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:44,986 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641616851] [2025-04-29 11:25:44,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641616851] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:44,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:44,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:25:44,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264393616] [2025-04-29 11:25:44,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:44,987 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:25:44,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:44,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:25:44,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:25:44,989 INFO L87 Difference]: Start difference. First operand 310 states and 337 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:45,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:45,223 INFO L93 Difference]: Finished difference Result 294 states and 321 transitions. [2025-04-29 11:25:45,224 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:25:45,224 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-29 11:25:45,224 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:45,225 INFO L225 Difference]: With dead ends: 294 [2025-04-29 11:25:45,225 INFO L226 Difference]: Without dead ends: 294 [2025-04-29 11:25:45,225 INFO L436 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 [2025-04-29 11:25:45,226 INFO L437 NwaCegarLoop]: 274 mSDtfsCounter, 59 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:45,226 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 406 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:25:45,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-04-29 11:25:45,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2025-04-29 11:25:45,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 158 states have (on average 2.0316455696202533) internal successors, (321), 293 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:45,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 321 transitions. [2025-04-29 11:25:45,243 INFO L79 Accepts]: Start accepts. Automaton has 294 states and 321 transitions. Word has length 6 [2025-04-29 11:25:45,243 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:45,243 INFO L485 AbstractCegarLoop]: Abstraction has 294 states and 321 transitions. [2025-04-29 11:25:45,244 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:45,244 INFO L278 IsEmpty]: Start isEmpty. Operand 294 states and 321 transitions. [2025-04-29 11:25:45,244 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:25:45,244 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:45,244 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:25:45,244 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:25:45,244 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:45,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:45,245 INFO L85 PathProgramCache]: Analyzing trace with hash 889541451, now seen corresponding path program 1 times [2025-04-29 11:25:45,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:45,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10329954] [2025-04-29 11:25:45,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:45,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:45,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:25:45,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:25:45,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:45,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:45,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:45,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:45,312 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10329954] [2025-04-29 11:25:45,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10329954] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:45,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:45,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:25:45,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295615702] [2025-04-29 11:25:45,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:45,313 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:25:45,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:45,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:25:45,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:25:45,314 INFO L87 Difference]: Start difference. First operand 294 states and 321 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:45,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:45,470 INFO L93 Difference]: Finished difference Result 278 states and 305 transitions. [2025-04-29 11:25:45,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:25:45,470 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-29 11:25:45,471 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:45,472 INFO L225 Difference]: With dead ends: 278 [2025-04-29 11:25:45,472 INFO L226 Difference]: Without dead ends: 278 [2025-04-29 11:25:45,472 INFO L436 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 [2025-04-29 11:25:45,472 INFO L437 NwaCegarLoop]: 274 mSDtfsCounter, 59 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:45,473 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 416 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:45,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-04-29 11:25:45,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2025-04-29 11:25:45,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 158 states have (on average 1.9303797468354431) internal successors, (305), 277 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:45,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 305 transitions. [2025-04-29 11:25:45,497 INFO L79 Accepts]: Start accepts. Automaton has 278 states and 305 transitions. Word has length 6 [2025-04-29 11:25:45,498 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:45,498 INFO L485 AbstractCegarLoop]: Abstraction has 278 states and 305 transitions. [2025-04-29 11:25:45,498 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:45,498 INFO L278 IsEmpty]: Start isEmpty. Operand 278 states and 305 transitions. [2025-04-29 11:25:45,498 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:25:45,498 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:45,498 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:45,498 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:25:45,498 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:45,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:45,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1805890954, now seen corresponding path program 1 times [2025-04-29 11:25:45,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:45,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22027312] [2025-04-29 11:25:45,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:45,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:45,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:25:45,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:25:45,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:45,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:45,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:45,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:45,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22027312] [2025-04-29 11:25:45,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22027312] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:45,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:45,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:25:45,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926910091] [2025-04-29 11:25:45,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:45,553 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:25:45,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:45,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:25:45,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:25:45,556 INFO L87 Difference]: Start difference. First operand 278 states and 305 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:45,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:45,711 INFO L93 Difference]: Finished difference Result 276 states and 303 transitions. [2025-04-29 11:25:45,711 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:25:45,711 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-04-29 11:25:45,711 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:45,712 INFO L225 Difference]: With dead ends: 276 [2025-04-29 11:25:45,712 INFO L226 Difference]: Without dead ends: 276 [2025-04-29 11:25:45,713 INFO L436 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 [2025-04-29 11:25:45,713 INFO L437 NwaCegarLoop]: 295 mSDtfsCounter, 6 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:45,714 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 449 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:45,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-04-29 11:25:45,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2025-04-29 11:25:45,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 158 states have (on average 1.9177215189873418) internal successors, (303), 275 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:45,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 303 transitions. [2025-04-29 11:25:45,719 INFO L79 Accepts]: Start accepts. Automaton has 276 states and 303 transitions. Word has length 7 [2025-04-29 11:25:45,719 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:45,719 INFO L485 AbstractCegarLoop]: Abstraction has 276 states and 303 transitions. [2025-04-29 11:25:45,719 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:45,719 INFO L278 IsEmpty]: Start isEmpty. Operand 276 states and 303 transitions. [2025-04-29 11:25:45,719 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:25:45,719 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:45,720 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:45,720 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:25:45,720 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:45,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:45,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1805890955, now seen corresponding path program 1 times [2025-04-29 11:25:45,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:45,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154201304] [2025-04-29 11:25:45,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:45,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:45,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:25:45,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:25:45,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:45,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:45,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:45,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:45,778 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154201304] [2025-04-29 11:25:45,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154201304] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:45,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:45,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:25:45,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322633087] [2025-04-29 11:25:45,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:45,779 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:25:45,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:45,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:25:45,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:25:45,780 INFO L87 Difference]: Start difference. First operand 276 states and 303 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:45,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:45,931 INFO L93 Difference]: Finished difference Result 274 states and 301 transitions. [2025-04-29 11:25:45,935 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:25:45,935 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-04-29 11:25:45,935 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:45,936 INFO L225 Difference]: With dead ends: 274 [2025-04-29 11:25:45,936 INFO L226 Difference]: Without dead ends: 274 [2025-04-29 11:25:45,936 INFO L436 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 [2025-04-29 11:25:45,938 INFO L437 NwaCegarLoop]: 295 mSDtfsCounter, 6 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:45,938 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 460 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:45,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-04-29 11:25:45,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2025-04-29 11:25:45,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 158 states have (on average 1.9050632911392404) internal successors, (301), 273 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:45,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 301 transitions. [2025-04-29 11:25:45,943 INFO L79 Accepts]: Start accepts. Automaton has 274 states and 301 transitions. Word has length 7 [2025-04-29 11:25:45,943 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:45,943 INFO L485 AbstractCegarLoop]: Abstraction has 274 states and 301 transitions. [2025-04-29 11:25:45,943 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:45,944 INFO L278 IsEmpty]: Start isEmpty. Operand 274 states and 301 transitions. [2025-04-29 11:25:45,944 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 11:25:45,944 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:45,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:45,944 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:25:45,944 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:45,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:45,944 INFO L85 PathProgramCache]: Analyzing trace with hash 150842187, now seen corresponding path program 1 times [2025-04-29 11:25:45,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:45,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072561490] [2025-04-29 11:25:45,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:45,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:45,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:25:45,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:25:45,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:45,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:46,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:46,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:46,009 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072561490] [2025-04-29 11:25:46,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072561490] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:46,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:46,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:25:46,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637265464] [2025-04-29 11:25:46,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:46,010 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:25:46,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:46,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:25:46,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:25:46,010 INFO L87 Difference]: Start difference. First operand 274 states and 301 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:46,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:46,054 INFO L93 Difference]: Finished difference Result 338 states and 373 transitions. [2025-04-29 11:25:46,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:25:46,056 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-04-29 11:25:46,056 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:46,057 INFO L225 Difference]: With dead ends: 338 [2025-04-29 11:25:46,057 INFO L226 Difference]: Without dead ends: 338 [2025-04-29 11:25:46,058 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:25:46,058 INFO L437 NwaCegarLoop]: 296 mSDtfsCounter, 68 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:46,058 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 867 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:25:46,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-04-29 11:25:46,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 279. [2025-04-29 11:25:46,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 163 states have (on average 1.883435582822086) internal successors, (307), 278 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 307 transitions. [2025-04-29 11:25:46,066 INFO L79 Accepts]: Start accepts. Automaton has 279 states and 307 transitions. Word has length 8 [2025-04-29 11:25:46,066 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:46,066 INFO L485 AbstractCegarLoop]: Abstraction has 279 states and 307 transitions. [2025-04-29 11:25:46,066 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:46,066 INFO L278 IsEmpty]: Start isEmpty. Operand 279 states and 307 transitions. [2025-04-29 11:25:46,067 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-29 11:25:46,067 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:46,067 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:46,067 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:25:46,067 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:46,068 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:46,068 INFO L85 PathProgramCache]: Analyzing trace with hash 712820468, now seen corresponding path program 1 times [2025-04-29 11:25:46,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:46,068 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790924313] [2025-04-29 11:25:46,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:46,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:46,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:25:46,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:25:46,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:46,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:46,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:46,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:46,134 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790924313] [2025-04-29 11:25:46,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790924313] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:46,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:46,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:25:46,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591696835] [2025-04-29 11:25:46,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:46,134 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:25:46,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:46,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:25:46,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:25:46,134 INFO L87 Difference]: Start difference. First operand 279 states and 307 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:46,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:46,280 INFO L93 Difference]: Finished difference Result 277 states and 305 transitions. [2025-04-29 11:25:46,281 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:25:46,281 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-04-29 11:25:46,281 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:46,282 INFO L225 Difference]: With dead ends: 277 [2025-04-29 11:25:46,282 INFO L226 Difference]: Without dead ends: 277 [2025-04-29 11:25:46,282 INFO L436 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 [2025-04-29 11:25:46,283 INFO L437 NwaCegarLoop]: 293 mSDtfsCounter, 2 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:46,283 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 448 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:46,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-04-29 11:25:46,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2025-04-29 11:25:46,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 163 states have (on average 1.8711656441717792) internal successors, (305), 276 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:46,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 305 transitions. [2025-04-29 11:25:46,287 INFO L79 Accepts]: Start accepts. Automaton has 277 states and 305 transitions. Word has length 12 [2025-04-29 11:25:46,287 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:46,287 INFO L485 AbstractCegarLoop]: Abstraction has 277 states and 305 transitions. [2025-04-29 11:25:46,287 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:46,287 INFO L278 IsEmpty]: Start isEmpty. Operand 277 states and 305 transitions. [2025-04-29 11:25:46,288 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-29 11:25:46,288 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:46,288 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:46,288 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:25:46,288 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:46,288 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:46,288 INFO L85 PathProgramCache]: Analyzing trace with hash 712820469, now seen corresponding path program 1 times [2025-04-29 11:25:46,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:46,288 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007126852] [2025-04-29 11:25:46,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:46,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:46,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:25:46,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:25:46,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:46,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:46,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:46,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:46,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007126852] [2025-04-29 11:25:46,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007126852] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:46,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:46,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:25:46,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10984637] [2025-04-29 11:25:46,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:46,374 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:25:46,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:46,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:25:46,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:25:46,376 INFO L87 Difference]: Start difference. First operand 277 states and 305 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:46,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:46,494 INFO L93 Difference]: Finished difference Result 275 states and 303 transitions. [2025-04-29 11:25:46,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:25:46,495 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-04-29 11:25:46,495 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:46,496 INFO L225 Difference]: With dead ends: 275 [2025-04-29 11:25:46,496 INFO L226 Difference]: Without dead ends: 275 [2025-04-29 11:25:46,496 INFO L436 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 [2025-04-29 11:25:46,497 INFO L437 NwaCegarLoop]: 293 mSDtfsCounter, 2 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:46,497 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 459 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:46,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-04-29 11:25:46,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-04-29 11:25:46,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 163 states have (on average 1.8588957055214723) internal successors, (303), 274 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:46,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 303 transitions. [2025-04-29 11:25:46,504 INFO L79 Accepts]: Start accepts. Automaton has 275 states and 303 transitions. Word has length 12 [2025-04-29 11:25:46,504 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:46,504 INFO L485 AbstractCegarLoop]: Abstraction has 275 states and 303 transitions. [2025-04-29 11:25:46,504 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:46,504 INFO L278 IsEmpty]: Start isEmpty. Operand 275 states and 303 transitions. [2025-04-29 11:25:46,504 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:25:46,505 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:46,505 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:46,505 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:25:46,505 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:46,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:46,506 INFO L85 PathProgramCache]: Analyzing trace with hash 304404885, now seen corresponding path program 1 times [2025-04-29 11:25:46,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:46,506 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44666263] [2025-04-29 11:25:46,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:46,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:46,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:25:46,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:25:46,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:46,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:46,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:46,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:46,623 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44666263] [2025-04-29 11:25:46,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44666263] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:46,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:46,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:25:46,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018645658] [2025-04-29 11:25:46,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:46,623 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:25:46,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:46,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:25:46,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:25:46,624 INFO L87 Difference]: Start difference. First operand 275 states and 303 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:46,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:46,738 INFO L93 Difference]: Finished difference Result 326 states and 361 transitions. [2025-04-29 11:25:46,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:25:46,738 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-29 11:25:46,739 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:46,740 INFO L225 Difference]: With dead ends: 326 [2025-04-29 11:25:46,740 INFO L226 Difference]: Without dead ends: 326 [2025-04-29 11:25:46,740 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:25:46,740 INFO L437 NwaCegarLoop]: 285 mSDtfsCounter, 78 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:46,740 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1413 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:46,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-04-29 11:25:46,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 278. [2025-04-29 11:25:46,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 166 states have (on average 1.8433734939759037) internal successors, (306), 277 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:46,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 306 transitions. [2025-04-29 11:25:46,744 INFO L79 Accepts]: Start accepts. Automaton has 278 states and 306 transitions. Word has length 13 [2025-04-29 11:25:46,744 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:46,744 INFO L485 AbstractCegarLoop]: Abstraction has 278 states and 306 transitions. [2025-04-29 11:25:46,745 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:46,745 INFO L278 IsEmpty]: Start isEmpty. Operand 278 states and 306 transitions. [2025-04-29 11:25:46,745 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:25:46,745 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:46,745 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:46,745 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:25:46,745 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:46,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:46,746 INFO L85 PathProgramCache]: Analyzing trace with hash 847787734, now seen corresponding path program 1 times [2025-04-29 11:25:46,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:46,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914475134] [2025-04-29 11:25:46,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:46,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:46,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:25:46,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:25:46,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:46,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:46,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:46,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:46,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914475134] [2025-04-29 11:25:46,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914475134] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:46,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:46,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:25:46,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675167660] [2025-04-29 11:25:46,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:46,800 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:25:46,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:46,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:25:46,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:25:46,800 INFO L87 Difference]: Start difference. First operand 278 states and 306 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:46,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:46,859 INFO L93 Difference]: Finished difference Result 400 states and 440 transitions. [2025-04-29 11:25:46,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:25:46,860 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-29 11:25:46,860 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:46,861 INFO L225 Difference]: With dead ends: 400 [2025-04-29 11:25:46,861 INFO L226 Difference]: Without dead ends: 400 [2025-04-29 11:25:46,862 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:25:46,862 INFO L437 NwaCegarLoop]: 289 mSDtfsCounter, 131 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:46,862 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1115 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:25:46,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-04-29 11:25:46,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 339. [2025-04-29 11:25:46,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 227 states have (on average 1.8986784140969164) internal successors, (431), 338 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:46,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 431 transitions. [2025-04-29 11:25:46,868 INFO L79 Accepts]: Start accepts. Automaton has 339 states and 431 transitions. Word has length 14 [2025-04-29 11:25:46,868 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:46,868 INFO L485 AbstractCegarLoop]: Abstraction has 339 states and 431 transitions. [2025-04-29 11:25:46,868 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:46,868 INFO L278 IsEmpty]: Start isEmpty. Operand 339 states and 431 transitions. [2025-04-29 11:25:46,869 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:25:46,869 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:46,869 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:46,869 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:25:46,869 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:46,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:46,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1404535220, now seen corresponding path program 1 times [2025-04-29 11:25:46,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:46,870 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952491815] [2025-04-29 11:25:46,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:46,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:46,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:25:46,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:25:46,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:46,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:46,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:46,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:46,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952491815] [2025-04-29 11:25:46,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952491815] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:46,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:46,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:25:46,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354128443] [2025-04-29 11:25:46,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:46,895 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:25:46,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:46,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:25:46,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:25:46,895 INFO L87 Difference]: Start difference. First operand 339 states and 431 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) [2025-04-29 11:25:46,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:46,905 INFO L93 Difference]: Finished difference Result 324 states and 406 transitions. [2025-04-29 11:25:46,905 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:25:46,905 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 [2025-04-29 11:25:46,905 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:46,906 INFO L225 Difference]: With dead ends: 324 [2025-04-29 11:25:46,907 INFO L226 Difference]: Without dead ends: 324 [2025-04-29 11:25:46,907 INFO L436 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 [2025-04-29 11:25:46,908 INFO L437 NwaCegarLoop]: 296 mSDtfsCounter, 0 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:46,908 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 583 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:25:46,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-04-29 11:25:46,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2025-04-29 11:25:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 212 states have (on average 1.9150943396226414) internal successors, (406), 323 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:46,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 406 transitions. [2025-04-29 11:25:46,912 INFO L79 Accepts]: Start accepts. Automaton has 324 states and 406 transitions. Word has length 16 [2025-04-29 11:25:46,912 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:46,913 INFO L485 AbstractCegarLoop]: Abstraction has 324 states and 406 transitions. [2025-04-29 11:25:46,913 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) [2025-04-29 11:25:46,913 INFO L278 IsEmpty]: Start isEmpty. Operand 324 states and 406 transitions. [2025-04-29 11:25:46,913 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:25:46,913 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:46,913 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:46,913 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:25:46,914 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:46,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:46,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1319575428, now seen corresponding path program 1 times [2025-04-29 11:25:46,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:46,914 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26629918] [2025-04-29 11:25:46,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:46,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:46,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:25:46,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:25:46,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:46,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:46,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:46,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:46,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26629918] [2025-04-29 11:25:46,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26629918] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:46,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:46,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:25:46,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789578477] [2025-04-29 11:25:46,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:46,950 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:25:46,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:46,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:25:46,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:25:46,951 INFO L87 Difference]: Start difference. First operand 324 states and 406 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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) [2025-04-29 11:25:47,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:47,082 INFO L93 Difference]: Finished difference Result 308 states and 374 transitions. [2025-04-29 11:25:47,082 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:25:47,083 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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 [2025-04-29 11:25:47,083 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:47,084 INFO L225 Difference]: With dead ends: 308 [2025-04-29 11:25:47,084 INFO L226 Difference]: Without dead ends: 308 [2025-04-29 11:25:47,084 INFO L436 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 [2025-04-29 11:25:47,084 INFO L437 NwaCegarLoop]: 234 mSDtfsCounter, 59 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:47,085 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 346 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:47,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-04-29 11:25:47,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2025-04-29 11:25:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 212 states have (on average 1.7641509433962264) internal successors, (374), 307 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:47,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 374 transitions. [2025-04-29 11:25:47,089 INFO L79 Accepts]: Start accepts. Automaton has 308 states and 374 transitions. Word has length 16 [2025-04-29 11:25:47,089 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:47,089 INFO L485 AbstractCegarLoop]: Abstraction has 308 states and 374 transitions. [2025-04-29 11:25:47,089 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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) [2025-04-29 11:25:47,089 INFO L278 IsEmpty]: Start isEmpty. Operand 308 states and 374 transitions. [2025-04-29 11:25:47,089 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:25:47,089 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:47,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:47,089 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:25:47,090 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:47,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:47,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1319575427, now seen corresponding path program 1 times [2025-04-29 11:25:47,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:47,090 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62045694] [2025-04-29 11:25:47,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:47,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:47,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:25:47,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:25:47,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:47,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:47,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:47,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:47,126 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62045694] [2025-04-29 11:25:47,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62045694] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:47,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:47,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:25:47,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921738654] [2025-04-29 11:25:47,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:47,127 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:25:47,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:47,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:25:47,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:25:47,128 INFO L87 Difference]: Start difference. First operand 308 states and 374 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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) [2025-04-29 11:25:47,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:47,245 INFO L93 Difference]: Finished difference Result 292 states and 342 transitions. [2025-04-29 11:25:47,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:25:47,245 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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 [2025-04-29 11:25:47,245 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:47,246 INFO L225 Difference]: With dead ends: 292 [2025-04-29 11:25:47,246 INFO L226 Difference]: Without dead ends: 292 [2025-04-29 11:25:47,246 INFO L436 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 [2025-04-29 11:25:47,247 INFO L437 NwaCegarLoop]: 234 mSDtfsCounter, 59 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:47,247 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 356 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:47,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-04-29 11:25:47,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2025-04-29 11:25:47,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 212 states have (on average 1.6132075471698113) internal successors, (342), 291 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:47,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 342 transitions. [2025-04-29 11:25:47,251 INFO L79 Accepts]: Start accepts. Automaton has 292 states and 342 transitions. Word has length 16 [2025-04-29 11:25:47,251 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:47,251 INFO L485 AbstractCegarLoop]: Abstraction has 292 states and 342 transitions. [2025-04-29 11:25:47,252 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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) [2025-04-29 11:25:47,252 INFO L278 IsEmpty]: Start isEmpty. Operand 292 states and 342 transitions. [2025-04-29 11:25:47,252 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:25:47,252 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:47,252 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:47,252 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:25:47,252 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:47,252 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:47,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1096624675, now seen corresponding path program 1 times [2025-04-29 11:25:47,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:47,252 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138859272] [2025-04-29 11:25:47,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:47,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:47,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:25:47,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:25:47,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:47,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:47,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:47,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:47,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138859272] [2025-04-29 11:25:47,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138859272] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:47,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:47,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:25:47,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366561547] [2025-04-29 11:25:47,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:47,319 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:25:47,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:47,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:25:47,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:25:47,319 INFO L87 Difference]: Start difference. First operand 292 states and 342 transitions. Second operand has 5 states, 5 states have (on average 3.6) 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) [2025-04-29 11:25:47,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:47,384 INFO L93 Difference]: Finished difference Result 311 states and 346 transitions. [2025-04-29 11:25:47,384 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:25:47,384 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) 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 [2025-04-29 11:25:47,384 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:47,385 INFO L225 Difference]: With dead ends: 311 [2025-04-29 11:25:47,385 INFO L226 Difference]: Without dead ends: 311 [2025-04-29 11:25:47,385 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:25:47,386 INFO L437 NwaCegarLoop]: 257 mSDtfsCounter, 64 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:47,386 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 986 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:47,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-04-29 11:25:47,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 290. [2025-04-29 11:25:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 210 states have (on average 1.6047619047619048) internal successors, (337), 289 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:47,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 337 transitions. [2025-04-29 11:25:47,390 INFO L79 Accepts]: Start accepts. Automaton has 290 states and 337 transitions. Word has length 18 [2025-04-29 11:25:47,390 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:47,390 INFO L485 AbstractCegarLoop]: Abstraction has 290 states and 337 transitions. [2025-04-29 11:25:47,390 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) 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) [2025-04-29 11:25:47,390 INFO L278 IsEmpty]: Start isEmpty. Operand 290 states and 337 transitions. [2025-04-29 11:25:47,391 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:25:47,391 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:47,391 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:47,391 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:25:47,391 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:47,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:47,391 INFO L85 PathProgramCache]: Analyzing trace with hash -339892194, now seen corresponding path program 1 times [2025-04-29 11:25:47,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:47,392 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318534936] [2025-04-29 11:25:47,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:47,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:47,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:25:47,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:25:47,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:47,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:47,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:47,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:47,504 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318534936] [2025-04-29 11:25:47,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318534936] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:47,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:47,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:25:47,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102943697] [2025-04-29 11:25:47,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:47,504 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:25:47,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:47,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:25:47,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:25:47,504 INFO L87 Difference]: Start difference. First operand 290 states and 337 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 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) [2025-04-29 11:25:47,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:47,794 INFO L93 Difference]: Finished difference Result 312 states and 361 transitions. [2025-04-29 11:25:47,794 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:25:47,794 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 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 [2025-04-29 11:25:47,794 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:47,795 INFO L225 Difference]: With dead ends: 312 [2025-04-29 11:25:47,795 INFO L226 Difference]: Without dead ends: 312 [2025-04-29 11:25:47,795 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:25:47,795 INFO L437 NwaCegarLoop]: 228 mSDtfsCounter, 82 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:47,795 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 750 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:25:47,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-04-29 11:25:47,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 292. [2025-04-29 11:25:47,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 214 states have (on average 1.5981308411214954) internal successors, (342), 291 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:47,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 342 transitions. [2025-04-29 11:25:47,799 INFO L79 Accepts]: Start accepts. Automaton has 292 states and 342 transitions. Word has length 20 [2025-04-29 11:25:47,800 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:47,800 INFO L485 AbstractCegarLoop]: Abstraction has 292 states and 342 transitions. [2025-04-29 11:25:47,800 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 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) [2025-04-29 11:25:47,800 INFO L278 IsEmpty]: Start isEmpty. Operand 292 states and 342 transitions. [2025-04-29 11:25:47,800 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:25:47,800 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:47,800 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:47,800 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:25:47,800 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:47,801 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:47,801 INFO L85 PathProgramCache]: Analyzing trace with hash -339892193, now seen corresponding path program 1 times [2025-04-29 11:25:47,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:47,801 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483864399] [2025-04-29 11:25:47,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:47,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:47,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:25:47,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:25:47,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:47,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:47,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:47,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:47,915 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483864399] [2025-04-29 11:25:47,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483864399] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:47,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:47,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:25:47,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397814279] [2025-04-29 11:25:47,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:47,917 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:25:47,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:47,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:25:47,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:25:47,917 INFO L87 Difference]: Start difference. First operand 292 states and 342 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:48,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:48,156 INFO L93 Difference]: Finished difference Result 300 states and 350 transitions. [2025-04-29 11:25:48,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:25:48,157 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-29 11:25:48,157 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:48,157 INFO L225 Difference]: With dead ends: 300 [2025-04-29 11:25:48,157 INFO L226 Difference]: Without dead ends: 300 [2025-04-29 11:25:48,158 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:25:48,158 INFO L437 NwaCegarLoop]: 237 mSDtfsCounter, 64 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:48,159 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 655 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:25:48,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-04-29 11:25:48,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 291. [2025-04-29 11:25:48,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 214 states have (on average 1.5934579439252337) internal successors, (341), 290 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:48,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 341 transitions. [2025-04-29 11:25:48,163 INFO L79 Accepts]: Start accepts. Automaton has 291 states and 341 transitions. Word has length 20 [2025-04-29 11:25:48,163 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:48,163 INFO L485 AbstractCegarLoop]: Abstraction has 291 states and 341 transitions. [2025-04-29 11:25:48,163 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:48,163 INFO L278 IsEmpty]: Start isEmpty. Operand 291 states and 341 transitions. [2025-04-29 11:25:48,164 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 11:25:48,164 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:48,164 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] [2025-04-29 11:25:48,164 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:25:48,164 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr151ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:48,165 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:48,165 INFO L85 PathProgramCache]: Analyzing trace with hash -810008810, now seen corresponding path program 1 times [2025-04-29 11:25:48,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:48,165 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311147754] [2025-04-29 11:25:48,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:48,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:48,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:25:48,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:25:48,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:48,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:48,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:48,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:48,234 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311147754] [2025-04-29 11:25:48,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311147754] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:48,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:48,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:25:48,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537412794] [2025-04-29 11:25:48,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:48,235 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:25:48,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:48,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:25:48,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:25:48,236 INFO L87 Difference]: Start difference. First operand 291 states and 341 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:48,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:48,452 INFO L93 Difference]: Finished difference Result 305 states and 342 transitions. [2025-04-29 11:25:48,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:25:48,452 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-29 11:25:48,453 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:48,454 INFO L225 Difference]: With dead ends: 305 [2025-04-29 11:25:48,454 INFO L226 Difference]: Without dead ends: 303 [2025-04-29 11:25:48,454 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:25:48,454 INFO L437 NwaCegarLoop]: 228 mSDtfsCounter, 50 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:48,454 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 648 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:25:48,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-04-29 11:25:48,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 290. [2025-04-29 11:25:48,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 213 states have (on average 1.591549295774648) internal successors, (339), 289 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:48,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 339 transitions. [2025-04-29 11:25:48,458 INFO L79 Accepts]: Start accepts. Automaton has 290 states and 339 transitions. Word has length 23 [2025-04-29 11:25:48,458 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:48,458 INFO L485 AbstractCegarLoop]: Abstraction has 290 states and 339 transitions. [2025-04-29 11:25:48,458 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:48,459 INFO L278 IsEmpty]: Start isEmpty. Operand 290 states and 339 transitions. [2025-04-29 11:25:48,459 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 11:25:48,459 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:48,459 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] [2025-04-29 11:25:48,459 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:25:48,459 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:48,459 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:48,460 INFO L85 PathProgramCache]: Analyzing trace with hash -810047598, now seen corresponding path program 1 times [2025-04-29 11:25:48,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:48,460 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154785788] [2025-04-29 11:25:48,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:48,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:48,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:25:48,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:25:48,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:48,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:48,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:48,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:48,582 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154785788] [2025-04-29 11:25:48,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154785788] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:48,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:48,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:25:48,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243893732] [2025-04-29 11:25:48,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:48,583 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:25:48,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:48,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:25:48,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:25:48,583 INFO L87 Difference]: Start difference. First operand 290 states and 339 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:48,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:48,711 INFO L93 Difference]: Finished difference Result 307 states and 343 transitions. [2025-04-29 11:25:48,711 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:25:48,711 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-29 11:25:48,712 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:48,712 INFO L225 Difference]: With dead ends: 307 [2025-04-29 11:25:48,713 INFO L226 Difference]: Without dead ends: 307 [2025-04-29 11:25:48,713 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:25:48,713 INFO L437 NwaCegarLoop]: 248 mSDtfsCounter, 77 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:48,713 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1454 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:48,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-04-29 11:25:48,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 276. [2025-04-29 11:25:48,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 199 states have (on average 1.5879396984924623) internal successors, (316), 275 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:48,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 316 transitions. [2025-04-29 11:25:48,717 INFO L79 Accepts]: Start accepts. Automaton has 276 states and 316 transitions. Word has length 23 [2025-04-29 11:25:48,717 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:48,717 INFO L485 AbstractCegarLoop]: Abstraction has 276 states and 316 transitions. [2025-04-29 11:25:48,717 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:48,717 INFO L278 IsEmpty]: Start isEmpty. Operand 276 states and 316 transitions. [2025-04-29 11:25:48,718 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 11:25:48,718 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:48,718 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] [2025-04-29 11:25:48,718 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:25:48,718 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:48,718 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:48,718 INFO L85 PathProgramCache]: Analyzing trace with hash 2081482914, now seen corresponding path program 1 times [2025-04-29 11:25:48,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:48,719 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9199368] [2025-04-29 11:25:48,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:48,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:48,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:25:48,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:25:48,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:48,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:48,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:48,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:48,769 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9199368] [2025-04-29 11:25:48,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9199368] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:48,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:48,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:25:48,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925272699] [2025-04-29 11:25:48,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:48,769 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:25:48,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:48,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:25:48,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:25:48,770 INFO L87 Difference]: Start difference. First operand 276 states and 316 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:48,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:48,816 INFO L93 Difference]: Finished difference Result 285 states and 324 transitions. [2025-04-29 11:25:48,816 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:25:48,816 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-29 11:25:48,817 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:48,817 INFO L225 Difference]: With dead ends: 285 [2025-04-29 11:25:48,818 INFO L226 Difference]: Without dead ends: 285 [2025-04-29 11:25:48,818 INFO L436 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 [2025-04-29 11:25:48,819 INFO L437 NwaCegarLoop]: 268 mSDtfsCounter, 67 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:48,819 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 986 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:25:48,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-04-29 11:25:48,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 276. [2025-04-29 11:25:48,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 199 states have (on average 1.5829145728643217) internal successors, (315), 275 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:48,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 315 transitions. [2025-04-29 11:25:48,823 INFO L79 Accepts]: Start accepts. Automaton has 276 states and 315 transitions. Word has length 25 [2025-04-29 11:25:48,823 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:48,823 INFO L485 AbstractCegarLoop]: Abstraction has 276 states and 315 transitions. [2025-04-29 11:25:48,823 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:48,823 INFO L278 IsEmpty]: Start isEmpty. Operand 276 states and 315 transitions. [2025-04-29 11:25:48,823 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:25:48,823 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:48,823 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] [2025-04-29 11:25:48,824 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:25:48,824 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr124REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:48,824 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:48,824 INFO L85 PathProgramCache]: Analyzing trace with hash 848081351, now seen corresponding path program 1 times [2025-04-29 11:25:48,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:48,824 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010547246] [2025-04-29 11:25:48,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:48,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:48,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:25:48,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:25:48,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:48,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:48,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:48,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:48,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010547246] [2025-04-29 11:25:48,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010547246] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:48,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:48,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:25:48,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475819917] [2025-04-29 11:25:48,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:48,867 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:25:48,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:48,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:25:48,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:25:48,868 INFO L87 Difference]: Start difference. First operand 276 states and 315 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) [2025-04-29 11:25:48,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:48,876 INFO L93 Difference]: Finished difference Result 261 states and 290 transitions. [2025-04-29 11:25:48,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:25:48,876 INFO L79 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 [2025-04-29 11:25:48,876 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:48,877 INFO L225 Difference]: With dead ends: 261 [2025-04-29 11:25:48,877 INFO L226 Difference]: Without dead ends: 244 [2025-04-29 11:25:48,877 INFO L436 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 [2025-04-29 11:25:48,878 INFO L437 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:48,878 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 513 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:25:48,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-04-29 11:25:48,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2025-04-29 11:25:48,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 167 states have (on average 1.6347305389221556) internal successors, (273), 243 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 273 transitions. [2025-04-29 11:25:48,885 INFO L79 Accepts]: Start accepts. Automaton has 244 states and 273 transitions. Word has length 26 [2025-04-29 11:25:48,885 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:48,885 INFO L485 AbstractCegarLoop]: Abstraction has 244 states and 273 transitions. [2025-04-29 11:25:48,885 INFO L486 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) [2025-04-29 11:25:48,885 INFO L278 IsEmpty]: Start isEmpty. Operand 244 states and 273 transitions. [2025-04-29 11:25:48,885 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 11:25:48,885 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:48,885 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] [2025-04-29 11:25:48,885 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-29 11:25:48,886 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:48,886 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:48,886 INFO L85 PathProgramCache]: Analyzing trace with hash -234471107, now seen corresponding path program 1 times [2025-04-29 11:25:48,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:48,886 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572277886] [2025-04-29 11:25:48,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:48,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:48,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:25:48,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:25:48,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:48,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:49,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:49,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:49,196 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572277886] [2025-04-29 11:25:49,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572277886] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:49,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:49,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-29 11:25:49,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426689326] [2025-04-29 11:25:49,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:49,197 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:25:49,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:49,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:25:49,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:25:49,198 INFO L87 Difference]: Start difference. First operand 244 states and 273 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:49,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:49,754 INFO L93 Difference]: Finished difference Result 247 states and 276 transitions. [2025-04-29 11:25:49,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:25:49,754 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-29 11:25:49,755 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:49,755 INFO L225 Difference]: With dead ends: 247 [2025-04-29 11:25:49,756 INFO L226 Difference]: Without dead ends: 247 [2025-04-29 11:25:49,756 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-04-29 11:25:49,756 INFO L437 NwaCegarLoop]: 219 mSDtfsCounter, 78 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:49,757 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1372 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-29 11:25:49,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-04-29 11:25:49,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 243. [2025-04-29 11:25:49,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 167 states have (on average 1.6287425149700598) internal successors, (272), 242 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:49,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 272 transitions. [2025-04-29 11:25:49,761 INFO L79 Accepts]: Start accepts. Automaton has 243 states and 272 transitions. Word has length 27 [2025-04-29 11:25:49,761 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:49,761 INFO L485 AbstractCegarLoop]: Abstraction has 243 states and 272 transitions. [2025-04-29 11:25:49,761 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:49,761 INFO L278 IsEmpty]: Start isEmpty. Operand 243 states and 272 transitions. [2025-04-29 11:25:49,761 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 11:25:49,762 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:49,762 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] [2025-04-29 11:25:49,762 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-29 11:25:49,762 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:49,762 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:49,762 INFO L85 PathProgramCache]: Analyzing trace with hash -234471106, now seen corresponding path program 1 times [2025-04-29 11:25:49,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:49,762 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925596550] [2025-04-29 11:25:49,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:49,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:49,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:25:49,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:25:49,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:49,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:50,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:50,162 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925596550] [2025-04-29 11:25:50,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925596550] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:50,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:50,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-29 11:25:50,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788071326] [2025-04-29 11:25:50,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:50,162 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:25:50,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:50,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:25:50,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:25:50,163 INFO L87 Difference]: Start difference. First operand 243 states and 272 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:50,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:50,791 INFO L93 Difference]: Finished difference Result 246 states and 275 transitions. [2025-04-29 11:25:50,792 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:25:50,793 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-29 11:25:50,793 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:50,793 INFO L225 Difference]: With dead ends: 246 [2025-04-29 11:25:50,793 INFO L226 Difference]: Without dead ends: 246 [2025-04-29 11:25:50,794 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:25:50,795 INFO L437 NwaCegarLoop]: 219 mSDtfsCounter, 78 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:50,795 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1413 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-29 11:25:50,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-04-29 11:25:50,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 242. [2025-04-29 11:25:50,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 167 states have (on average 1.622754491017964) internal successors, (271), 241 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:50,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 271 transitions. [2025-04-29 11:25:50,798 INFO L79 Accepts]: Start accepts. Automaton has 242 states and 271 transitions. Word has length 27 [2025-04-29 11:25:50,798 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:50,798 INFO L485 AbstractCegarLoop]: Abstraction has 242 states and 271 transitions. [2025-04-29 11:25:50,798 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:50,798 INFO L278 IsEmpty]: Start isEmpty. Operand 242 states and 271 transitions. [2025-04-29 11:25:50,798 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:25:50,798 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:50,799 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] [2025-04-29 11:25:50,799 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 11:25:50,799 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:50,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:50,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1322501166, now seen corresponding path program 1 times [2025-04-29 11:25:50,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:50,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021953870] [2025-04-29 11:25:50,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:50,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:50,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:25:50,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:25:50,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:50,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:50,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:50,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:50,932 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021953870] [2025-04-29 11:25:50,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021953870] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:50,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:50,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:25:50,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440023054] [2025-04-29 11:25:50,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:50,933 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:25:50,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:50,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:25:50,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:25:50,934 INFO L87 Difference]: Start difference. First operand 242 states and 271 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) [2025-04-29 11:25:51,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:51,036 INFO L93 Difference]: Finished difference Result 260 states and 291 transitions. [2025-04-29 11:25:51,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:25:51,036 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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 [2025-04-29 11:25:51,037 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:51,037 INFO L225 Difference]: With dead ends: 260 [2025-04-29 11:25:51,037 INFO L226 Difference]: Without dead ends: 260 [2025-04-29 11:25:51,037 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:25:51,038 INFO L437 NwaCegarLoop]: 237 mSDtfsCounter, 111 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:51,038 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1577 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:51,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-04-29 11:25:51,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 242. [2025-04-29 11:25:51,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 167 states have (on average 1.6167664670658684) internal successors, (270), 241 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:51,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 270 transitions. [2025-04-29 11:25:51,053 INFO L79 Accepts]: Start accepts. Automaton has 242 states and 270 transitions. Word has length 28 [2025-04-29 11:25:51,053 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:51,053 INFO L485 AbstractCegarLoop]: Abstraction has 242 states and 270 transitions. [2025-04-29 11:25:51,054 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) [2025-04-29 11:25:51,054 INFO L278 IsEmpty]: Start isEmpty. Operand 242 states and 270 transitions. [2025-04-29 11:25:51,054 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-29 11:25:51,054 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:51,054 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] [2025-04-29 11:25:51,054 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-29 11:25:51,054 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:51,054 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:51,055 INFO L85 PathProgramCache]: Analyzing trace with hash 376377735, now seen corresponding path program 1 times [2025-04-29 11:25:51,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:51,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586792058] [2025-04-29 11:25:51,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:51,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:51,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:25:51,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:25:51,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:51,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:51,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:25:51,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:51,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586792058] [2025-04-29 11:25:51,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586792058] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:51,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:51,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:25:51,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10167805] [2025-04-29 11:25:51,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:51,164 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:25:51,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:51,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:25:51,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:25:51,165 INFO L87 Difference]: Start difference. First operand 242 states and 270 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 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) [2025-04-29 11:25:51,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:51,323 INFO L93 Difference]: Finished difference Result 259 states and 290 transitions. [2025-04-29 11:25:51,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:25:51,324 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 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 31 [2025-04-29 11:25:51,324 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:51,325 INFO L225 Difference]: With dead ends: 259 [2025-04-29 11:25:51,325 INFO L226 Difference]: Without dead ends: 259 [2025-04-29 11:25:51,325 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:25:51,325 INFO L437 NwaCegarLoop]: 236 mSDtfsCounter, 21 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:51,325 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 727 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:51,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-04-29 11:25:51,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 241. [2025-04-29 11:25:51,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 167 states have (on average 1.6107784431137724) internal successors, (269), 240 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:51,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 269 transitions. [2025-04-29 11:25:51,329 INFO L79 Accepts]: Start accepts. Automaton has 241 states and 269 transitions. Word has length 31 [2025-04-29 11:25:51,329 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:51,329 INFO L485 AbstractCegarLoop]: Abstraction has 241 states and 269 transitions. [2025-04-29 11:25:51,329 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 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) [2025-04-29 11:25:51,329 INFO L278 IsEmpty]: Start isEmpty. Operand 241 states and 269 transitions. [2025-04-29 11:25:51,329 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-29 11:25:51,329 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:51,329 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] [2025-04-29 11:25:51,329 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-29 11:25:51,329 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:51,330 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:51,330 INFO L85 PathProgramCache]: Analyzing trace with hash 376377736, now seen corresponding path program 1 times [2025-04-29 11:25:51,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:51,330 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719462543] [2025-04-29 11:25:51,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:51,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:51,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:25:51,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:25:51,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:51,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:51,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:51,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:51,621 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719462543] [2025-04-29 11:25:51,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719462543] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:51,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:51,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:25:51,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349687862] [2025-04-29 11:25:51,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:51,621 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:25:51,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:51,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:25:51,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:25:51,622 INFO L87 Difference]: Start difference. First operand 241 states and 269 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 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) [2025-04-29 11:25:52,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:52,124 INFO L93 Difference]: Finished difference Result 267 states and 298 transitions. [2025-04-29 11:25:52,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:25:52,124 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 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 [2025-04-29 11:25:52,124 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:52,125 INFO L225 Difference]: With dead ends: 267 [2025-04-29 11:25:52,125 INFO L226 Difference]: Without dead ends: 267 [2025-04-29 11:25:52,125 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:25:52,125 INFO L437 NwaCegarLoop]: 222 mSDtfsCounter, 100 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:52,125 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1103 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:25:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-04-29 11:25:52,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 240. [2025-04-29 11:25:52,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 167 states have (on average 1.6047904191616766) internal successors, (268), 239 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:52,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 268 transitions. [2025-04-29 11:25:52,129 INFO L79 Accepts]: Start accepts. Automaton has 240 states and 268 transitions. Word has length 31 [2025-04-29 11:25:52,129 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:52,129 INFO L485 AbstractCegarLoop]: Abstraction has 240 states and 268 transitions. [2025-04-29 11:25:52,129 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 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) [2025-04-29 11:25:52,129 INFO L278 IsEmpty]: Start isEmpty. Operand 240 states and 268 transitions. [2025-04-29 11:25:52,129 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 11:25:52,129 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:52,129 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] [2025-04-29 11:25:52,129 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-29 11:25:52,129 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:52,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:52,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1521229837, now seen corresponding path program 1 times [2025-04-29 11:25:52,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:52,130 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544763392] [2025-04-29 11:25:52,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:52,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:52,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:25:52,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:25:52,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:52,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:52,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:52,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544763392] [2025-04-29 11:25:52,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544763392] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:52,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:52,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-29 11:25:52,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035991188] [2025-04-29 11:25:52,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:52,303 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:25:52,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:52,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:25:52,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:25:52,304 INFO L87 Difference]: Start difference. First operand 240 states and 268 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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) [2025-04-29 11:25:52,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:52,520 INFO L93 Difference]: Finished difference Result 244 states and 272 transitions. [2025-04-29 11:25:52,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:25:52,521 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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 [2025-04-29 11:25:52,521 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:52,521 INFO L225 Difference]: With dead ends: 244 [2025-04-29 11:25:52,521 INFO L226 Difference]: Without dead ends: 244 [2025-04-29 11:25:52,522 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-04-29 11:25:52,522 INFO L437 NwaCegarLoop]: 234 mSDtfsCounter, 70 mSDsluCounter, 1951 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 2185 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:52,522 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 2185 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:25:52,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-04-29 11:25:52,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2025-04-29 11:25:52,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 168 states have (on average 1.6011904761904763) internal successors, (269), 240 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 269 transitions. [2025-04-29 11:25:52,526 INFO L79 Accepts]: Start accepts. Automaton has 241 states and 269 transitions. Word has length 34 [2025-04-29 11:25:52,526 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:52,526 INFO L485 AbstractCegarLoop]: Abstraction has 241 states and 269 transitions. [2025-04-29 11:25:52,526 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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) [2025-04-29 11:25:52,526 INFO L278 IsEmpty]: Start isEmpty. Operand 241 states and 269 transitions. [2025-04-29 11:25:52,527 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 11:25:52,527 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:52,527 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] [2025-04-29 11:25:52,527 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-29 11:25:52,527 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:52,527 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:52,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1040791695, now seen corresponding path program 1 times [2025-04-29 11:25:52,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:52,528 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454399506] [2025-04-29 11:25:52,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:52,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:52,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:25:52,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:25:52,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:52,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:52,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:52,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:52,976 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454399506] [2025-04-29 11:25:52,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454399506] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:52,976 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637820161] [2025-04-29 11:25:52,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:52,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:52,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:52,978 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:25:52,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:25:53,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:25:53,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:25:53,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:53,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:53,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-29 11:25:53,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:53,144 INFO L354 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 [2025-04-29 11:25:53,149 INFO L354 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 [2025-04-29 11:25:53,212 INFO L354 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 [2025-04-29 11:25:53,216 INFO L354 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 [2025-04-29 11:25:53,250 INFO L354 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 54 treesize of output 34 [2025-04-29 11:25:53,252 INFO L354 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 54 treesize of output 34 [2025-04-29 11:25:53,281 INFO L354 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 54 treesize of output 34 [2025-04-29 11:25:53,284 INFO L354 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 54 treesize of output 34 [2025-04-29 11:25:53,300 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-04-29 11:25:53,302 INFO L354 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 34 treesize of output 22 [2025-04-29 11:25:53,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:53,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:25:53,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:53,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637820161] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:25:53,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:25:53,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 17 [2025-04-29 11:25:53,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274158178] [2025-04-29 11:25:53,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:25:53,421 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 11:25:53,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:53,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 11:25:53,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:25:53,422 INFO L87 Difference]: Start difference. First operand 241 states and 269 transitions. Second operand has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:53,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:53,825 INFO L93 Difference]: Finished difference Result 321 states and 358 transitions. [2025-04-29 11:25:53,825 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:25:53,826 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-29 11:25:53,826 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:53,826 INFO L225 Difference]: With dead ends: 321 [2025-04-29 11:25:53,826 INFO L226 Difference]: Without dead ends: 321 [2025-04-29 11:25:53,827 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:25:53,827 INFO L437 NwaCegarLoop]: 232 mSDtfsCounter, 180 mSDsluCounter, 2122 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 2354 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:53,827 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 2354 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:25:53,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-04-29 11:25:53,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 270. [2025-04-29 11:25:53,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 197 states have (on average 1.5228426395939085) internal successors, (300), 269 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:53,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 300 transitions. [2025-04-29 11:25:53,831 INFO L79 Accepts]: Start accepts. Automaton has 270 states and 300 transitions. Word has length 35 [2025-04-29 11:25:53,831 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:53,831 INFO L485 AbstractCegarLoop]: Abstraction has 270 states and 300 transitions. [2025-04-29 11:25:53,831 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:53,831 INFO L278 IsEmpty]: Start isEmpty. Operand 270 states and 300 transitions. [2025-04-29 11:25:53,832 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 11:25:53,832 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:53,832 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] [2025-04-29 11:25:53,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:25:54,036 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-29 11:25:54,036 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:54,036 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:54,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1111316369, now seen corresponding path program 1 times [2025-04-29 11:25:54,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:54,036 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47554782] [2025-04-29 11:25:54,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:54,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:54,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:25:54,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:25:54,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:54,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:54,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:54,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:54,522 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47554782] [2025-04-29 11:25:54,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47554782] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:54,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:54,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-29 11:25:54,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905138533] [2025-04-29 11:25:54,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:54,522 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:25:54,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:54,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:25:54,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:25:54,523 INFO L87 Difference]: Start difference. First operand 270 states and 300 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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) [2025-04-29 11:25:54,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:54,936 INFO L93 Difference]: Finished difference Result 270 states and 298 transitions. [2025-04-29 11:25:54,936 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:25:54,936 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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 [2025-04-29 11:25:54,936 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:54,937 INFO L225 Difference]: With dead ends: 270 [2025-04-29 11:25:54,937 INFO L226 Difference]: Without dead ends: 270 [2025-04-29 11:25:54,937 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:25:54,938 INFO L437 NwaCegarLoop]: 232 mSDtfsCounter, 71 mSDsluCounter, 1863 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:54,938 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2095 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:25:54,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-04-29 11:25:54,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2025-04-29 11:25:54,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 197 states have (on average 1.5126903553299493) internal successors, (298), 269 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:54,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 298 transitions. [2025-04-29 11:25:54,941 INFO L79 Accepts]: Start accepts. Automaton has 270 states and 298 transitions. Word has length 36 [2025-04-29 11:25:54,941 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:54,941 INFO L485 AbstractCegarLoop]: Abstraction has 270 states and 298 transitions. [2025-04-29 11:25:54,941 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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) [2025-04-29 11:25:54,941 INFO L278 IsEmpty]: Start isEmpty. Operand 270 states and 298 transitions. [2025-04-29 11:25:54,941 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-29 11:25:54,941 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:54,941 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] [2025-04-29 11:25:54,941 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-29 11:25:54,941 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:54,941 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:54,941 INFO L85 PathProgramCache]: Analyzing trace with hash -730998308, now seen corresponding path program 1 times [2025-04-29 11:25:54,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:54,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640863201] [2025-04-29 11:25:54,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:54,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:54,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:25:54,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:25:54,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:54,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:55,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:25:55,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:55,037 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640863201] [2025-04-29 11:25:55,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640863201] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:55,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:55,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:25:55,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10625170] [2025-04-29 11:25:55,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:55,037 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:25:55,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:55,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:25:55,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:25:55,038 INFO L87 Difference]: Start difference. First operand 270 states and 298 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:55,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:55,080 INFO L93 Difference]: Finished difference Result 276 states and 304 transitions. [2025-04-29 11:25:55,080 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:25:55,080 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-29 11:25:55,080 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:55,081 INFO L225 Difference]: With dead ends: 276 [2025-04-29 11:25:55,081 INFO L226 Difference]: Without dead ends: 276 [2025-04-29 11:25:55,081 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:25:55,081 INFO L437 NwaCegarLoop]: 250 mSDtfsCounter, 2 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:55,081 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 964 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:25:55,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-04-29 11:25:55,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 275. [2025-04-29 11:25:55,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 202 states have (on average 1.5) internal successors, (303), 274 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:55,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 303 transitions. [2025-04-29 11:25:55,084 INFO L79 Accepts]: Start accepts. Automaton has 275 states and 303 transitions. Word has length 41 [2025-04-29 11:25:55,084 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:55,084 INFO L485 AbstractCegarLoop]: Abstraction has 275 states and 303 transitions. [2025-04-29 11:25:55,084 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:55,084 INFO L278 IsEmpty]: Start isEmpty. Operand 275 states and 303 transitions. [2025-04-29 11:25:55,084 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-29 11:25:55,084 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:55,084 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] [2025-04-29 11:25:55,084 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-29 11:25:55,084 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:55,085 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:55,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1186602459, now seen corresponding path program 1 times [2025-04-29 11:25:55,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:55,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342606376] [2025-04-29 11:25:55,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:55,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:55,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:25:55,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:25:55,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:55,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:55,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:25:55,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:55,187 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342606376] [2025-04-29 11:25:55,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342606376] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:55,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:55,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:25:55,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031366934] [2025-04-29 11:25:55,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:55,188 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:25:55,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:55,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:25:55,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:25:55,188 INFO L87 Difference]: Start difference. First operand 275 states and 303 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:55,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:55,525 INFO L93 Difference]: Finished difference Result 344 states and 383 transitions. [2025-04-29 11:25:55,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:25:55,525 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 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 [2025-04-29 11:25:55,525 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:55,526 INFO L225 Difference]: With dead ends: 344 [2025-04-29 11:25:55,526 INFO L226 Difference]: Without dead ends: 344 [2025-04-29 11:25:55,526 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:25:55,527 INFO L437 NwaCegarLoop]: 142 mSDtfsCounter, 215 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:55,527 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 621 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:25:55,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-04-29 11:25:55,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 278. [2025-04-29 11:25:55,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 207 states have (on average 1.497584541062802) internal successors, (310), 277 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:55,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 310 transitions. [2025-04-29 11:25:55,530 INFO L79 Accepts]: Start accepts. Automaton has 278 states and 310 transitions. Word has length 42 [2025-04-29 11:25:55,531 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:55,531 INFO L485 AbstractCegarLoop]: Abstraction has 278 states and 310 transitions. [2025-04-29 11:25:55,531 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:55,531 INFO L278 IsEmpty]: Start isEmpty. Operand 278 states and 310 transitions. [2025-04-29 11:25:55,531 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-29 11:25:55,531 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:55,531 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] [2025-04-29 11:25:55,531 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-29 11:25:55,531 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:55,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:55,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1186602458, now seen corresponding path program 1 times [2025-04-29 11:25:55,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:55,532 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696578416] [2025-04-29 11:25:55,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:55,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:55,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:25:55,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:25:55,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:55,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:55,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:25:55,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:55,763 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696578416] [2025-04-29 11:25:55,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696578416] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:55,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:55,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:25:55,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767457968] [2025-04-29 11:25:55,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:55,763 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:25:55,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:55,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:25:55,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:25:55,764 INFO L87 Difference]: Start difference. First operand 278 states and 310 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:56,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:56,140 INFO L93 Difference]: Finished difference Result 362 states and 407 transitions. [2025-04-29 11:25:56,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:25:56,141 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 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 [2025-04-29 11:25:56,141 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:56,142 INFO L225 Difference]: With dead ends: 362 [2025-04-29 11:25:56,142 INFO L226 Difference]: Without dead ends: 362 [2025-04-29 11:25:56,142 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:25:56,142 INFO L437 NwaCegarLoop]: 173 mSDtfsCounter, 131 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:56,143 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1051 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:25:56,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-04-29 11:25:56,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 341. [2025-04-29 11:25:56,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 270 states have (on average 1.5037037037037038) internal successors, (406), 340 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:56,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 406 transitions. [2025-04-29 11:25:56,147 INFO L79 Accepts]: Start accepts. Automaton has 341 states and 406 transitions. Word has length 42 [2025-04-29 11:25:56,147 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:56,147 INFO L485 AbstractCegarLoop]: Abstraction has 341 states and 406 transitions. [2025-04-29 11:25:56,147 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:56,147 INFO L278 IsEmpty]: Start isEmpty. Operand 341 states and 406 transitions. [2025-04-29 11:25:56,147 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-29 11:25:56,147 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:56,147 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:56,147 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-29 11:25:56,147 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:56,148 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:56,148 INFO L85 PathProgramCache]: Analyzing trace with hash 216809900, now seen corresponding path program 1 times [2025-04-29 11:25:56,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:56,148 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941430758] [2025-04-29 11:25:56,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:56,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:56,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:25:56,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:25:56,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:56,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:56,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:25:56,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:56,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941430758] [2025-04-29 11:25:56,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941430758] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:56,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:56,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:25:56,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412736418] [2025-04-29 11:25:56,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:56,228 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:25:56,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:56,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:25:56,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:25:56,229 INFO L87 Difference]: Start difference. First operand 341 states and 406 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:56,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:56,373 INFO L93 Difference]: Finished difference Result 421 states and 475 transitions. [2025-04-29 11:25:56,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:25:56,373 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2025-04-29 11:25:56,373 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:56,374 INFO L225 Difference]: With dead ends: 421 [2025-04-29 11:25:56,374 INFO L226 Difference]: Without dead ends: 421 [2025-04-29 11:25:56,375 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:25:56,375 INFO L437 NwaCegarLoop]: 221 mSDtfsCounter, 243 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:56,375 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1414 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:56,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-04-29 11:25:56,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 340. [2025-04-29 11:25:56,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 269 states have (on average 1.4944237918215613) internal successors, (402), 339 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:56,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 402 transitions. [2025-04-29 11:25:56,380 INFO L79 Accepts]: Start accepts. Automaton has 340 states and 402 transitions. Word has length 46 [2025-04-29 11:25:56,380 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:56,380 INFO L485 AbstractCegarLoop]: Abstraction has 340 states and 402 transitions. [2025-04-29 11:25:56,380 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:56,380 INFO L278 IsEmpty]: Start isEmpty. Operand 340 states and 402 transitions. [2025-04-29 11:25:56,381 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-29 11:25:56,381 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:56,381 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:56,381 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-29 11:25:56,381 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:25:56,381 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:56,381 INFO L85 PathProgramCache]: Analyzing trace with hash -613101604, now seen corresponding path program 2 times [2025-04-29 11:25:56,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:56,381 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195992215] [2025-04-29 11:25:56,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:25:56,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:56,402 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-29 11:25:56,419 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:25:56,420 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:25:56,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:57,390 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:57,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:57,390 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195992215] [2025-04-29 11:25:57,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195992215] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:57,390 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560807961] [2025-04-29 11:25:57,390 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:25:57,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:57,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:57,392 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:25:57,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:25:57,490 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-29 11:25:57,533 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:25:57,533 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:25:57,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:57,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-29 11:25:57,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:57,549 INFO L354 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 [2025-04-29 11:25:57,623 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:25:57,624 INFO L354 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 [2025-04-29 11:25:57,659 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:25:57,659 INFO L354 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 [2025-04-29 11:25:57,715 INFO L354 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 [2025-04-29 11:25:57,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:25:57,804 INFO L354 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 [2025-04-29 11:25:57,843 INFO L354 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 [2025-04-29 11:25:57,847 INFO L354 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 [2025-04-29 11:25:57,902 INFO L354 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 [2025-04-29 11:25:57,907 INFO L354 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 62 treesize of output 34 [2025-04-29 11:25:57,961 INFO L354 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 [2025-04-29 11:25:57,965 INFO L354 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 62 treesize of output 34 [2025-04-29 11:25:57,988 INFO L354 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 7 treesize of output 3 [2025-04-29 11:25:58,034 INFO L354 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 54 treesize of output 22 [2025-04-29 11:25:58,074 INFO L354 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 28 treesize of output 8 [2025-04-29 11:25:58,115 INFO L354 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 26 treesize of output 14 [2025-04-29 11:25:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:58,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:26:00,583 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:00,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560807961] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:26:00,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:26:00,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 13] total 39 [2025-04-29 11:26:00,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193798987] [2025-04-29 11:26:00,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:26:00,584 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-29 11:26:00,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:00,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-29 11:26:00,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1447, Unknown=1, NotChecked=0, Total=1560 [2025-04-29 11:26:00,585 INFO L87 Difference]: Start difference. First operand 340 states and 402 transitions. Second operand has 40 states, 39 states have (on average 3.0256410256410255) internal successors, (118), 40 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:02,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:02,583 INFO L93 Difference]: Finished difference Result 381 states and 450 transitions. [2025-04-29 11:26:02,583 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:26:02,583 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 3.0256410256410255) internal successors, (118), 40 states have internal predecessors, (118), 0 states have call successors, (0), 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 47 [2025-04-29 11:26:02,583 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:02,584 INFO L225 Difference]: With dead ends: 381 [2025-04-29 11:26:02,584 INFO L226 Difference]: Without dead ends: 381 [2025-04-29 11:26:02,585 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=300, Invalid=2249, Unknown=1, NotChecked=0, Total=2550 [2025-04-29 11:26:02,585 INFO L437 NwaCegarLoop]: 225 mSDtfsCounter, 540 mSDsluCounter, 3393 mSDsCounter, 0 mSdLazyCounter, 3576 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 3618 SdHoareTripleChecker+Invalid, 3607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:02,585 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 3618 Invalid, 3607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3576 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-29 11:26:02,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-04-29 11:26:02,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 339. [2025-04-29 11:26:02,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 269 states have (on average 1.4907063197026023) internal successors, (401), 338 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:02,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 401 transitions. [2025-04-29 11:26:02,588 INFO L79 Accepts]: Start accepts. Automaton has 339 states and 401 transitions. Word has length 47 [2025-04-29 11:26:02,588 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:02,588 INFO L485 AbstractCegarLoop]: Abstraction has 339 states and 401 transitions. [2025-04-29 11:26:02,589 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.0256410256410255) internal successors, (118), 40 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:02,589 INFO L278 IsEmpty]: Start isEmpty. Operand 339 states and 401 transitions. [2025-04-29 11:26:02,589 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-29 11:26:02,589 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:02,589 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:02,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:26:02,793 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-04-29 11:26:02,793 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:26:02,793 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:02,793 INFO L85 PathProgramCache]: Analyzing trace with hash -613101603, now seen corresponding path program 1 times [2025-04-29 11:26:02,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:02,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513406644] [2025-04-29 11:26:02,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:02,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:02,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-29 11:26:02,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:26:02,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:02,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:03,614 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:03,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:03,614 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513406644] [2025-04-29 11:26:03,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513406644] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:26:03,614 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900626684] [2025-04-29 11:26:03,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:03,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:26:03,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:26:03,616 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:26:03,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:26:03,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-29 11:26:03,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:26:03,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:03,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:03,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-04-29 11:26:03,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:26:03,767 INFO L354 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 [2025-04-29 11:26:03,774 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 11:26:03,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:26:03,843 INFO L354 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 14 treesize of output 9 [2025-04-29 11:26:03,860 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:26:03,861 INFO L354 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 [2025-04-29 11:26:03,968 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:26:03,969 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-29 11:26:03,986 INFO L325 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-04-29 11:26:03,987 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-04-29 11:26:04,029 INFO L354 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 [2025-04-29 11:26:04,033 INFO L354 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 [2025-04-29 11:26:04,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:26:04,130 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-04-29 11:26:04,170 INFO L354 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 [2025-04-29 11:26:04,173 INFO L354 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 [2025-04-29 11:26:04,231 INFO L354 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 97 treesize of output 65 [2025-04-29 11:26:04,234 INFO L354 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 97 treesize of output 69 [2025-04-29 11:26:04,292 INFO L354 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 97 treesize of output 65 [2025-04-29 11:26:04,295 INFO L354 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 97 treesize of output 69 [2025-04-29 11:26:04,355 INFO L354 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 78 treesize of output 22 [2025-04-29 11:26:04,362 INFO L354 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 17 treesize of output 3 [2025-04-29 11:26:04,397 INFO L354 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 28 treesize of output 8 [2025-04-29 11:26:04,401 INFO L354 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 [2025-04-29 11:26:04,432 INFO L354 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 26 treesize of output 14 [2025-04-29 11:26:04,434 INFO L354 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 7 treesize of output 3 [2025-04-29 11:26:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:04,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:26:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:09,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900626684] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:26:09,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:26:09,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 40 [2025-04-29 11:26:09,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222308866] [2025-04-29 11:26:09,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:26:09,450 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-29 11:26:09,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:09,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-29 11:26:09,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1529, Unknown=1, NotChecked=0, Total=1640 [2025-04-29 11:26:09,451 INFO L87 Difference]: Start difference. First operand 339 states and 401 transitions. Second operand has 41 states, 40 states have (on average 3.2) internal successors, (128), 41 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:11,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:11,981 INFO L93 Difference]: Finished difference Result 364 states and 429 transitions. [2025-04-29 11:26:11,981 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 11:26:11,981 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.2) internal successors, (128), 41 states have internal predecessors, (128), 0 states have call successors, (0), 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 47 [2025-04-29 11:26:11,981 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:11,982 INFO L225 Difference]: With dead ends: 364 [2025-04-29 11:26:11,982 INFO L226 Difference]: Without dead ends: 364 [2025-04-29 11:26:11,983 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=420, Invalid=3119, Unknown=1, NotChecked=0, Total=3540 [2025-04-29 11:26:11,983 INFO L437 NwaCegarLoop]: 226 mSDtfsCounter, 523 mSDsluCounter, 3669 mSDsCounter, 0 mSdLazyCounter, 3928 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 3895 SdHoareTripleChecker+Invalid, 3949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:11,983 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 3895 Invalid, 3949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3928 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-29 11:26:11,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-04-29 11:26:11,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 338. [2025-04-29 11:26:11,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 269 states have (on average 1.486988847583643) internal successors, (400), 337 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 400 transitions. [2025-04-29 11:26:11,988 INFO L79 Accepts]: Start accepts. Automaton has 338 states and 400 transitions. Word has length 47 [2025-04-29 11:26:11,988 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:11,988 INFO L485 AbstractCegarLoop]: Abstraction has 338 states and 400 transitions. [2025-04-29 11:26:11,988 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.2) internal successors, (128), 41 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:11,988 INFO L278 IsEmpty]: Start isEmpty. Operand 338 states and 400 transitions. [2025-04-29 11:26:11,989 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-29 11:26:11,989 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:11,989 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:11,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:26:12,189 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:26:12,190 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:26:12,190 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:12,190 INFO L85 PathProgramCache]: Analyzing trace with hash -591108945, now seen corresponding path program 1 times [2025-04-29 11:26:12,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:12,190 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023911804] [2025-04-29 11:26:12,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:12,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:12,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:26:12,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:26:12,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:12,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:12,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:26:12,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:12,281 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023911804] [2025-04-29 11:26:12,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023911804] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:12,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:12,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:26:12,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434707463] [2025-04-29 11:26:12,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:12,283 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:26:12,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:12,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:26:12,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:26:12,283 INFO L87 Difference]: Start difference. First operand 338 states and 400 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:12,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:12,504 INFO L93 Difference]: Finished difference Result 342 states and 405 transitions. [2025-04-29 11:26:12,504 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:26:12,505 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 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 48 [2025-04-29 11:26:12,505 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:12,505 INFO L225 Difference]: With dead ends: 342 [2025-04-29 11:26:12,506 INFO L226 Difference]: Without dead ends: 342 [2025-04-29 11:26:12,506 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:26:12,506 INFO L437 NwaCegarLoop]: 208 mSDtfsCounter, 65 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:12,506 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 535 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:26:12,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-04-29 11:26:12,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2025-04-29 11:26:12,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 273 states have (on average 1.4835164835164836) internal successors, (405), 341 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 405 transitions. [2025-04-29 11:26:12,509 INFO L79 Accepts]: Start accepts. Automaton has 342 states and 405 transitions. Word has length 48 [2025-04-29 11:26:12,510 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:12,510 INFO L485 AbstractCegarLoop]: Abstraction has 342 states and 405 transitions. [2025-04-29 11:26:12,510 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:12,510 INFO L278 IsEmpty]: Start isEmpty. Operand 342 states and 405 transitions. [2025-04-29 11:26:12,510 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-29 11:26:12,510 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:12,510 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-29 11:26:12,510 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:26:12,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:12,511 INFO L85 PathProgramCache]: Analyzing trace with hash -591108944, now seen corresponding path program 1 times [2025-04-29 11:26:12,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:12,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804903215] [2025-04-29 11:26:12,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:12,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:12,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:26:12,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:26:12,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:12,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:12,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:26:12,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:12,845 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804903215] [2025-04-29 11:26:12,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804903215] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:12,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:12,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-29 11:26:12,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336203078] [2025-04-29 11:26:12,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:12,846 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:26:12,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:12,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:26:12,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:26:12,846 INFO L87 Difference]: Start difference. First operand 342 states and 405 transitions. Second operand has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:13,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:13,379 INFO L93 Difference]: Finished difference Result 418 states and 468 transitions. [2025-04-29 11:26:13,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:26:13,381 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-04-29 11:26:13,381 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:13,382 INFO L225 Difference]: With dead ends: 418 [2025-04-29 11:26:13,382 INFO L226 Difference]: Without dead ends: 418 [2025-04-29 11:26:13,382 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:26:13,383 INFO L437 NwaCegarLoop]: 126 mSDtfsCounter, 250 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:13,383 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1204 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-29 11:26:13,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-04-29 11:26:13,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 374. [2025-04-29 11:26:13,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 305 states have (on average 1.5278688524590165) internal successors, (466), 373 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:13,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 466 transitions. [2025-04-29 11:26:13,386 INFO L79 Accepts]: Start accepts. Automaton has 374 states and 466 transitions. Word has length 48 [2025-04-29 11:26:13,387 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:13,387 INFO L485 AbstractCegarLoop]: Abstraction has 374 states and 466 transitions. [2025-04-29 11:26:13,387 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:13,387 INFO L278 IsEmpty]: Start isEmpty. Operand 374 states and 466 transitions. [2025-04-29 11:26:13,387 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-29 11:26:13,387 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:13,387 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:13,387 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-29 11:26:13,387 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:26:13,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:13,388 INFO L85 PathProgramCache]: Analyzing trace with hash 868743188, now seen corresponding path program 1 times [2025-04-29 11:26:13,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:13,388 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704249533] [2025-04-29 11:26:13,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:13,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:13,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-29 11:26:13,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-29 11:26:13,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:13,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:13,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:26:13,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:13,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704249533] [2025-04-29 11:26:13,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704249533] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:26:13,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519692737] [2025-04-29 11:26:13,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:13,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:26:13,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:26:13,706 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:26:13,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:26:13,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-29 11:26:13,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-29 11:26:13,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:13,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:13,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-29 11:26:13,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:26:13,881 INFO L354 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 [2025-04-29 11:26:13,884 INFO L354 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 [2025-04-29 11:26:13,939 INFO L354 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 [2025-04-29 11:26:13,973 INFO L354 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 [2025-04-29 11:26:14,011 INFO L354 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 [2025-04-29 11:26:14,024 INFO L354 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 7 treesize of output 3 [2025-04-29 11:26:14,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:26:14,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:26:14,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:26:14,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519692737] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:26:14,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:26:14,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 18 [2025-04-29 11:26:14,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192756541] [2025-04-29 11:26:14,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:26:14,239 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:26:14,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:14,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:26:14,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:26:14,240 INFO L87 Difference]: Start difference. First operand 374 states and 466 transitions. Second operand has 18 states, 18 states have (on average 6.166666666666667) internal successors, (111), 18 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) [2025-04-29 11:26:14,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:14,601 INFO L93 Difference]: Finished difference Result 461 states and 564 transitions. [2025-04-29 11:26:14,601 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:26:14,601 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.166666666666667) internal successors, (111), 18 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 52 [2025-04-29 11:26:14,601 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:14,602 INFO L225 Difference]: With dead ends: 461 [2025-04-29 11:26:14,602 INFO L226 Difference]: Without dead ends: 461 [2025-04-29 11:26:14,603 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:26:14,603 INFO L437 NwaCegarLoop]: 218 mSDtfsCounter, 87 mSDsluCounter, 2814 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 3032 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:14,603 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 3032 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:26:14,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-04-29 11:26:14,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 385. [2025-04-29 11:26:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 316 states have (on average 1.509493670886076) internal successors, (477), 384 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:14,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 477 transitions. [2025-04-29 11:26:14,607 INFO L79 Accepts]: Start accepts. Automaton has 385 states and 477 transitions. Word has length 52 [2025-04-29 11:26:14,607 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:14,607 INFO L485 AbstractCegarLoop]: Abstraction has 385 states and 477 transitions. [2025-04-29 11:26:14,607 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.166666666666667) internal successors, (111), 18 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) [2025-04-29 11:26:14,607 INFO L278 IsEmpty]: Start isEmpty. Operand 385 states and 477 transitions. [2025-04-29 11:26:14,608 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-29 11:26:14,610 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:14,611 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:14,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 11:26:14,811 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-29 11:26:14,811 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr139REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:26:14,811 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:14,811 INFO L85 PathProgramCache]: Analyzing trace with hash 347676548, now seen corresponding path program 1 times [2025-04-29 11:26:14,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:14,811 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508891654] [2025-04-29 11:26:14,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:14,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:14,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:26:14,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:26:14,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:14,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:14,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:26:14,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:14,899 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508891654] [2025-04-29 11:26:14,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508891654] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:14,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:14,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:26:14,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775185634] [2025-04-29 11:26:14,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:14,900 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:26:14,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:14,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:26:14,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:26:14,901 INFO L87 Difference]: Start difference. First operand 385 states and 477 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:15,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:15,056 INFO L93 Difference]: Finished difference Result 432 states and 485 transitions. [2025-04-29 11:26:15,056 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:26:15,057 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-04-29 11:26:15,057 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:15,058 INFO L225 Difference]: With dead ends: 432 [2025-04-29 11:26:15,058 INFO L226 Difference]: Without dead ends: 432 [2025-04-29 11:26:15,058 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:26:15,058 INFO L437 NwaCegarLoop]: 219 mSDtfsCounter, 232 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:15,058 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 1404 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:26:15,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-04-29 11:26:15,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 385. [2025-04-29 11:26:15,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 316 states have (on average 1.5063291139240507) internal successors, (476), 384 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:15,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 476 transitions. [2025-04-29 11:26:15,063 INFO L79 Accepts]: Start accepts. Automaton has 385 states and 476 transitions. Word has length 53 [2025-04-29 11:26:15,063 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:15,063 INFO L485 AbstractCegarLoop]: Abstraction has 385 states and 476 transitions. [2025-04-29 11:26:15,064 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:15,064 INFO L278 IsEmpty]: Start isEmpty. Operand 385 states and 476 transitions. [2025-04-29 11:26:15,065 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-29 11:26:15,065 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:15,065 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:15,065 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-29 11:26:15,065 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr139REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:26:15,065 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:15,066 INFO L85 PathProgramCache]: Analyzing trace with hash -11322753, now seen corresponding path program 1 times [2025-04-29 11:26:15,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:15,066 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023951831] [2025-04-29 11:26:15,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:15,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:15,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:26:15,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:26:15,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:15,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:15,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:26:15,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:15,199 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023951831] [2025-04-29 11:26:15,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023951831] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:15,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:15,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:26:15,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594718248] [2025-04-29 11:26:15,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:15,200 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:26:15,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:15,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:26:15,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:26:15,201 INFO L87 Difference]: Start difference. First operand 385 states and 476 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:15,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:15,409 INFO L93 Difference]: Finished difference Result 450 states and 505 transitions. [2025-04-29 11:26:15,410 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:26:15,410 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-04-29 11:26:15,410 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:15,411 INFO L225 Difference]: With dead ends: 450 [2025-04-29 11:26:15,411 INFO L226 Difference]: Without dead ends: 450 [2025-04-29 11:26:15,411 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:26:15,411 INFO L437 NwaCegarLoop]: 206 mSDtfsCounter, 282 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:15,411 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 1734 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:26:15,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-04-29 11:26:15,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 385. [2025-04-29 11:26:15,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 316 states have (on average 1.5031645569620253) internal successors, (475), 384 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:15,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 475 transitions. [2025-04-29 11:26:15,415 INFO L79 Accepts]: Start accepts. Automaton has 385 states and 475 transitions. Word has length 55 [2025-04-29 11:26:15,415 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:15,415 INFO L485 AbstractCegarLoop]: Abstraction has 385 states and 475 transitions. [2025-04-29 11:26:15,415 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:15,415 INFO L278 IsEmpty]: Start isEmpty. Operand 385 states and 475 transitions. [2025-04-29 11:26:15,415 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-29 11:26:15,415 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:15,415 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:15,415 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-29 11:26:15,415 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:26:15,415 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:15,416 INFO L85 PathProgramCache]: Analyzing trace with hash -11360517, now seen corresponding path program 1 times [2025-04-29 11:26:15,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:15,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794507737] [2025-04-29 11:26:15,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:15,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:15,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:26:15,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:26:15,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:15,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:15,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:26:15,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:15,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794507737] [2025-04-29 11:26:15,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794507737] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:15,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:15,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-04-29 11:26:15,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825434318] [2025-04-29 11:26:15,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:15,855 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-29 11:26:15,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:15,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-29 11:26:15,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2025-04-29 11:26:15,855 INFO L87 Difference]: Start difference. First operand 385 states and 475 transitions. Second operand has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:16,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:16,557 INFO L93 Difference]: Finished difference Result 427 states and 518 transitions. [2025-04-29 11:26:16,558 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:26:16,558 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-04-29 11:26:16,558 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:16,559 INFO L225 Difference]: With dead ends: 427 [2025-04-29 11:26:16,559 INFO L226 Difference]: Without dead ends: 427 [2025-04-29 11:26:16,559 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2025-04-29 11:26:16,559 INFO L437 NwaCegarLoop]: 166 mSDtfsCounter, 158 mSDsluCounter, 1957 mSDsCounter, 0 mSdLazyCounter, 1828 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 2123 SdHoareTripleChecker+Invalid, 1833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:16,559 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 2123 Invalid, 1833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1828 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-29 11:26:16,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-04-29 11:26:16,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 385. [2025-04-29 11:26:16,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 316 states have (on average 1.5) internal successors, (474), 384 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:16,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 474 transitions. [2025-04-29 11:26:16,563 INFO L79 Accepts]: Start accepts. Automaton has 385 states and 474 transitions. Word has length 55 [2025-04-29 11:26:16,563 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:16,563 INFO L485 AbstractCegarLoop]: Abstraction has 385 states and 474 transitions. [2025-04-29 11:26:16,563 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:16,563 INFO L278 IsEmpty]: Start isEmpty. Operand 385 states and 474 transitions. [2025-04-29 11:26:16,564 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-29 11:26:16,564 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:16,564 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:16,564 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-29 11:26:16,564 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:26:16,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:16,564 INFO L85 PathProgramCache]: Analyzing trace with hash -11360516, now seen corresponding path program 1 times [2025-04-29 11:26:16,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:16,565 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978284956] [2025-04-29 11:26:16,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:16,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:16,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:26:16,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:26:16,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:16,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:26:17,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:17,177 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978284956] [2025-04-29 11:26:17,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978284956] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:17,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:17,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-04-29 11:26:17,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059779905] [2025-04-29 11:26:17,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:17,177 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 11:26:17,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:17,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 11:26:17,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:26:17,178 INFO L87 Difference]: Start difference. First operand 385 states and 474 transitions. Second operand has 17 states, 16 states have (on average 3.4375) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:18,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:18,146 INFO L93 Difference]: Finished difference Result 443 states and 520 transitions. [2025-04-29 11:26:18,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:26:18,147 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.4375) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-04-29 11:26:18,147 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:18,148 INFO L225 Difference]: With dead ends: 443 [2025-04-29 11:26:18,148 INFO L226 Difference]: Without dead ends: 443 [2025-04-29 11:26:18,148 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2025-04-29 11:26:18,148 INFO L437 NwaCegarLoop]: 142 mSDtfsCounter, 175 mSDsluCounter, 1700 mSDsCounter, 0 mSdLazyCounter, 2160 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 2167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:18,148 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1842 Invalid, 2167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2160 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-29 11:26:18,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-04-29 11:26:18,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 385. [2025-04-29 11:26:18,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 316 states have (on average 1.4968354430379747) internal successors, (473), 384 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:18,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 473 transitions. [2025-04-29 11:26:18,151 INFO L79 Accepts]: Start accepts. Automaton has 385 states and 473 transitions. Word has length 55 [2025-04-29 11:26:18,151 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:18,151 INFO L485 AbstractCegarLoop]: Abstraction has 385 states and 473 transitions. [2025-04-29 11:26:18,151 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.4375) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:18,151 INFO L278 IsEmpty]: Start isEmpty. Operand 385 states and 473 transitions. [2025-04-29 11:26:18,152 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-29 11:26:18,152 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:18,152 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:18,152 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-29 11:26:18,152 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2025-04-29 11:26:18,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:18,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1902195343, now seen corresponding path program 1 times [2025-04-29 11:26:18,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:18,152 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520286645] [2025-04-29 11:26:18,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:18,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:18,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-29 11:26:18,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:26:18,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:18,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:19,642 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:19,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:19,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520286645] [2025-04-29 11:26:19,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520286645] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:26:19,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527148304] [2025-04-29 11:26:19,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:19,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:26:19,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:26:19,644 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:26:19,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:26:19,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-29 11:26:19,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:26:19,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:19,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:19,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 107 conjuncts are in the unsatisfiable core [2025-04-29 11:26:19,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:26:19,814 INFO L354 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 [2025-04-29 11:26:19,863 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:26:19,863 INFO L354 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 [2025-04-29 11:26:19,913 INFO L354 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 [2025-04-29 11:26:19,955 INFO L354 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 17 [2025-04-29 11:26:20,013 INFO L325 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2025-04-29 11:26:20,014 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2025-04-29 11:26:20,071 INFO L354 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 34 treesize of output 25 [2025-04-29 11:26:20,093 INFO L354 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 34 treesize of output 25 [2025-04-29 11:26:20,127 INFO L325 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2025-04-29 11:26:20,127 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2025-04-29 11:26:20,206 INFO L354 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 53 treesize of output 29 [2025-04-29 11:26:20,277 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 54 [2025-04-29 11:26:20,287 INFO L354 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 [2025-04-29 11:26:20,445 INFO L325 Elim1Store]: treesize reduction 76, result has 26.2 percent of original size [2025-04-29 11:26:20,445 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 38 [2025-04-29 11:26:20,515 INFO L354 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 [2025-04-29 11:26:20,518 INFO L354 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 [2025-04-29 11:26:20,680 INFO L354 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 233 treesize of output 180 [2025-04-29 11:26:20,687 INFO L354 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 248 treesize of output 188 [2025-04-29 11:26:20,991 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 257 treesize of output 177 [2025-04-29 11:26:20,994 INFO L354 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 242 treesize of output 182 [2025-04-29 11:26:21,197 INFO L354 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 35 treesize of output 7 [2025-04-29 11:26:21,287 INFO L354 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 240 treesize of output 176 [2025-04-29 11:26:21,292 INFO L354 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 186 treesize of output 123 [2025-04-29 11:26:21,522 INFO L325 Elim1Store]: treesize reduction 70, result has 4.1 percent of original size [2025-04-29 11:26:21,522 INFO L354 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 50 [2025-04-29 11:26:21,641 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-29 11:26:21,649 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 31 [2025-04-29 11:26:21,847 INFO L354 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 7 treesize of output 3 [2025-04-29 11:26:21,921 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:26:21,922 INFO L354 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 62 treesize of output 26 [2025-04-29 11:26:22,055 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:22,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:26:27,295 WARN L849 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_30| Int) (v_ArrVal_2021 Int) (v_ArrVal_2037 Int) (|v_ULTIMATE.start_main_~#iter~0#1.base_61| Int) (|ULTIMATE.start_main_~item~0#1.offset| Int) (v_ArrVal_2020 (Array Int Int))) (let ((.cse0 (store (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_30| v_ArrVal_2021) |v_ULTIMATE.start_main_~#iter~0#1.base_61| 1))) (or (< |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_2037) (not (= (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_30|) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_30|) 0)) (< v_ArrVal_2037 0) (= (select .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_2020))) (store .cse1 |v_ULTIMATE.start_main_~item~0#1.base_30| (store (store (select .cse1 |v_ULTIMATE.start_main_~item~0#1.base_30|) |ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) v_ArrVal_2037)) 1)))) is different from false [2025-04-29 11:26:32,388 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:26:32,388 INFO L354 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 63 treesize of output 56 [2025-04-29 11:26:32,407 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:26:32,408 INFO L354 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 368 treesize of output 364 [2025-04-29 11:26:32,417 INFO L354 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 374 treesize of output 366 [2025-04-29 11:26:32,481 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:26:32,482 INFO L354 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 453 treesize of output 451 Killed by 15