./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety/test-0217.i --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-0217.i -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 163bc3b45d6f21a8e478003f84571178259b289b3d9717ecadbc4595fc507bec --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:44:17,867 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:44:17,920 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:44:17,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:44:17,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:44:17,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:44:17,939 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:44:17,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:44:17,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:44:17,940 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:44:17,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:44:17,940 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:44:17,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:44:17,941 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:44:17,941 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:44:17,941 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:44:17,942 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:44:17,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:44:17,942 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:44:17,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:44:17,942 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:44:17,942 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:44:17,942 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:44:17,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:44:17,942 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:44:17,942 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:44:17,942 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:44:17,942 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:44:17,942 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:44:17,943 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:44:17,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:44:17,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:44:17,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:44:17,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:44:17,943 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:44:17,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:44:17,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:44:17,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:44:17,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:44:17,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:44:17,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:44:17,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:44:17,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:44:17,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:44:17,944 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:44:17,944 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:44:17,944 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 -> 163bc3b45d6f21a8e478003f84571178259b289b3d9717ecadbc4595fc507bec [2025-04-30 10:44:18,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:44:18,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:44:18,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:44:18,166 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:44:18,167 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:44:18,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0217.i [2025-04-30 10:44:19,438 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c41e430d/ba1d8603779e4117afece093ad5f4290/FLAG2b246829b [2025-04-30 10:44:19,662 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:44:19,663 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/test-0217.i [2025-04-30 10:44:19,672 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c41e430d/ba1d8603779e4117afece093ad5f4290/FLAG2b246829b [2025-04-30 10:44:21,539 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c41e430d/ba1d8603779e4117afece093ad5f4290 [2025-04-30 10:44:21,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:44:21,542 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:44:21,543 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:44:21,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:44:21,546 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:44:21,546 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:44:21" (1/1) ... [2025-04-30 10:44:21,547 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74d5c865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:21, skipping insertion in model container [2025-04-30 10:44:21,547 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:44:21" (1/1) ... [2025-04-30 10:44:21,574 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:44:21,863 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:44:21,870 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:44:21,920 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:44:21,940 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:44:21,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:21 WrapperNode [2025-04-30 10:44:21,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:44:21,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:44:21,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:44:21,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:44:21,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:21" (1/1) ... [2025-04-30 10:44:21,965 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:21" (1/1) ... [2025-04-30 10:44:21,992 INFO L138 Inliner]: procedures = 181, calls = 47, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 206 [2025-04-30 10:44:21,992 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:44:21,993 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:44:21,993 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:44:21,993 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:44:22,001 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:21" (1/1) ... [2025-04-30 10:44:22,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:21" (1/1) ... [2025-04-30 10:44:22,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:21" (1/1) ... [2025-04-30 10:44:22,037 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 11 writes are split as follows [0, 11]. [2025-04-30 10:44:22,037 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:21" (1/1) ... [2025-04-30 10:44:22,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:21" (1/1) ... [2025-04-30 10:44:22,046 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:21" (1/1) ... [2025-04-30 10:44:22,046 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:21" (1/1) ... [2025-04-30 10:44:22,048 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:21" (1/1) ... [2025-04-30 10:44:22,051 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:21" (1/1) ... [2025-04-30 10:44:22,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:21" (1/1) ... [2025-04-30 10:44:22,061 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:44:22,065 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:44:22,065 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:44:22,065 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:44:22,066 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:21" (1/1) ... [2025-04-30 10:44:22,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:44:22,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:22,091 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-30 10:44:22,093 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-30 10:44:22,107 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2025-04-30 10:44:22,108 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2025-04-30 10:44:22,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:44:22,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:44:22,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:44:22,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:44:22,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:44:22,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:44:22,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:44:22,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:44:22,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:44:22,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:44:22,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:44:22,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:44:22,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:44:22,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:44:22,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:44:22,202 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:44:22,203 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:44:22,549 INFO L? ?]: Removed 187 outVars from TransFormulas that were not future-live. [2025-04-30 10:44:22,549 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:44:22,564 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:44:22,564 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-04-30 10:44:22,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:44:22 BoogieIcfgContainer [2025-04-30 10:44:22,565 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:44:22,568 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:44:22,568 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:44:22,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:44:22,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:44:21" (1/3) ... [2025-04-30 10:44:22,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eeecdb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:44:22, skipping insertion in model container [2025-04-30 10:44:22,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:21" (2/3) ... [2025-04-30 10:44:22,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eeecdb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:44:22, skipping insertion in model container [2025-04-30 10:44:22,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:44:22" (3/3) ... [2025-04-30 10:44:22,574 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0217.i [2025-04-30 10:44:22,584 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:44:22,586 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0217.i that has 2 procedures, 166 locations, 192 edges, 1 initial locations, 6 loop locations, and 67 error locations. [2025-04-30 10:44:22,623 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:44:22,659 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;@70efa4e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:44:22,661 INFO L341 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2025-04-30 10:44:22,664 INFO L278 IsEmpty]: Start isEmpty. Operand has 166 states, 95 states have (on average 1.9578947368421054) internal successors, (186), 162 states have internal predecessors, (186), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:44:22,667 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-30 10:44:22,668 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:22,668 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:44:22,668 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:22,672 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:22,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1074487978, now seen corresponding path program 1 times [2025-04-30 10:44:22,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:22,678 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152940623] [2025-04-30 10:44:22,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:22,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:22,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:44:22,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:44:22,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:22,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:22,771 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-30 10:44:22,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:22,773 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152940623] [2025-04-30 10:44:22,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152940623] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:22,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:22,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:22,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730428188] [2025-04-30 10:44:22,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:22,777 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-30 10:44:22,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:22,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-30 10:44:22,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-30 10:44:22,794 INFO L87 Difference]: Start difference. First operand has 166 states, 95 states have (on average 1.9578947368421054) internal successors, (186), 162 states have internal predecessors, (186), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:22,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:22,811 INFO L93 Difference]: Finished difference Result 166 states and 185 transitions. [2025-04-30 10:44:22,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-30 10:44:22,813 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-30 10:44:22,813 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:22,818 INFO L225 Difference]: With dead ends: 166 [2025-04-30 10:44:22,818 INFO L226 Difference]: Without dead ends: 164 [2025-04-30 10:44:22,820 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-30 10:44:22,821 INFO L437 NwaCegarLoop]: 185 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, 185 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-30 10:44:22,822 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:22,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-04-30 10:44:22,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-04-30 10:44:22,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 94 states have (on average 1.9042553191489362) internal successors, (179), 160 states have internal predecessors, (179), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:44:22,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 183 transitions. [2025-04-30 10:44:22,857 INFO L79 Accepts]: Start accepts. Automaton has 164 states and 183 transitions. Word has length 6 [2025-04-30 10:44:22,858 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:22,858 INFO L485 AbstractCegarLoop]: Abstraction has 164 states and 183 transitions. [2025-04-30 10:44:22,858 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:22,859 INFO L278 IsEmpty]: Start isEmpty. Operand 164 states and 183 transitions. [2025-04-30 10:44:22,859 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:44:22,859 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:22,859 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:22,860 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:44:22,860 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:22,860 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:22,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1281225955, now seen corresponding path program 1 times [2025-04-30 10:44:22,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:22,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733177876] [2025-04-30 10:44:22,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:22,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:22,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:44:22,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:44:22,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:22,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:22,955 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-30 10:44:22,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:22,956 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733177876] [2025-04-30 10:44:22,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733177876] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:22,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:22,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-30 10:44:22,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394678727] [2025-04-30 10:44:22,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:22,957 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:22,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:22,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:22,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:22,957 INFO L87 Difference]: Start difference. First operand 164 states and 183 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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-30 10:44:23,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:23,123 INFO L93 Difference]: Finished difference Result 319 states and 356 transitions. [2025-04-30 10:44:23,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:23,124 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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-30 10:44:23,124 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:23,126 INFO L225 Difference]: With dead ends: 319 [2025-04-30 10:44:23,126 INFO L226 Difference]: Without dead ends: 319 [2025-04-30 10:44:23,126 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-30 10:44:23,127 INFO L437 NwaCegarLoop]: 119 mSDtfsCounter, 164 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 233 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-30 10:44:23,127 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 233 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:23,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-04-30 10:44:23,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 228. [2025-04-30 10:44:23,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 155 states have (on average 1.8774193548387097) internal successors, (291), 221 states have internal predecessors, (291), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:44:23,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 299 transitions. [2025-04-30 10:44:23,145 INFO L79 Accepts]: Start accepts. Automaton has 228 states and 299 transitions. Word has length 7 [2025-04-30 10:44:23,145 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:23,145 INFO L485 AbstractCegarLoop]: Abstraction has 228 states and 299 transitions. [2025-04-30 10:44:23,145 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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-30 10:44:23,145 INFO L278 IsEmpty]: Start isEmpty. Operand 228 states and 299 transitions. [2025-04-30 10:44:23,145 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:44:23,145 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:23,145 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:23,145 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:44:23,145 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:23,147 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:23,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1281225954, now seen corresponding path program 1 times [2025-04-30 10:44:23,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:23,147 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459455549] [2025-04-30 10:44:23,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:23,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:23,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:44:23,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:44:23,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:23,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:23,240 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-30 10:44:23,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:23,240 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459455549] [2025-04-30 10:44:23,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459455549] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:23,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:23,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:23,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011865756] [2025-04-30 10:44:23,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:23,240 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:23,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:23,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:23,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:23,241 INFO L87 Difference]: Start difference. First operand 228 states and 299 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) 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-30 10:44:23,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:23,355 INFO L93 Difference]: Finished difference Result 351 states and 445 transitions. [2025-04-30 10:44:23,355 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:23,355 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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-30 10:44:23,355 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:23,357 INFO L225 Difference]: With dead ends: 351 [2025-04-30 10:44:23,357 INFO L226 Difference]: Without dead ends: 351 [2025-04-30 10:44:23,357 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:23,357 INFO L437 NwaCegarLoop]: 156 mSDtfsCounter, 102 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:23,357 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 350 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:23,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-04-30 10:44:23,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 301. [2025-04-30 10:44:23,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 222 states have (on average 1.837837837837838) internal successors, (408), 290 states have internal predecessors, (408), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:44:23,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 424 transitions. [2025-04-30 10:44:23,372 INFO L79 Accepts]: Start accepts. Automaton has 301 states and 424 transitions. Word has length 7 [2025-04-30 10:44:23,373 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:23,373 INFO L485 AbstractCegarLoop]: Abstraction has 301 states and 424 transitions. [2025-04-30 10:44:23,373 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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-30 10:44:23,373 INFO L278 IsEmpty]: Start isEmpty. Operand 301 states and 424 transitions. [2025-04-30 10:44:23,373 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:44:23,373 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:23,373 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:23,373 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:44:23,373 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:23,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:23,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1281225892, now seen corresponding path program 1 times [2025-04-30 10:44:23,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:23,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046773642] [2025-04-30 10:44:23,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:23,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:23,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:44:23,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:44:23,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:23,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:23,469 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-30 10:44:23,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:23,469 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046773642] [2025-04-30 10:44:23,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046773642] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:23,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:23,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:23,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781966481] [2025-04-30 10:44:23,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:23,470 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:23,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:23,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:23,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:23,470 INFO L87 Difference]: Start difference. First operand 301 states and 424 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) 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-30 10:44:23,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:23,605 INFO L93 Difference]: Finished difference Result 350 states and 443 transitions. [2025-04-30 10:44:23,606 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:23,606 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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-30 10:44:23,606 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:23,607 INFO L225 Difference]: With dead ends: 350 [2025-04-30 10:44:23,607 INFO L226 Difference]: Without dead ends: 350 [2025-04-30 10:44:23,608 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:23,609 INFO L437 NwaCegarLoop]: 157 mSDtfsCounter, 99 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:23,609 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 351 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:23,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-04-30 10:44:23,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 301. [2025-04-30 10:44:23,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 222 states have (on average 1.837837837837838) internal successors, (408), 290 states have internal predecessors, (408), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:44:23,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 424 transitions. [2025-04-30 10:44:23,625 INFO L79 Accepts]: Start accepts. Automaton has 301 states and 424 transitions. Word has length 7 [2025-04-30 10:44:23,625 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:23,625 INFO L485 AbstractCegarLoop]: Abstraction has 301 states and 424 transitions. [2025-04-30 10:44:23,625 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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-30 10:44:23,625 INFO L278 IsEmpty]: Start isEmpty. Operand 301 states and 424 transitions. [2025-04-30 10:44:23,627 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:44:23,628 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:23,628 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:23,628 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:44:23,628 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:23,628 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:23,628 INFO L85 PathProgramCache]: Analyzing trace with hash 372169008, now seen corresponding path program 1 times [2025-04-30 10:44:23,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:23,629 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461590913] [2025-04-30 10:44:23,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:23,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:23,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:44:23,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:44:23,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:23,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:23,659 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-30 10:44:23,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:23,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461590913] [2025-04-30 10:44:23,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461590913] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:23,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:23,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:23,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013899923] [2025-04-30 10:44:23,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:23,660 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:23,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:23,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:23,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:23,660 INFO L87 Difference]: Start difference. First operand 301 states and 424 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:23,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:23,752 INFO L93 Difference]: Finished difference Result 361 states and 481 transitions. [2025-04-30 10:44:23,752 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:23,753 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-30 10:44:23,753 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:23,755 INFO L225 Difference]: With dead ends: 361 [2025-04-30 10:44:23,755 INFO L226 Difference]: Without dead ends: 360 [2025-04-30 10:44:23,756 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-30 10:44:23,757 INFO L437 NwaCegarLoop]: 153 mSDtfsCounter, 74 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:23,757 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 267 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:23,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-04-30 10:44:23,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 303. [2025-04-30 10:44:23,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 224 states have (on average 1.8303571428571428) internal successors, (410), 292 states have internal predecessors, (410), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:44:23,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 426 transitions. [2025-04-30 10:44:23,767 INFO L79 Accepts]: Start accepts. Automaton has 303 states and 426 transitions. Word has length 10 [2025-04-30 10:44:23,767 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:23,767 INFO L485 AbstractCegarLoop]: Abstraction has 303 states and 426 transitions. [2025-04-30 10:44:23,767 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:23,767 INFO L278 IsEmpty]: Start isEmpty. Operand 303 states and 426 transitions. [2025-04-30 10:44:23,767 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:44:23,767 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:23,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:23,768 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:44:23,768 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:23,768 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:23,768 INFO L85 PathProgramCache]: Analyzing trace with hash 372168624, now seen corresponding path program 1 times [2025-04-30 10:44:23,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:23,768 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878634101] [2025-04-30 10:44:23,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:23,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:23,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:44:23,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:44:23,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:23,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:23,911 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-30 10:44:23,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:23,911 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878634101] [2025-04-30 10:44:23,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878634101] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:23,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:23,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:44:23,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731613338] [2025-04-30 10:44:23,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:23,912 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:23,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:23,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:23,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:23,913 INFO L87 Difference]: Start difference. First operand 303 states and 426 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:24,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:24,073 INFO L93 Difference]: Finished difference Result 448 states and 602 transitions. [2025-04-30 10:44:24,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:44:24,073 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-30 10:44:24,073 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:24,075 INFO L225 Difference]: With dead ends: 448 [2025-04-30 10:44:24,075 INFO L226 Difference]: Without dead ends: 445 [2025-04-30 10:44:24,075 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:44:24,076 INFO L437 NwaCegarLoop]: 161 mSDtfsCounter, 130 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:24,077 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 763 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:24,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-04-30 10:44:24,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 344. [2025-04-30 10:44:24,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 262 states have (on average 1.8129770992366412) internal successors, (475), 331 states have internal predecessors, (475), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2025-04-30 10:44:24,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 495 transitions. [2025-04-30 10:44:24,087 INFO L79 Accepts]: Start accepts. Automaton has 344 states and 495 transitions. Word has length 10 [2025-04-30 10:44:24,087 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:24,087 INFO L485 AbstractCegarLoop]: Abstraction has 344 states and 495 transitions. [2025-04-30 10:44:24,087 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:24,087 INFO L278 IsEmpty]: Start isEmpty. Operand 344 states and 495 transitions. [2025-04-30 10:44:24,088 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:44:24,088 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:24,088 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:24,088 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:44:24,089 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:24,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:24,090 INFO L85 PathProgramCache]: Analyzing trace with hash 374015666, now seen corresponding path program 1 times [2025-04-30 10:44:24,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:24,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084853656] [2025-04-30 10:44:24,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:24,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:24,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:44:24,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:44:24,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:24,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:24,190 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-30 10:44:24,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:24,191 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084853656] [2025-04-30 10:44:24,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084853656] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:24,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:24,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:44:24,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862258768] [2025-04-30 10:44:24,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:24,191 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:24,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:24,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:24,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:24,192 INFO L87 Difference]: Start difference. First operand 344 states and 495 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:24,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:24,317 INFO L93 Difference]: Finished difference Result 435 states and 587 transitions. [2025-04-30 10:44:24,317 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:44:24,317 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-30 10:44:24,317 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:24,319 INFO L225 Difference]: With dead ends: 435 [2025-04-30 10:44:24,319 INFO L226 Difference]: Without dead ends: 430 [2025-04-30 10:44:24,319 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:24,319 INFO L437 NwaCegarLoop]: 165 mSDtfsCounter, 117 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:24,319 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 725 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:24,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-04-30 10:44:24,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 339. [2025-04-30 10:44:24,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 257 states have (on average 1.8249027237354085) internal successors, (469), 326 states have internal predecessors, (469), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2025-04-30 10:44:24,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 489 transitions. [2025-04-30 10:44:24,327 INFO L79 Accepts]: Start accepts. Automaton has 339 states and 489 transitions. Word has length 10 [2025-04-30 10:44:24,327 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:24,327 INFO L485 AbstractCegarLoop]: Abstraction has 339 states and 489 transitions. [2025-04-30 10:44:24,327 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:24,327 INFO L278 IsEmpty]: Start isEmpty. Operand 339 states and 489 transitions. [2025-04-30 10:44:24,327 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-30 10:44:24,328 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:24,328 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:24,328 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:44:24,328 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:24,328 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:24,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1048767221, now seen corresponding path program 1 times [2025-04-30 10:44:24,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:24,329 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932515582] [2025-04-30 10:44:24,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:24,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:24,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:44:24,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:44:24,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:24,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:24,370 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-30 10:44:24,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:24,370 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932515582] [2025-04-30 10:44:24,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932515582] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:24,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:24,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:24,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921104808] [2025-04-30 10:44:24,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:24,371 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:24,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:24,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:24,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:24,372 INFO L87 Difference]: Start difference. First operand 339 states and 489 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:24,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:24,552 INFO L93 Difference]: Finished difference Result 446 states and 583 transitions. [2025-04-30 10:44:24,553 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:24,553 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-04-30 10:44:24,553 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:24,554 INFO L225 Difference]: With dead ends: 446 [2025-04-30 10:44:24,555 INFO L226 Difference]: Without dead ends: 446 [2025-04-30 10:44:24,555 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:24,555 INFO L437 NwaCegarLoop]: 118 mSDtfsCounter, 168 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:24,555 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 337 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:24,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-04-30 10:44:24,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 345. [2025-04-30 10:44:24,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 263 states have (on average 1.806083650190114) internal successors, (475), 332 states have internal predecessors, (475), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2025-04-30 10:44:24,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 495 transitions. [2025-04-30 10:44:24,570 INFO L79 Accepts]: Start accepts. Automaton has 345 states and 495 transitions. Word has length 15 [2025-04-30 10:44:24,570 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:24,573 INFO L485 AbstractCegarLoop]: Abstraction has 345 states and 495 transitions. [2025-04-30 10:44:24,573 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:24,573 INFO L278 IsEmpty]: Start isEmpty. Operand 345 states and 495 transitions. [2025-04-30 10:44:24,574 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-30 10:44:24,574 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:24,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:24,574 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:44:24,574 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:24,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:24,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1048767222, now seen corresponding path program 1 times [2025-04-30 10:44:24,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:24,575 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065648024] [2025-04-30 10:44:24,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:24,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:24,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:44:24,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:44:24,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:24,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:24,677 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-30 10:44:24,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:24,678 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065648024] [2025-04-30 10:44:24,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065648024] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:24,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:24,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:24,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195969821] [2025-04-30 10:44:24,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:24,678 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:24,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:24,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:24,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:24,679 INFO L87 Difference]: Start difference. First operand 345 states and 495 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:24,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:24,806 INFO L93 Difference]: Finished difference Result 392 states and 506 transitions. [2025-04-30 10:44:24,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:24,807 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-04-30 10:44:24,807 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:24,808 INFO L225 Difference]: With dead ends: 392 [2025-04-30 10:44:24,808 INFO L226 Difference]: Without dead ends: 392 [2025-04-30 10:44:24,808 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:24,809 INFO L437 NwaCegarLoop]: 175 mSDtfsCounter, 101 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:24,809 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 427 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:24,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-04-30 10:44:24,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 345. [2025-04-30 10:44:24,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 263 states have (on average 1.7718631178707225) internal successors, (466), 332 states have internal predecessors, (466), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2025-04-30 10:44:24,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 486 transitions. [2025-04-30 10:44:24,818 INFO L79 Accepts]: Start accepts. Automaton has 345 states and 486 transitions. Word has length 15 [2025-04-30 10:44:24,818 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:24,818 INFO L485 AbstractCegarLoop]: Abstraction has 345 states and 486 transitions. [2025-04-30 10:44:24,818 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:24,819 INFO L278 IsEmpty]: Start isEmpty. Operand 345 states and 486 transitions. [2025-04-30 10:44:24,819 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-30 10:44:24,819 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:24,819 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:24,819 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:44:24,820 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:24,820 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:24,821 INFO L85 PathProgramCache]: Analyzing trace with hash -674122303, now seen corresponding path program 1 times [2025-04-30 10:44:24,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:24,821 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089330246] [2025-04-30 10:44:24,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:24,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:24,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:44:24,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:44:24,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:24,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:24,888 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-30 10:44:24,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:24,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089330246] [2025-04-30 10:44:24,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089330246] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:24,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:24,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:44:24,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721891962] [2025-04-30 10:44:24,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:24,889 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:44:24,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:24,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:44:24,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:24,890 INFO L87 Difference]: Start difference. First operand 345 states and 486 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:25,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:25,091 INFO L93 Difference]: Finished difference Result 462 states and 604 transitions. [2025-04-30 10:44:25,091 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:44:25,091 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-04-30 10:44:25,092 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:25,093 INFO L225 Difference]: With dead ends: 462 [2025-04-30 10:44:25,093 INFO L226 Difference]: Without dead ends: 462 [2025-04-30 10:44:25,093 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:44:25,094 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 308 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:25,094 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 400 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:25,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-04-30 10:44:25,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 342. [2025-04-30 10:44:25,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 264 states have (on average 1.7424242424242424) internal successors, (460), 329 states have internal predecessors, (460), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2025-04-30 10:44:25,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 480 transitions. [2025-04-30 10:44:25,101 INFO L79 Accepts]: Start accepts. Automaton has 342 states and 480 transitions. Word has length 17 [2025-04-30 10:44:25,101 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:25,101 INFO L485 AbstractCegarLoop]: Abstraction has 342 states and 480 transitions. [2025-04-30 10:44:25,101 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:25,101 INFO L278 IsEmpty]: Start isEmpty. Operand 342 states and 480 transitions. [2025-04-30 10:44:25,102 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-30 10:44:25,102 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:25,102 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:25,102 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:44:25,102 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:25,102 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:25,102 INFO L85 PathProgramCache]: Analyzing trace with hash -674122302, now seen corresponding path program 1 times [2025-04-30 10:44:25,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:25,102 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246775850] [2025-04-30 10:44:25,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:25,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:25,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:44:25,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:44:25,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:25,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:25,251 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-30 10:44:25,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:25,252 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246775850] [2025-04-30 10:44:25,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246775850] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:25,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:25,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:44:25,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029905577] [2025-04-30 10:44:25,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:25,252 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:44:25,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:25,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:44:25,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:44:25,252 INFO L87 Difference]: Start difference. First operand 342 states and 480 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:25,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:25,557 INFO L93 Difference]: Finished difference Result 490 states and 631 transitions. [2025-04-30 10:44:25,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:44:25,557 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-04-30 10:44:25,557 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:25,559 INFO L225 Difference]: With dead ends: 490 [2025-04-30 10:44:25,560 INFO L226 Difference]: Without dead ends: 490 [2025-04-30 10:44:25,560 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:44:25,561 INFO L437 NwaCegarLoop]: 95 mSDtfsCounter, 279 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:25,561 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 445 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:44:25,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-04-30 10:44:25,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 375. [2025-04-30 10:44:25,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 295 states have (on average 1.728813559322034) internal successors, (510), 361 states have internal predecessors, (510), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) [2025-04-30 10:44:25,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 534 transitions. [2025-04-30 10:44:25,570 INFO L79 Accepts]: Start accepts. Automaton has 375 states and 534 transitions. Word has length 17 [2025-04-30 10:44:25,571 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:25,571 INFO L485 AbstractCegarLoop]: Abstraction has 375 states and 534 transitions. [2025-04-30 10:44:25,571 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:25,571 INFO L278 IsEmpty]: Start isEmpty. Operand 375 states and 534 transitions. [2025-04-30 10:44:25,572 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-30 10:44:25,572 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:25,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:25,572 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:44:25,572 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:25,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:25,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1813390531, now seen corresponding path program 1 times [2025-04-30 10:44:25,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:25,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351562420] [2025-04-30 10:44:25,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:25,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:25,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:44:25,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:44:25,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:25,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:25,629 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-30 10:44:25,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:25,629 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351562420] [2025-04-30 10:44:25,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351562420] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:25,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:25,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:44:25,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365067506] [2025-04-30 10:44:25,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:25,630 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:25,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:25,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:25,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:25,630 INFO L87 Difference]: Start difference. First operand 375 states and 534 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:25,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:25,653 INFO L93 Difference]: Finished difference Result 385 states and 546 transitions. [2025-04-30 10:44:25,653 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:44:25,653 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-04-30 10:44:25,653 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:25,654 INFO L225 Difference]: With dead ends: 385 [2025-04-30 10:44:25,654 INFO L226 Difference]: Without dead ends: 385 [2025-04-30 10:44:25,655 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:44:25,655 INFO L437 NwaCegarLoop]: 183 mSDtfsCounter, 1 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:25,655 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 896 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:25,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-04-30 10:44:25,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2025-04-30 10:44:25,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 302 states have (on average 1.7086092715231789) internal successors, (516), 370 states have internal predecessors, (516), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2025-04-30 10:44:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 546 transitions. [2025-04-30 10:44:25,662 INFO L79 Accepts]: Start accepts. Automaton has 385 states and 546 transitions. Word has length 17 [2025-04-30 10:44:25,662 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:25,662 INFO L485 AbstractCegarLoop]: Abstraction has 385 states and 546 transitions. [2025-04-30 10:44:25,662 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:25,662 INFO L278 IsEmpty]: Start isEmpty. Operand 385 states and 546 transitions. [2025-04-30 10:44:25,663 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:44:25,663 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:25,663 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-30 10:44:25,663 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:44:25,663 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:25,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:25,663 INFO L85 PathProgramCache]: Analyzing trace with hash 380587219, now seen corresponding path program 1 times [2025-04-30 10:44:25,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:25,664 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638071096] [2025-04-30 10:44:25,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:25,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:25,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:44:25,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:44:25,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:25,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:25,858 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-30 10:44:25,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:25,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638071096] [2025-04-30 10:44:25,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638071096] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:25,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:25,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:44:25,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741949450] [2025-04-30 10:44:25,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:25,859 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:44:25,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:25,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:44:25,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:44:25,860 INFO L87 Difference]: Start difference. First operand 385 states and 546 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:26,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:26,324 INFO L93 Difference]: Finished difference Result 516 states and 672 transitions. [2025-04-30 10:44:26,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:44:26,324 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-04-30 10:44:26,324 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:26,326 INFO L225 Difference]: With dead ends: 516 [2025-04-30 10:44:26,326 INFO L226 Difference]: Without dead ends: 516 [2025-04-30 10:44:26,326 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:44:26,326 INFO L437 NwaCegarLoop]: 124 mSDtfsCounter, 239 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:26,327 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 703 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:44:26,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-04-30 10:44:26,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 382. [2025-04-30 10:44:26,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 299 states have (on average 1.7090301003344481) internal successors, (511), 367 states have internal predecessors, (511), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2025-04-30 10:44:26,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 541 transitions. [2025-04-30 10:44:26,336 INFO L79 Accepts]: Start accepts. Automaton has 382 states and 541 transitions. Word has length 18 [2025-04-30 10:44:26,336 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:26,336 INFO L485 AbstractCegarLoop]: Abstraction has 382 states and 541 transitions. [2025-04-30 10:44:26,336 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:26,336 INFO L278 IsEmpty]: Start isEmpty. Operand 382 states and 541 transitions. [2025-04-30 10:44:26,337 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-30 10:44:26,337 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:26,337 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] [2025-04-30 10:44:26,337 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:44:26,337 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:26,337 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:26,338 INFO L85 PathProgramCache]: Analyzing trace with hash -2003126456, now seen corresponding path program 1 times [2025-04-30 10:44:26,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:26,338 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701803784] [2025-04-30 10:44:26,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:26,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:26,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-30 10:44:26,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:44:26,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:26,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:26,526 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-30 10:44:26,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:26,527 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701803784] [2025-04-30 10:44:26,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701803784] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:26,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:26,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:44:26,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540741535] [2025-04-30 10:44:26,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:26,527 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:44:26,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:26,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:44:26,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:26,528 INFO L87 Difference]: Start difference. First operand 382 states and 541 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:26,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:26,733 INFO L93 Difference]: Finished difference Result 510 states and 690 transitions. [2025-04-30 10:44:26,733 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:44:26,734 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-04-30 10:44:26,734 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:26,736 INFO L225 Difference]: With dead ends: 510 [2025-04-30 10:44:26,737 INFO L226 Difference]: Without dead ends: 510 [2025-04-30 10:44:26,738 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:44:26,738 INFO L437 NwaCegarLoop]: 164 mSDtfsCounter, 145 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:26,738 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1010 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:26,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-04-30 10:44:26,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 400. [2025-04-30 10:44:26,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 317 states have (on average 1.6876971608832807) internal successors, (535), 383 states have internal predecessors, (535), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2025-04-30 10:44:26,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 565 transitions. [2025-04-30 10:44:26,756 INFO L79 Accepts]: Start accepts. Automaton has 400 states and 565 transitions. Word has length 21 [2025-04-30 10:44:26,756 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:26,757 INFO L485 AbstractCegarLoop]: Abstraction has 400 states and 565 transitions. [2025-04-30 10:44:26,757 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:26,757 INFO L278 IsEmpty]: Start isEmpty. Operand 400 states and 565 transitions. [2025-04-30 10:44:26,757 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-30 10:44:26,757 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:26,757 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] [2025-04-30 10:44:26,757 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:44:26,757 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:26,757 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:26,757 INFO L85 PathProgramCache]: Analyzing trace with hash -533553031, now seen corresponding path program 1 times [2025-04-30 10:44:26,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:26,758 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883830564] [2025-04-30 10:44:26,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:26,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:26,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-30 10:44:26,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:44:26,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:26,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:26,907 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-30 10:44:26,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:26,907 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883830564] [2025-04-30 10:44:26,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883830564] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:26,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:26,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:44:26,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750948856] [2025-04-30 10:44:26,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:26,908 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:44:26,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:26,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:44:26,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:26,908 INFO L87 Difference]: Start difference. First operand 400 states and 565 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:27,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:27,171 INFO L93 Difference]: Finished difference Result 486 states and 655 transitions. [2025-04-30 10:44:27,171 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:44:27,171 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-04-30 10:44:27,171 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:27,173 INFO L225 Difference]: With dead ends: 486 [2025-04-30 10:44:27,173 INFO L226 Difference]: Without dead ends: 486 [2025-04-30 10:44:27,173 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:44:27,173 INFO L437 NwaCegarLoop]: 161 mSDtfsCounter, 108 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:27,173 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1037 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:27,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-04-30 10:44:27,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 394. [2025-04-30 10:44:27,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 311 states have (on average 1.684887459807074) internal successors, (524), 377 states have internal predecessors, (524), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2025-04-30 10:44:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 554 transitions. [2025-04-30 10:44:27,184 INFO L79 Accepts]: Start accepts. Automaton has 394 states and 554 transitions. Word has length 21 [2025-04-30 10:44:27,184 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:27,184 INFO L485 AbstractCegarLoop]: Abstraction has 394 states and 554 transitions. [2025-04-30 10:44:27,184 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:27,184 INFO L278 IsEmpty]: Start isEmpty. Operand 394 states and 554 transitions. [2025-04-30 10:44:27,185 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-30 10:44:27,185 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:27,185 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] [2025-04-30 10:44:27,185 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:44:27,185 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:27,186 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:27,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1640259033, now seen corresponding path program 1 times [2025-04-30 10:44:27,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:27,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200043477] [2025-04-30 10:44:27,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:27,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:27,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:44:27,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:44:27,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:27,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:27,319 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-30 10:44:27,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:27,320 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200043477] [2025-04-30 10:44:27,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200043477] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:27,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:27,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:44:27,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512422355] [2025-04-30 10:44:27,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:27,320 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:44:27,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:27,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:44:27,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:27,321 INFO L87 Difference]: Start difference. First operand 394 states and 554 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:27,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:27,522 INFO L93 Difference]: Finished difference Result 507 states and 683 transitions. [2025-04-30 10:44:27,522 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:44:27,522 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-04-30 10:44:27,522 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:27,524 INFO L225 Difference]: With dead ends: 507 [2025-04-30 10:44:27,524 INFO L226 Difference]: Without dead ends: 507 [2025-04-30 10:44:27,524 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:44:27,524 INFO L437 NwaCegarLoop]: 182 mSDtfsCounter, 116 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:27,525 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1100 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:27,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-04-30 10:44:27,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 402. [2025-04-30 10:44:27,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 319 states have (on average 1.6677115987460815) internal successors, (532), 383 states have internal predecessors, (532), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2025-04-30 10:44:27,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 562 transitions. [2025-04-30 10:44:27,532 INFO L79 Accepts]: Start accepts. Automaton has 402 states and 562 transitions. Word has length 22 [2025-04-30 10:44:27,532 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:27,532 INFO L485 AbstractCegarLoop]: Abstraction has 402 states and 562 transitions. [2025-04-30 10:44:27,532 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:27,532 INFO L278 IsEmpty]: Start isEmpty. Operand 402 states and 562 transitions. [2025-04-30 10:44:27,533 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-30 10:44:27,533 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:27,533 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-30 10:44:27,533 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:44:27,533 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:27,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:27,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1635713180, now seen corresponding path program 1 times [2025-04-30 10:44:27,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:27,534 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128751333] [2025-04-30 10:44:27,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:27,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:27,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:44:27,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:44:27,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:27,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:27,573 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-30 10:44:27,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:27,573 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128751333] [2025-04-30 10:44:27,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128751333] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:27,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:27,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:44:27,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86701869] [2025-04-30 10:44:27,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:27,574 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:44:27,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:27,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:44:27,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:27,575 INFO L87 Difference]: Start difference. First operand 402 states and 562 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:27,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:27,676 INFO L93 Difference]: Finished difference Result 407 states and 561 transitions. [2025-04-30 10:44:27,676 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:44:27,676 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-04-30 10:44:27,677 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:27,678 INFO L225 Difference]: With dead ends: 407 [2025-04-30 10:44:27,678 INFO L226 Difference]: Without dead ends: 407 [2025-04-30 10:44:27,678 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:27,678 INFO L437 NwaCegarLoop]: 149 mSDtfsCounter, 30 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:27,678 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 475 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:27,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-04-30 10:44:27,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 401. [2025-04-30 10:44:27,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 324 states have (on average 1.6141975308641976) internal successors, (523), 382 states have internal predecessors, (523), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2025-04-30 10:44:27,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 553 transitions. [2025-04-30 10:44:27,687 INFO L79 Accepts]: Start accepts. Automaton has 401 states and 553 transitions. Word has length 23 [2025-04-30 10:44:27,688 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:27,688 INFO L485 AbstractCegarLoop]: Abstraction has 401 states and 553 transitions. [2025-04-30 10:44:27,688 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:27,688 INFO L278 IsEmpty]: Start isEmpty. Operand 401 states and 553 transitions. [2025-04-30 10:44:27,690 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-30 10:44:27,690 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:27,690 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-30 10:44:27,690 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:44:27,690 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:27,691 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:27,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1635713179, now seen corresponding path program 1 times [2025-04-30 10:44:27,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:27,691 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840936652] [2025-04-30 10:44:27,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:27,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:27,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:44:27,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:44:27,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:27,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:27,816 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-30 10:44:27,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:27,816 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840936652] [2025-04-30 10:44:27,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840936652] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:27,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:27,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:44:27,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559275861] [2025-04-30 10:44:27,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:27,817 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:44:27,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:27,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:44:27,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:27,818 INFO L87 Difference]: Start difference. First operand 401 states and 553 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:27,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:27,966 INFO L93 Difference]: Finished difference Result 324 states and 424 transitions. [2025-04-30 10:44:27,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:44:27,966 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-04-30 10:44:27,966 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:27,967 INFO L225 Difference]: With dead ends: 324 [2025-04-30 10:44:27,967 INFO L226 Difference]: Without dead ends: 324 [2025-04-30 10:44:27,968 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:44:27,968 INFO L437 NwaCegarLoop]: 158 mSDtfsCounter, 58 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:27,968 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1057 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:27,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-04-30 10:44:27,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 294. [2025-04-30 10:44:27,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 225 states have (on average 1.64) internal successors, (369), 281 states have internal predecessors, (369), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 387 transitions. [2025-04-30 10:44:27,973 INFO L79 Accepts]: Start accepts. Automaton has 294 states and 387 transitions. Word has length 23 [2025-04-30 10:44:27,974 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:27,974 INFO L485 AbstractCegarLoop]: Abstraction has 294 states and 387 transitions. [2025-04-30 10:44:27,974 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:27,974 INFO L278 IsEmpty]: Start isEmpty. Operand 294 states and 387 transitions. [2025-04-30 10:44:27,974 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-30 10:44:27,974 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:27,974 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] [2025-04-30 10:44:27,974 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-30 10:44:27,974 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:27,975 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:27,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1340288486, now seen corresponding path program 1 times [2025-04-30 10:44:27,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:27,975 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905721228] [2025-04-30 10:44:27,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:27,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:27,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:44:27,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:44:27,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:27,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:27,996 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-30 10:44:27,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:27,997 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905721228] [2025-04-30 10:44:27,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905721228] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:27,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:27,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:44:27,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544766736] [2025-04-30 10:44:27,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:27,997 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:27,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:27,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:27,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:27,998 INFO L87 Difference]: Start difference. First operand 294 states and 387 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:28,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:28,014 INFO L93 Difference]: Finished difference Result 303 states and 396 transitions. [2025-04-30 10:44:28,014 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:28,014 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-04-30 10:44:28,014 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:28,015 INFO L225 Difference]: With dead ends: 303 [2025-04-30 10:44:28,015 INFO L226 Difference]: Without dead ends: 303 [2025-04-30 10:44:28,015 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:28,015 INFO L437 NwaCegarLoop]: 170 mSDtfsCounter, 1 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:28,016 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 499 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:28,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-04-30 10:44:28,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2025-04-30 10:44:28,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 234 states have (on average 1.6153846153846154) internal successors, (378), 290 states have internal predecessors, (378), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:28,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 396 transitions. [2025-04-30 10:44:28,020 INFO L79 Accepts]: Start accepts. Automaton has 303 states and 396 transitions. Word has length 25 [2025-04-30 10:44:28,020 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:28,020 INFO L485 AbstractCegarLoop]: Abstraction has 303 states and 396 transitions. [2025-04-30 10:44:28,020 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:28,020 INFO L278 IsEmpty]: Start isEmpty. Operand 303 states and 396 transitions. [2025-04-30 10:44:28,020 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-30 10:44:28,020 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:28,020 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] [2025-04-30 10:44:28,021 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:44:28,021 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:28,021 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:28,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1338441444, now seen corresponding path program 1 times [2025-04-30 10:44:28,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:28,021 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489980269] [2025-04-30 10:44:28,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:28,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:28,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:44:28,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:44:28,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:28,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:28,041 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-30 10:44:28,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:28,041 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489980269] [2025-04-30 10:44:28,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489980269] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:28,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:28,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:28,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734486830] [2025-04-30 10:44:28,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:28,042 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:28,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:28,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:28,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:28,043 INFO L87 Difference]: Start difference. First operand 303 states and 396 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:28,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:28,096 INFO L93 Difference]: Finished difference Result 300 states and 387 transitions. [2025-04-30 10:44:28,096 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:28,096 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-04-30 10:44:28,096 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:28,098 INFO L225 Difference]: With dead ends: 300 [2025-04-30 10:44:28,098 INFO L226 Difference]: Without dead ends: 300 [2025-04-30 10:44:28,098 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-30 10:44:28,098 INFO L437 NwaCegarLoop]: 153 mSDtfsCounter, 28 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:28,099 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 236 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:28,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-04-30 10:44:28,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2025-04-30 10:44:28,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 234 states have (on average 1.5769230769230769) internal successors, (369), 287 states have internal predecessors, (369), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 387 transitions. [2025-04-30 10:44:28,106 INFO L79 Accepts]: Start accepts. Automaton has 300 states and 387 transitions. Word has length 25 [2025-04-30 10:44:28,106 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:28,106 INFO L485 AbstractCegarLoop]: Abstraction has 300 states and 387 transitions. [2025-04-30 10:44:28,106 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:28,106 INFO L278 IsEmpty]: Start isEmpty. Operand 300 states and 387 transitions. [2025-04-30 10:44:28,107 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-30 10:44:28,107 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:28,107 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] [2025-04-30 10:44:28,107 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:44:28,107 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:28,107 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:28,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1338441443, now seen corresponding path program 1 times [2025-04-30 10:44:28,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:28,107 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547313401] [2025-04-30 10:44:28,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:28,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:28,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:44:28,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:44:28,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:28,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:28,152 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-30 10:44:28,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:28,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547313401] [2025-04-30 10:44:28,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547313401] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:28,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:28,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:28,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135198950] [2025-04-30 10:44:28,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:28,152 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:28,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:28,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:28,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:28,153 INFO L87 Difference]: Start difference. First operand 300 states and 387 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:28,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:28,239 INFO L93 Difference]: Finished difference Result 361 states and 465 transitions. [2025-04-30 10:44:28,239 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:28,239 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-04-30 10:44:28,240 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:28,241 INFO L225 Difference]: With dead ends: 361 [2025-04-30 10:44:28,241 INFO L226 Difference]: Without dead ends: 361 [2025-04-30 10:44:28,241 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:28,241 INFO L437 NwaCegarLoop]: 149 mSDtfsCounter, 53 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:28,242 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 343 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:28,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-04-30 10:44:28,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 355. [2025-04-30 10:44:28,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 290 states have (on average 1.5413793103448277) internal successors, (447), 342 states have internal predecessors, (447), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:28,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 465 transitions. [2025-04-30 10:44:28,248 INFO L79 Accepts]: Start accepts. Automaton has 355 states and 465 transitions. Word has length 25 [2025-04-30 10:44:28,248 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:28,248 INFO L485 AbstractCegarLoop]: Abstraction has 355 states and 465 transitions. [2025-04-30 10:44:28,248 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:28,248 INFO L278 IsEmpty]: Start isEmpty. Operand 355 states and 465 transitions. [2025-04-30 10:44:28,248 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:44:28,248 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:28,249 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-30 10:44:28,249 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-30 10:44:28,249 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:28,249 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:28,249 INFO L85 PathProgramCache]: Analyzing trace with hash 864621839, now seen corresponding path program 1 times [2025-04-30 10:44:28,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:28,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453748070] [2025-04-30 10:44:28,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:28,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:28,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:44:28,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:44:28,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:28,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:28,287 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-30 10:44:28,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:28,287 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453748070] [2025-04-30 10:44:28,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453748070] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:28,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:28,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:44:28,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607495374] [2025-04-30 10:44:28,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:28,287 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:28,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:28,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:28,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:28,288 INFO L87 Difference]: Start difference. First operand 355 states and 465 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:28,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:28,306 INFO L93 Difference]: Finished difference Result 402 states and 519 transitions. [2025-04-30 10:44:28,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:44:28,307 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-04-30 10:44:28,307 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:28,308 INFO L225 Difference]: With dead ends: 402 [2025-04-30 10:44:28,308 INFO L226 Difference]: Without dead ends: 402 [2025-04-30 10:44:28,308 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:44:28,309 INFO L437 NwaCegarLoop]: 166 mSDtfsCounter, 46 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:28,309 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 820 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:28,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-04-30 10:44:28,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 355. [2025-04-30 10:44:28,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 290 states have (on average 1.5310344827586206) internal successors, (444), 342 states have internal predecessors, (444), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:28,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 462 transitions. [2025-04-30 10:44:28,315 INFO L79 Accepts]: Start accepts. Automaton has 355 states and 462 transitions. Word has length 26 [2025-04-30 10:44:28,315 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:28,315 INFO L485 AbstractCegarLoop]: Abstraction has 355 states and 462 transitions. [2025-04-30 10:44:28,315 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:28,315 INFO L278 IsEmpty]: Start isEmpty. Operand 355 states and 462 transitions. [2025-04-30 10:44:28,315 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:44:28,316 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:28,316 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-30 10:44:28,316 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-30 10:44:28,316 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:28,316 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:28,316 INFO L85 PathProgramCache]: Analyzing trace with hash -132450514, now seen corresponding path program 1 times [2025-04-30 10:44:28,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:28,316 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858447461] [2025-04-30 10:44:28,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:28,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:28,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:44:28,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:44:28,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:28,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:28,369 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-30 10:44:28,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:28,369 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858447461] [2025-04-30 10:44:28,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858447461] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:28,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:28,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:28,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767901986] [2025-04-30 10:44:28,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:28,370 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:28,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:28,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:28,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:28,370 INFO L87 Difference]: Start difference. First operand 355 states and 462 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:28,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:28,472 INFO L93 Difference]: Finished difference Result 417 states and 543 transitions. [2025-04-30 10:44:28,472 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:28,472 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-04-30 10:44:28,472 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:28,473 INFO L225 Difference]: With dead ends: 417 [2025-04-30 10:44:28,473 INFO L226 Difference]: Without dead ends: 417 [2025-04-30 10:44:28,473 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:28,473 INFO L437 NwaCegarLoop]: 163 mSDtfsCounter, 50 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:28,474 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 357 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:28,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-04-30 10:44:28,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 355. [2025-04-30 10:44:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 290 states have (on average 1.5310344827586206) internal successors, (444), 342 states have internal predecessors, (444), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:28,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 462 transitions. [2025-04-30 10:44:28,479 INFO L79 Accepts]: Start accepts. Automaton has 355 states and 462 transitions. Word has length 26 [2025-04-30 10:44:28,479 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:28,479 INFO L485 AbstractCegarLoop]: Abstraction has 355 states and 462 transitions. [2025-04-30 10:44:28,479 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:28,479 INFO L278 IsEmpty]: Start isEmpty. Operand 355 states and 462 transitions. [2025-04-30 10:44:28,479 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:44:28,480 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:28,480 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-30 10:44:28,480 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-30 10:44:28,480 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:28,480 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:28,480 INFO L85 PathProgramCache]: Analyzing trace with hash 568614064, now seen corresponding path program 1 times [2025-04-30 10:44:28,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:28,480 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482985293] [2025-04-30 10:44:28,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:28,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:28,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:44:28,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:44:28,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:28,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:28,520 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-30 10:44:28,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:28,520 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482985293] [2025-04-30 10:44:28,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482985293] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:28,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:28,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:44:28,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727861106] [2025-04-30 10:44:28,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:28,521 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:28,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:28,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:28,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:28,521 INFO L87 Difference]: Start difference. First operand 355 states and 462 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:28,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:28,539 INFO L93 Difference]: Finished difference Result 298 states and 375 transitions. [2025-04-30 10:44:28,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:44:28,540 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-04-30 10:44:28,540 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:28,540 INFO L225 Difference]: With dead ends: 298 [2025-04-30 10:44:28,540 INFO L226 Difference]: Without dead ends: 298 [2025-04-30 10:44:28,541 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:28,541 INFO L437 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:28,541 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 830 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:28,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-04-30 10:44:28,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2025-04-30 10:44:28,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 234 states have (on average 1.5256410256410255) internal successors, (357), 285 states have internal predecessors, (357), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:28,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 375 transitions. [2025-04-30 10:44:28,547 INFO L79 Accepts]: Start accepts. Automaton has 298 states and 375 transitions. Word has length 26 [2025-04-30 10:44:28,547 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:28,547 INFO L485 AbstractCegarLoop]: Abstraction has 298 states and 375 transitions. [2025-04-30 10:44:28,547 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:28,547 INFO L278 IsEmpty]: Start isEmpty. Operand 298 states and 375 transitions. [2025-04-30 10:44:28,547 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-30 10:44:28,547 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:28,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:28,547 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-30 10:44:28,548 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:28,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:28,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2047004003, now seen corresponding path program 1 times [2025-04-30 10:44:28,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:28,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650788731] [2025-04-30 10:44:28,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:28,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:28,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:44:28,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:44:28,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:28,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:28,621 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-30 10:44:28,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:28,621 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650788731] [2025-04-30 10:44:28,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650788731] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:28,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:28,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:44:28,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271097557] [2025-04-30 10:44:28,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:28,622 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:44:28,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:28,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:44:28,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:44:28,622 INFO L87 Difference]: Start difference. First operand 298 states and 375 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:28,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:28,735 INFO L93 Difference]: Finished difference Result 333 states and 416 transitions. [2025-04-30 10:44:28,735 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:44:28,735 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-04-30 10:44:28,735 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:28,736 INFO L225 Difference]: With dead ends: 333 [2025-04-30 10:44:28,736 INFO L226 Difference]: Without dead ends: 333 [2025-04-30 10:44:28,736 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:44:28,737 INFO L437 NwaCegarLoop]: 157 mSDtfsCounter, 12 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:28,737 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 830 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:28,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-04-30 10:44:28,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 328. [2025-04-30 10:44:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 264 states have (on average 1.4848484848484849) internal successors, (392), 315 states have internal predecessors, (392), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 410 transitions. [2025-04-30 10:44:28,742 INFO L79 Accepts]: Start accepts. Automaton has 328 states and 410 transitions. Word has length 27 [2025-04-30 10:44:28,742 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:28,742 INFO L485 AbstractCegarLoop]: Abstraction has 328 states and 410 transitions. [2025-04-30 10:44:28,742 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:28,742 INFO L278 IsEmpty]: Start isEmpty. Operand 328 states and 410 transitions. [2025-04-30 10:44:28,743 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-30 10:44:28,743 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:28,743 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:28,743 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-30 10:44:28,743 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:28,743 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:28,743 INFO L85 PathProgramCache]: Analyzing trace with hash -2047003809, now seen corresponding path program 1 times [2025-04-30 10:44:28,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:28,743 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446203141] [2025-04-30 10:44:28,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:28,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:28,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:44:28,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:44:28,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:28,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:28,794 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-30 10:44:28,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:28,794 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446203141] [2025-04-30 10:44:28,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446203141] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:28,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:28,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:44:28,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037562485] [2025-04-30 10:44:28,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:28,795 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:44:28,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:28,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:44:28,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:28,795 INFO L87 Difference]: Start difference. First operand 328 states and 410 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:28,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:28,869 INFO L93 Difference]: Finished difference Result 439 states and 550 transitions. [2025-04-30 10:44:28,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:44:28,870 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-04-30 10:44:28,870 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:28,871 INFO L225 Difference]: With dead ends: 439 [2025-04-30 10:44:28,871 INFO L226 Difference]: Without dead ends: 439 [2025-04-30 10:44:28,871 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:28,872 INFO L437 NwaCegarLoop]: 156 mSDtfsCounter, 59 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:28,872 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 535 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:28,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-04-30 10:44:28,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 414. [2025-04-30 10:44:28,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 350 states have (on average 1.4685714285714286) internal successors, (514), 401 states have internal predecessors, (514), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:28,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 532 transitions. [2025-04-30 10:44:28,878 INFO L79 Accepts]: Start accepts. Automaton has 414 states and 532 transitions. Word has length 27 [2025-04-30 10:44:28,878 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:28,879 INFO L485 AbstractCegarLoop]: Abstraction has 414 states and 532 transitions. [2025-04-30 10:44:28,879 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:28,879 INFO L278 IsEmpty]: Start isEmpty. Operand 414 states and 532 transitions. [2025-04-30 10:44:28,879 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-30 10:44:28,879 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:28,879 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:28,879 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-30 10:44:28,879 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:28,880 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:28,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1564076336, now seen corresponding path program 1 times [2025-04-30 10:44:28,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:28,880 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751151816] [2025-04-30 10:44:28,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:28,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:28,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:44:28,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:44:28,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:28,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:28,940 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-30 10:44:28,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:28,940 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751151816] [2025-04-30 10:44:28,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751151816] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:28,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:28,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:28,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070715645] [2025-04-30 10:44:28,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:28,941 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:28,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:28,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:28,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:28,942 INFO L87 Difference]: Start difference. First operand 414 states and 532 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:29,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:29,017 INFO L93 Difference]: Finished difference Result 439 states and 544 transitions. [2025-04-30 10:44:29,017 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:29,017 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-04-30 10:44:29,017 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:29,018 INFO L225 Difference]: With dead ends: 439 [2025-04-30 10:44:29,018 INFO L226 Difference]: Without dead ends: 439 [2025-04-30 10:44:29,019 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:29,019 INFO L437 NwaCegarLoop]: 168 mSDtfsCounter, 57 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:29,019 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 275 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:29,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-04-30 10:44:29,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 327. [2025-04-30 10:44:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 264 states have (on average 1.4621212121212122) internal successors, (386), 314 states have internal predecessors, (386), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 404 transitions. [2025-04-30 10:44:29,027 INFO L79 Accepts]: Start accepts. Automaton has 327 states and 404 transitions. Word has length 28 [2025-04-30 10:44:29,027 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:29,027 INFO L485 AbstractCegarLoop]: Abstraction has 327 states and 404 transitions. [2025-04-30 10:44:29,027 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:29,027 INFO L278 IsEmpty]: Start isEmpty. Operand 327 states and 404 transitions. [2025-04-30 10:44:29,028 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-30 10:44:29,028 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:29,028 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:29,028 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-30 10:44:29,028 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:29,028 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:29,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1970971659, now seen corresponding path program 1 times [2025-04-30 10:44:29,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:29,028 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542542372] [2025-04-30 10:44:29,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:29,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:29,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:44:29,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:44:29,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:29,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:29,088 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-30 10:44:29,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:29,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542542372] [2025-04-30 10:44:29,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542542372] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:29,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:29,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:44:29,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880987922] [2025-04-30 10:44:29,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:29,089 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:29,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:29,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:29,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:29,089 INFO L87 Difference]: Start difference. First operand 327 states and 404 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:29,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:29,199 INFO L93 Difference]: Finished difference Result 328 states and 404 transitions. [2025-04-30 10:44:29,200 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:44:29,200 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2025-04-30 10:44:29,200 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:29,201 INFO L225 Difference]: With dead ends: 328 [2025-04-30 10:44:29,201 INFO L226 Difference]: Without dead ends: 328 [2025-04-30 10:44:29,201 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:29,201 INFO L437 NwaCegarLoop]: 138 mSDtfsCounter, 52 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:29,201 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 528 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:29,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-04-30 10:44:29,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 326. [2025-04-30 10:44:29,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 264 states have (on average 1.4545454545454546) internal successors, (384), 313 states have internal predecessors, (384), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:29,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 402 transitions. [2025-04-30 10:44:29,206 INFO L79 Accepts]: Start accepts. Automaton has 326 states and 402 transitions. Word has length 35 [2025-04-30 10:44:29,206 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:29,206 INFO L485 AbstractCegarLoop]: Abstraction has 326 states and 402 transitions. [2025-04-30 10:44:29,206 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:29,206 INFO L278 IsEmpty]: Start isEmpty. Operand 326 states and 402 transitions. [2025-04-30 10:44:29,207 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-30 10:44:29,207 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:29,207 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:29,207 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-30 10:44:29,207 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:29,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:29,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1970971660, now seen corresponding path program 1 times [2025-04-30 10:44:29,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:29,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000029692] [2025-04-30 10:44:29,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:29,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:29,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:44:29,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:44:29,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:29,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:29,337 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-30 10:44:29,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:29,337 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000029692] [2025-04-30 10:44:29,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000029692] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:29,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:29,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:44:29,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944624284] [2025-04-30 10:44:29,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:29,337 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:29,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:29,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:29,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:29,338 INFO L87 Difference]: Start difference. First operand 326 states and 402 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:29,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:29,449 INFO L93 Difference]: Finished difference Result 327 states and 402 transitions. [2025-04-30 10:44:29,449 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:44:29,450 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2025-04-30 10:44:29,450 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:29,451 INFO L225 Difference]: With dead ends: 327 [2025-04-30 10:44:29,451 INFO L226 Difference]: Without dead ends: 327 [2025-04-30 10:44:29,451 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:29,451 INFO L437 NwaCegarLoop]: 134 mSDtfsCounter, 40 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:29,451 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 532 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:29,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-04-30 10:44:29,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2025-04-30 10:44:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 264 states have (on average 1.446969696969697) internal successors, (382), 312 states have internal predecessors, (382), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 400 transitions. [2025-04-30 10:44:29,458 INFO L79 Accepts]: Start accepts. Automaton has 325 states and 400 transitions. Word has length 35 [2025-04-30 10:44:29,458 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:29,458 INFO L485 AbstractCegarLoop]: Abstraction has 325 states and 400 transitions. [2025-04-30 10:44:29,458 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:29,458 INFO L278 IsEmpty]: Start isEmpty. Operand 325 states and 400 transitions. [2025-04-30 10:44:29,458 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-30 10:44:29,458 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:29,458 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:29,458 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-30 10:44:29,458 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:29,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:29,459 INFO L85 PathProgramCache]: Analyzing trace with hash 23190092, now seen corresponding path program 1 times [2025-04-30 10:44:29,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:29,459 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981353295] [2025-04-30 10:44:29,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:29,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:29,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-30 10:44:29,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:44:29,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:29,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:29,521 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-30 10:44:29,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:29,521 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981353295] [2025-04-30 10:44:29,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981353295] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:29,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:29,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:44:29,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45338911] [2025-04-30 10:44:29,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:29,521 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:44:29,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:29,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:44:29,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:29,522 INFO L87 Difference]: Start difference. First operand 325 states and 400 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:29,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:29,614 INFO L93 Difference]: Finished difference Result 368 states and 450 transitions. [2025-04-30 10:44:29,614 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:44:29,614 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2025-04-30 10:44:29,614 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:29,615 INFO L225 Difference]: With dead ends: 368 [2025-04-30 10:44:29,615 INFO L226 Difference]: Without dead ends: 368 [2025-04-30 10:44:29,616 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:29,617 INFO L437 NwaCegarLoop]: 139 mSDtfsCounter, 66 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:29,618 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 438 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:29,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-04-30 10:44:29,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 322. [2025-04-30 10:44:29,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 264 states have (on average 1.4242424242424243) internal successors, (376), 309 states have internal predecessors, (376), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:29,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 394 transitions. [2025-04-30 10:44:29,625 INFO L79 Accepts]: Start accepts. Automaton has 322 states and 394 transitions. Word has length 37 [2025-04-30 10:44:29,625 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:29,625 INFO L485 AbstractCegarLoop]: Abstraction has 322 states and 394 transitions. [2025-04-30 10:44:29,625 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:29,625 INFO L278 IsEmpty]: Start isEmpty. Operand 322 states and 394 transitions. [2025-04-30 10:44:29,626 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-30 10:44:29,626 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:29,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:29,626 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-30 10:44:29,626 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:29,627 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:29,627 INFO L85 PathProgramCache]: Analyzing trace with hash 23190093, now seen corresponding path program 1 times [2025-04-30 10:44:29,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:29,627 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887022887] [2025-04-30 10:44:29,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:29,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:29,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-30 10:44:29,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:44:29,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:29,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:29,739 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-30 10:44:29,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:29,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887022887] [2025-04-30 10:44:29,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887022887] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:29,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:29,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:44:29,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372276399] [2025-04-30 10:44:29,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:29,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:29,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:29,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:29,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:29,740 INFO L87 Difference]: Start difference. First operand 322 states and 394 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:29,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:29,878 INFO L93 Difference]: Finished difference Result 367 states and 448 transitions. [2025-04-30 10:44:29,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:44:29,879 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2025-04-30 10:44:29,879 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:29,880 INFO L225 Difference]: With dead ends: 367 [2025-04-30 10:44:29,880 INFO L226 Difference]: Without dead ends: 367 [2025-04-30 10:44:29,880 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:44:29,880 INFO L437 NwaCegarLoop]: 131 mSDtfsCounter, 288 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:29,881 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 412 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:29,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-04-30 10:44:29,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 321. [2025-04-30 10:44:29,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 264 states have (on average 1.4166666666666667) internal successors, (374), 308 states have internal predecessors, (374), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:29,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 392 transitions. [2025-04-30 10:44:29,886 INFO L79 Accepts]: Start accepts. Automaton has 321 states and 392 transitions. Word has length 37 [2025-04-30 10:44:29,886 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:29,886 INFO L485 AbstractCegarLoop]: Abstraction has 321 states and 392 transitions. [2025-04-30 10:44:29,886 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:29,886 INFO L278 IsEmpty]: Start isEmpty. Operand 321 states and 392 transitions. [2025-04-30 10:44:29,887 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-30 10:44:29,887 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:29,887 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:29,887 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-30 10:44:29,887 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:29,887 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:29,887 INFO L85 PathProgramCache]: Analyzing trace with hash 23190254, now seen corresponding path program 1 times [2025-04-30 10:44:29,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:29,887 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981969278] [2025-04-30 10:44:29,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:29,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:29,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-30 10:44:29,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:44:29,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:29,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:30,023 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-30 10:44:30,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:30,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981969278] [2025-04-30 10:44:30,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981969278] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:30,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:30,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:44:30,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862267953] [2025-04-30 10:44:30,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:30,025 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:44:30,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:30,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:44:30,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:30,026 INFO L87 Difference]: Start difference. First operand 321 states and 392 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:30,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:30,218 INFO L93 Difference]: Finished difference Result 387 states and 442 transitions. [2025-04-30 10:44:30,218 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:44:30,218 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2025-04-30 10:44:30,218 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:30,219 INFO L225 Difference]: With dead ends: 387 [2025-04-30 10:44:30,219 INFO L226 Difference]: Without dead ends: 387 [2025-04-30 10:44:30,220 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:44:30,220 INFO L437 NwaCegarLoop]: 95 mSDtfsCounter, 169 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:30,220 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 360 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:30,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-04-30 10:44:30,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 321. [2025-04-30 10:44:30,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 264 states have (on average 1.4090909090909092) internal successors, (372), 308 states have internal predecessors, (372), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:30,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 390 transitions. [2025-04-30 10:44:30,228 INFO L79 Accepts]: Start accepts. Automaton has 321 states and 390 transitions. Word has length 37 [2025-04-30 10:44:30,228 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:30,228 INFO L485 AbstractCegarLoop]: Abstraction has 321 states and 390 transitions. [2025-04-30 10:44:30,228 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:30,228 INFO L278 IsEmpty]: Start isEmpty. Operand 321 states and 390 transitions. [2025-04-30 10:44:30,228 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-30 10:44:30,229 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:30,229 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:30,229 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-30 10:44:30,229 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:30,229 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:30,229 INFO L85 PathProgramCache]: Analyzing trace with hash -479570007, now seen corresponding path program 1 times [2025-04-30 10:44:30,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:30,229 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613580126] [2025-04-30 10:44:30,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:30,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:30,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-30 10:44:30,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-30 10:44:30,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:30,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:30,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:30,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:30,332 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613580126] [2025-04-30 10:44:30,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613580126] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:30,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:30,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:44:30,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216471282] [2025-04-30 10:44:30,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:30,333 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:30,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:30,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:30,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:30,333 INFO L87 Difference]: Start difference. First operand 321 states and 390 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:30,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:30,426 INFO L93 Difference]: Finished difference Result 325 states and 394 transitions. [2025-04-30 10:44:30,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:44:30,426 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-04-30 10:44:30,427 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:30,427 INFO L225 Difference]: With dead ends: 325 [2025-04-30 10:44:30,427 INFO L226 Difference]: Without dead ends: 325 [2025-04-30 10:44:30,428 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:44:30,428 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 128 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:30,428 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 275 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:30,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-04-30 10:44:30,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 322. [2025-04-30 10:44:30,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 266 states have (on average 1.406015037593985) internal successors, (374), 309 states have internal predecessors, (374), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:30,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 392 transitions. [2025-04-30 10:44:30,434 INFO L79 Accepts]: Start accepts. Automaton has 322 states and 392 transitions. Word has length 48 [2025-04-30 10:44:30,434 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:30,434 INFO L485 AbstractCegarLoop]: Abstraction has 322 states and 392 transitions. [2025-04-30 10:44:30,434 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:30,434 INFO L278 IsEmpty]: Start isEmpty. Operand 322 states and 392 transitions. [2025-04-30 10:44:30,434 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-30 10:44:30,434 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:30,434 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:30,434 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-30 10:44:30,434 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:30,435 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:30,435 INFO L85 PathProgramCache]: Analyzing trace with hash -479569945, now seen corresponding path program 1 times [2025-04-30 10:44:30,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:30,435 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877272402] [2025-04-30 10:44:30,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:30,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:30,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-30 10:44:30,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-30 10:44:30,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:30,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:30,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:30,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:30,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877272402] [2025-04-30 10:44:30,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877272402] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:30,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:30,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:44:30,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209535012] [2025-04-30 10:44:30,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:30,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:30,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:30,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:30,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:30,541 INFO L87 Difference]: Start difference. First operand 322 states and 392 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:30,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:30,648 INFO L93 Difference]: Finished difference Result 324 states and 392 transitions. [2025-04-30 10:44:30,649 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:44:30,649 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-04-30 10:44:30,649 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:30,650 INFO L225 Difference]: With dead ends: 324 [2025-04-30 10:44:30,650 INFO L226 Difference]: Without dead ends: 324 [2025-04-30 10:44:30,650 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:44:30,650 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 208 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:30,651 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 307 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:30,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-04-30 10:44:30,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 319. [2025-04-30 10:44:30,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 264 states have (on average 1.3977272727272727) internal successors, (369), 306 states have internal predecessors, (369), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:30,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 387 transitions. [2025-04-30 10:44:30,656 INFO L79 Accepts]: Start accepts. Automaton has 319 states and 387 transitions. Word has length 48 [2025-04-30 10:44:30,656 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:30,656 INFO L485 AbstractCegarLoop]: Abstraction has 319 states and 387 transitions. [2025-04-30 10:44:30,656 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:30,656 INFO L278 IsEmpty]: Start isEmpty. Operand 319 states and 387 transitions. [2025-04-30 10:44:30,657 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-30 10:44:30,657 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:30,657 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:30,657 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-30 10:44:30,657 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:30,657 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:30,657 INFO L85 PathProgramCache]: Analyzing trace with hash -198429586, now seen corresponding path program 1 times [2025-04-30 10:44:30,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:30,657 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6579542] [2025-04-30 10:44:30,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:30,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:30,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-30 10:44:30,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:44:30,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:30,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:30,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:44:30,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:30,771 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6579542] [2025-04-30 10:44:30,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6579542] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:30,771 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187119807] [2025-04-30 10:44:30,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:30,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:30,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:30,773 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-30 10:44:30,775 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-30 10:44:30,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-30 10:44:30,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:44:30,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:30,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:30,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-30 10:44:30,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:31,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:31,092 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:31,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187119807] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:31,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:44:31,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2025-04-30 10:44:31,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198862000] [2025-04-30 10:44:31,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:31,092 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:31,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:31,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:31,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:44:31,093 INFO L87 Difference]: Start difference. First operand 319 states and 387 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:44:31,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:31,197 INFO L93 Difference]: Finished difference Result 319 states and 386 transitions. [2025-04-30 10:44:31,197 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:44:31,197 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2025-04-30 10:44:31,197 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:31,198 INFO L225 Difference]: With dead ends: 319 [2025-04-30 10:44:31,198 INFO L226 Difference]: Without dead ends: 319 [2025-04-30 10:44:31,199 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:44:31,199 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 297 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:31,199 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 262 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:31,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-04-30 10:44:31,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 317. [2025-04-30 10:44:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 264 states have (on average 1.3863636363636365) internal successors, (366), 304 states have internal predecessors, (366), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:31,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 384 transitions. [2025-04-30 10:44:31,204 INFO L79 Accepts]: Start accepts. Automaton has 317 states and 384 transitions. Word has length 50 [2025-04-30 10:44:31,204 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:31,204 INFO L485 AbstractCegarLoop]: Abstraction has 317 states and 384 transitions. [2025-04-30 10:44:31,204 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:44:31,204 INFO L278 IsEmpty]: Start isEmpty. Operand 317 states and 384 transitions. [2025-04-30 10:44:31,205 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-30 10:44:31,205 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:31,205 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:31,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:31,406 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,SelfDestructingSolverStorable34 [2025-04-30 10:44:31,406 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:31,406 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:31,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1712267569, now seen corresponding path program 1 times [2025-04-30 10:44:31,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:31,406 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136710970] [2025-04-30 10:44:31,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:31,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:31,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-30 10:44:31,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:44:31,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:31,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:31,532 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:44:31,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:31,533 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136710970] [2025-04-30 10:44:31,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136710970] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:31,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:31,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:44:31,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603037797] [2025-04-30 10:44:31,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:31,533 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:31,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:31,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:31,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:31,534 INFO L87 Difference]: Start difference. First operand 317 states and 384 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:44:31,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:31,634 INFO L93 Difference]: Finished difference Result 318 states and 384 transitions. [2025-04-30 10:44:31,634 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:44:31,634 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2025-04-30 10:44:31,634 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:31,635 INFO L225 Difference]: With dead ends: 318 [2025-04-30 10:44:31,635 INFO L226 Difference]: Without dead ends: 318 [2025-04-30 10:44:31,635 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:44:31,636 INFO L437 NwaCegarLoop]: 125 mSDtfsCounter, 135 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:31,636 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 314 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:31,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-04-30 10:44:31,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 316. [2025-04-30 10:44:31,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 264 states have (on average 1.378787878787879) internal successors, (364), 303 states have internal predecessors, (364), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:31,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 382 transitions. [2025-04-30 10:44:31,641 INFO L79 Accepts]: Start accepts. Automaton has 316 states and 382 transitions. Word has length 52 [2025-04-30 10:44:31,641 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:31,641 INFO L485 AbstractCegarLoop]: Abstraction has 316 states and 382 transitions. [2025-04-30 10:44:31,641 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:44:31,641 INFO L278 IsEmpty]: Start isEmpty. Operand 316 states and 382 transitions. [2025-04-30 10:44:31,641 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-30 10:44:31,641 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:31,641 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:31,641 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-30 10:44:31,642 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:31,642 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:31,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1808646971, now seen corresponding path program 1 times [2025-04-30 10:44:31,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:31,642 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884654010] [2025-04-30 10:44:31,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:31,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:31,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:44:31,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:44:31,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:31,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:32,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:32,223 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884654010] [2025-04-30 10:44:32,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884654010] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:32,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:32,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-30 10:44:32,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945303825] [2025-04-30 10:44:32,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:32,224 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:44:32,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:32,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:44:32,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:44:32,225 INFO L87 Difference]: Start difference. First operand 316 states and 382 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:32,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:32,635 INFO L93 Difference]: Finished difference Result 347 states and 414 transitions. [2025-04-30 10:44:32,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:44:32,636 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-04-30 10:44:32,636 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:32,637 INFO L225 Difference]: With dead ends: 347 [2025-04-30 10:44:32,637 INFO L226 Difference]: Without dead ends: 347 [2025-04-30 10:44:32,637 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:44:32,637 INFO L437 NwaCegarLoop]: 135 mSDtfsCounter, 79 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:32,637 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 960 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:32,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-04-30 10:44:32,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 340. [2025-04-30 10:44:32,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 288 states have (on average 1.3506944444444444) internal successors, (389), 327 states have internal predecessors, (389), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:32,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 407 transitions. [2025-04-30 10:44:32,643 INFO L79 Accepts]: Start accepts. Automaton has 340 states and 407 transitions. Word has length 51 [2025-04-30 10:44:32,643 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:32,643 INFO L485 AbstractCegarLoop]: Abstraction has 340 states and 407 transitions. [2025-04-30 10:44:32,643 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:32,643 INFO L278 IsEmpty]: Start isEmpty. Operand 340 states and 407 transitions. [2025-04-30 10:44:32,644 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-30 10:44:32,644 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:32,644 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:32,644 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-30 10:44:32,644 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:32,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:32,645 INFO L85 PathProgramCache]: Analyzing trace with hash 862114051, now seen corresponding path program 1 times [2025-04-30 10:44:32,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:32,645 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457818833] [2025-04-30 10:44:32,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:32,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:32,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-30 10:44:32,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:44:32,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:32,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:33,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:33,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:33,123 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457818833] [2025-04-30 10:44:33,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457818833] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:33,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:33,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-30 10:44:33,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95848633] [2025-04-30 10:44:33,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:33,123 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:44:33,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:33,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:44:33,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:44:33,124 INFO L87 Difference]: Start difference. First operand 340 states and 407 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:33,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:33,590 INFO L93 Difference]: Finished difference Result 448 states and 504 transitions. [2025-04-30 10:44:33,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:44:33,591 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2025-04-30 10:44:33,591 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:33,592 INFO L225 Difference]: With dead ends: 448 [2025-04-30 10:44:33,592 INFO L226 Difference]: Without dead ends: 448 [2025-04-30 10:44:33,592 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2025-04-30 10:44:33,592 INFO L437 NwaCegarLoop]: 102 mSDtfsCounter, 243 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:33,592 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1058 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:44:33,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-04-30 10:44:33,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 372. [2025-04-30 10:44:33,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 320 states have (on average 1.33125) internal successors, (426), 359 states have internal predecessors, (426), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:33,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 444 transitions. [2025-04-30 10:44:33,602 INFO L79 Accepts]: Start accepts. Automaton has 372 states and 444 transitions. Word has length 52 [2025-04-30 10:44:33,602 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:33,602 INFO L485 AbstractCegarLoop]: Abstraction has 372 states and 444 transitions. [2025-04-30 10:44:33,602 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:33,603 INFO L278 IsEmpty]: Start isEmpty. Operand 372 states and 444 transitions. [2025-04-30 10:44:33,603 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-30 10:44:33,603 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:33,603 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:33,603 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-30 10:44:33,603 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:33,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:33,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1991323754, now seen corresponding path program 1 times [2025-04-30 10:44:33,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:33,604 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68445976] [2025-04-30 10:44:33,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:33,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:33,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-30 10:44:33,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:44:33,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:33,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:34,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:34,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:34,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68445976] [2025-04-30 10:44:34,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68445976] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:34,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:34,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-04-30 10:44:34,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229813122] [2025-04-30 10:44:34,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:34,258 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-30 10:44:34,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:34,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-30 10:44:34,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:44:34,259 INFO L87 Difference]: Start difference. First operand 372 states and 444 transitions. Second operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:34,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:34,862 INFO L93 Difference]: Finished difference Result 451 states and 509 transitions. [2025-04-30 10:44:34,862 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:44:34,862 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2025-04-30 10:44:34,862 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:34,863 INFO L225 Difference]: With dead ends: 451 [2025-04-30 10:44:34,863 INFO L226 Difference]: Without dead ends: 451 [2025-04-30 10:44:34,863 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2025-04-30 10:44:34,864 INFO L437 NwaCegarLoop]: 125 mSDtfsCounter, 265 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:34,864 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 1445 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:44:34,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-04-30 10:44:34,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 345. [2025-04-30 10:44:34,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 293 states have (on average 1.341296928327645) internal successors, (393), 332 states have internal predecessors, (393), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:34,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 411 transitions. [2025-04-30 10:44:34,868 INFO L79 Accepts]: Start accepts. Automaton has 345 states and 411 transitions. Word has length 52 [2025-04-30 10:44:34,868 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:34,868 INFO L485 AbstractCegarLoop]: Abstraction has 345 states and 411 transitions. [2025-04-30 10:44:34,868 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:34,868 INFO L278 IsEmpty]: Start isEmpty. Operand 345 states and 411 transitions. [2025-04-30 10:44:34,868 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-30 10:44:34,868 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:34,869 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:34,869 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-30 10:44:34,869 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:34,869 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:34,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1090225779, now seen corresponding path program 1 times [2025-04-30 10:44:34,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:34,869 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836506210] [2025-04-30 10:44:34,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:34,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:34,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:44:34,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:44:34,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:34,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:35,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:35,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:35,258 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836506210] [2025-04-30 10:44:35,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836506210] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:35,258 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029075939] [2025-04-30 10:44:35,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:35,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:35,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:35,260 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-30 10:44:35,261 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-30 10:44:35,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:44:35,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:44:35,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:35,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:35,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-30 10:44:35,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:35,669 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 11 treesize of output 7 [2025-04-30 10:44:35,728 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 26 treesize of output 21 [2025-04-30 10:44:35,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:44:35,921 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:44:35,921 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2025-04-30 10:44:35,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:35,925 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:35,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029075939] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:35,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:44:35,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 22 [2025-04-30 10:44:35,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124650402] [2025-04-30 10:44:35,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:35,925 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:44:35,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:35,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:44:35,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:44:35,926 INFO L87 Difference]: Start difference. First operand 345 states and 411 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:36,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:36,284 INFO L93 Difference]: Finished difference Result 565 states and 680 transitions. [2025-04-30 10:44:36,284 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:44:36,284 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-04-30 10:44:36,284 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:36,286 INFO L225 Difference]: With dead ends: 565 [2025-04-30 10:44:36,286 INFO L226 Difference]: Without dead ends: 565 [2025-04-30 10:44:36,286 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2025-04-30 10:44:36,286 INFO L437 NwaCegarLoop]: 153 mSDtfsCounter, 378 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:36,286 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1357 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 516 Invalid, 1 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:44:36,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-04-30 10:44:36,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 427. [2025-04-30 10:44:36,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 367 states have (on average 1.3623978201634876) internal successors, (500), 410 states have internal predecessors, (500), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2025-04-30 10:44:36,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 530 transitions. [2025-04-30 10:44:36,292 INFO L79 Accepts]: Start accepts. Automaton has 427 states and 530 transitions. Word has length 53 [2025-04-30 10:44:36,293 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:36,293 INFO L485 AbstractCegarLoop]: Abstraction has 427 states and 530 transitions. [2025-04-30 10:44:36,293 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:36,293 INFO L278 IsEmpty]: Start isEmpty. Operand 427 states and 530 transitions. [2025-04-30 10:44:36,294 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-30 10:44:36,294 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:36,294 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:36,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:36,498 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,SelfDestructingSolverStorable39 [2025-04-30 10:44:36,498 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:36,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:36,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1090226163, now seen corresponding path program 1 times [2025-04-30 10:44:36,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:36,498 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964738672] [2025-04-30 10:44:36,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:36,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:36,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:44:36,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:44:36,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:36,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:36,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:36,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:36,937 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964738672] [2025-04-30 10:44:36,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964738672] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:36,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:36,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-04-30 10:44:36,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140233261] [2025-04-30 10:44:36,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:36,937 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-30 10:44:36,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:36,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-30 10:44:36,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:44:36,938 INFO L87 Difference]: Start difference. First operand 427 states and 530 transitions. Second operand has 17 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:37,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:37,405 INFO L93 Difference]: Finished difference Result 841 states and 1057 transitions. [2025-04-30 10:44:37,405 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-30 10:44:37,405 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-04-30 10:44:37,405 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:37,407 INFO L225 Difference]: With dead ends: 841 [2025-04-30 10:44:37,407 INFO L226 Difference]: Without dead ends: 841 [2025-04-30 10:44:37,407 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2025-04-30 10:44:37,408 INFO L437 NwaCegarLoop]: 143 mSDtfsCounter, 402 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1637 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:37,408 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1637 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:44:37,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2025-04-30 10:44:37,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 642. [2025-04-30 10:44:37,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 567 states have (on average 1.3562610229276897) internal successors, (769), 617 states have internal predecessors, (769), 18 states have call successors, (18), 9 states have call predecessors, (18), 18 states have return successors, (36), 15 states have call predecessors, (36), 18 states have call successors, (36) [2025-04-30 10:44:37,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 823 transitions. [2025-04-30 10:44:37,416 INFO L79 Accepts]: Start accepts. Automaton has 642 states and 823 transitions. Word has length 53 [2025-04-30 10:44:37,416 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:37,416 INFO L485 AbstractCegarLoop]: Abstraction has 642 states and 823 transitions. [2025-04-30 10:44:37,416 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:37,417 INFO L278 IsEmpty]: Start isEmpty. Operand 642 states and 823 transitions. [2025-04-30 10:44:37,417 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-30 10:44:37,417 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:37,417 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:37,417 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-30 10:44:37,417 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:37,418 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:37,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1090226162, now seen corresponding path program 1 times [2025-04-30 10:44:37,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:37,418 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7038168] [2025-04-30 10:44:37,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:37,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:37,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:44:37,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:44:37,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:37,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:38,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:38,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:38,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7038168] [2025-04-30 10:44:38,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7038168] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:38,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:38,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-04-30 10:44:38,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811130367] [2025-04-30 10:44:38,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:38,051 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:44:38,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:38,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:44:38,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:44:38,052 INFO L87 Difference]: Start difference. First operand 642 states and 823 transitions. Second operand has 18 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:38,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:38,718 INFO L93 Difference]: Finished difference Result 921 states and 1169 transitions. [2025-04-30 10:44:38,718 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-30 10:44:38,718 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-04-30 10:44:38,718 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:38,720 INFO L225 Difference]: With dead ends: 921 [2025-04-30 10:44:38,720 INFO L226 Difference]: Without dead ends: 921 [2025-04-30 10:44:38,720 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2025-04-30 10:44:38,721 INFO L437 NwaCegarLoop]: 137 mSDtfsCounter, 453 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:38,721 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1818 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-30 10:44:38,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2025-04-30 10:44:38,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 739. [2025-04-30 10:44:38,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 656 states have (on average 1.3795731707317074) internal successors, (905), 710 states have internal predecessors, (905), 22 states have call successors, (22), 11 states have call predecessors, (22), 22 states have return successors, (44), 17 states have call predecessors, (44), 22 states have call successors, (44) [2025-04-30 10:44:38,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 971 transitions. [2025-04-30 10:44:38,736 INFO L79 Accepts]: Start accepts. Automaton has 739 states and 971 transitions. Word has length 53 [2025-04-30 10:44:38,736 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:38,736 INFO L485 AbstractCegarLoop]: Abstraction has 739 states and 971 transitions. [2025-04-30 10:44:38,736 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:38,736 INFO L278 IsEmpty]: Start isEmpty. Operand 739 states and 971 transitions. [2025-04-30 10:44:38,737 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-30 10:44:38,737 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:38,737 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:38,737 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-04-30 10:44:38,737 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:38,738 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:38,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1088378737, now seen corresponding path program 1 times [2025-04-30 10:44:38,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:38,738 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47524568] [2025-04-30 10:44:38,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:38,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:38,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:44:38,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:44:38,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:38,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:38,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:38,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:38,901 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47524568] [2025-04-30 10:44:38,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47524568] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:38,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:38,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:44:38,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428023957] [2025-04-30 10:44:38,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:38,902 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:44:38,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:38,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:44:38,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:44:38,904 INFO L87 Difference]: Start difference. First operand 739 states and 971 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:39,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:39,120 INFO L93 Difference]: Finished difference Result 1097 states and 1437 transitions. [2025-04-30 10:44:39,121 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:44:39,121 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-04-30 10:44:39,121 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:39,123 INFO L225 Difference]: With dead ends: 1097 [2025-04-30 10:44:39,123 INFO L226 Difference]: Without dead ends: 1097 [2025-04-30 10:44:39,123 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:44:39,124 INFO L437 NwaCegarLoop]: 164 mSDtfsCounter, 158 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:39,124 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1314 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:39,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2025-04-30 10:44:39,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 909. [2025-04-30 10:44:39,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 806 states have (on average 1.3908188585607941) internal successors, (1121), 870 states have internal predecessors, (1121), 32 states have call successors, (32), 16 states have call predecessors, (32), 32 states have return successors, (64), 22 states have call predecessors, (64), 32 states have call successors, (64) [2025-04-30 10:44:39,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1217 transitions. [2025-04-30 10:44:39,137 INFO L79 Accepts]: Start accepts. Automaton has 909 states and 1217 transitions. Word has length 53 [2025-04-30 10:44:39,137 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:39,137 INFO L485 AbstractCegarLoop]: Abstraction has 909 states and 1217 transitions. [2025-04-30 10:44:39,137 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:39,137 INFO L278 IsEmpty]: Start isEmpty. Operand 909 states and 1217 transitions. [2025-04-30 10:44:39,138 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-30 10:44:39,138 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:39,138 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:39,138 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-04-30 10:44:39,139 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:39,139 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:39,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1088379121, now seen corresponding path program 1 times [2025-04-30 10:44:39,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:39,139 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492054806] [2025-04-30 10:44:39,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:39,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:39,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:44:39,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:44:39,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:39,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:39,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:39,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:39,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492054806] [2025-04-30 10:44:39,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492054806] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:39,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948132154] [2025-04-30 10:44:39,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:39,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:39,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:39,396 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-30 10:44:39,397 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-30 10:44:39,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:44:39,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:44:39,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:39,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:39,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-30 10:44:39,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:39,721 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-30 10:44:39,839 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:44:39,840 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-04-30 10:44:39,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:39,845 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:39,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948132154] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:39,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:44:39,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2025-04-30 10:44:39,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982367798] [2025-04-30 10:44:39,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:39,845 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:44:39,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:39,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:44:39,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:44:39,845 INFO L87 Difference]: Start difference. First operand 909 states and 1217 transitions. Second operand has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:40,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:40,105 INFO L93 Difference]: Finished difference Result 1129 states and 1491 transitions. [2025-04-30 10:44:40,105 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:44:40,105 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-04-30 10:44:40,105 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:40,107 INFO L225 Difference]: With dead ends: 1129 [2025-04-30 10:44:40,107 INFO L226 Difference]: Without dead ends: 1129 [2025-04-30 10:44:40,108 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:44:40,108 INFO L437 NwaCegarLoop]: 161 mSDtfsCounter, 329 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:40,108 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 897 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:40,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2025-04-30 10:44:40,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 940. [2025-04-30 10:44:40,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 833 states have (on average 1.39015606242497) internal successors, (1158), 899 states have internal predecessors, (1158), 34 states have call successors, (34), 17 states have call predecessors, (34), 34 states have return successors, (68), 23 states have call predecessors, (68), 34 states have call successors, (68) [2025-04-30 10:44:40,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1260 transitions. [2025-04-30 10:44:40,117 INFO L79 Accepts]: Start accepts. Automaton has 940 states and 1260 transitions. Word has length 53 [2025-04-30 10:44:40,118 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:40,118 INFO L485 AbstractCegarLoop]: Abstraction has 940 states and 1260 transitions. [2025-04-30 10:44:40,118 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:40,118 INFO L278 IsEmpty]: Start isEmpty. Operand 940 states and 1260 transitions. [2025-04-30 10:44:40,118 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-30 10:44:40,118 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:40,118 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:40,125 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-30 10:44:40,321 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:40,322 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:40,323 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:40,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1088379120, now seen corresponding path program 1 times [2025-04-30 10:44:40,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:40,323 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665483355] [2025-04-30 10:44:40,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:40,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:40,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:44:40,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:44:40,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:40,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:41,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:41,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:41,236 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665483355] [2025-04-30 10:44:41,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665483355] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:41,236 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964539972] [2025-04-30 10:44:41,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:41,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:41,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:41,237 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-30 10:44:41,239 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-30 10:44:41,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:44:41,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:44:41,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:41,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:41,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-30 10:44:41,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:41,399 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-30 10:44:41,729 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-30 10:44:41,732 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-30 10:44:41,919 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:44:41,920 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-04-30 10:44:41,925 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:44:41,925 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-30 10:44:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:41,962 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:41,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964539972] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:41,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:44:41,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 28 [2025-04-30 10:44:41,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87394675] [2025-04-30 10:44:41,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:41,962 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:44:41,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:41,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:44:41,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2025-04-30 10:44:41,963 INFO L87 Difference]: Start difference. First operand 940 states and 1260 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:42,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:42,351 INFO L93 Difference]: Finished difference Result 1122 states and 1467 transitions. [2025-04-30 10:44:42,351 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:44:42,351 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-04-30 10:44:42,351 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:42,354 INFO L225 Difference]: With dead ends: 1122 [2025-04-30 10:44:42,354 INFO L226 Difference]: Without dead ends: 1122 [2025-04-30 10:44:42,354 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2025-04-30 10:44:42,354 INFO L437 NwaCegarLoop]: 146 mSDtfsCounter, 276 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:42,354 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 1103 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:44:42,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2025-04-30 10:44:42,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 935. [2025-04-30 10:44:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 828 states have (on average 1.3900966183574879) internal successors, (1151), 894 states have internal predecessors, (1151), 34 states have call successors, (34), 17 states have call predecessors, (34), 34 states have return successors, (68), 23 states have call predecessors, (68), 34 states have call successors, (68) [2025-04-30 10:44:42,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1253 transitions. [2025-04-30 10:44:42,365 INFO L79 Accepts]: Start accepts. Automaton has 935 states and 1253 transitions. Word has length 53 [2025-04-30 10:44:42,365 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:42,366 INFO L485 AbstractCegarLoop]: Abstraction has 935 states and 1253 transitions. [2025-04-30 10:44:42,366 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:42,366 INFO L278 IsEmpty]: Start isEmpty. Operand 935 states and 1253 transitions. [2025-04-30 10:44:42,366 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-30 10:44:42,366 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:42,366 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:42,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:44:42,567 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:42,567 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:42,567 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:42,568 INFO L85 PathProgramCache]: Analyzing trace with hash -884334006, now seen corresponding path program 1 times [2025-04-30 10:44:42,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:42,568 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625784657] [2025-04-30 10:44:42,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:42,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:42,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:44:42,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:44:42,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:42,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:42,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:42,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:42,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625784657] [2025-04-30 10:44:42,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625784657] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:42,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:42,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-30 10:44:42,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000590821] [2025-04-30 10:44:42,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:42,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:44:42,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:42,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:44:42,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:44:42,741 INFO L87 Difference]: Start difference. First operand 935 states and 1253 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:42,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:42,980 INFO L93 Difference]: Finished difference Result 1309 states and 1736 transitions. [2025-04-30 10:44:42,981 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:44:42,981 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-04-30 10:44:42,981 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:42,984 INFO L225 Difference]: With dead ends: 1309 [2025-04-30 10:44:42,984 INFO L226 Difference]: Without dead ends: 1309 [2025-04-30 10:44:42,984 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:44:42,984 INFO L437 NwaCegarLoop]: 153 mSDtfsCounter, 300 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:42,985 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1230 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:42,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2025-04-30 10:44:42,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1105. [2025-04-30 10:44:42,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 978 states have (on average 1.3977505112474438) internal successors, (1367), 1054 states have internal predecessors, (1367), 44 states have call successors, (44), 22 states have call predecessors, (44), 44 states have return successors, (88), 28 states have call predecessors, (88), 44 states have call successors, (88) [2025-04-30 10:44:42,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1499 transitions. [2025-04-30 10:44:42,999 INFO L79 Accepts]: Start accepts. Automaton has 1105 states and 1499 transitions. Word has length 53 [2025-04-30 10:44:42,999 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:42,999 INFO L485 AbstractCegarLoop]: Abstraction has 1105 states and 1499 transitions. [2025-04-30 10:44:42,999 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:43,000 INFO L278 IsEmpty]: Start isEmpty. Operand 1105 states and 1499 transitions. [2025-04-30 10:44:43,000 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-30 10:44:43,000 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:43,000 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:43,000 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-04-30 10:44:43,000 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:43,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:43,001 INFO L85 PathProgramCache]: Analyzing trace with hash -884334390, now seen corresponding path program 1 times [2025-04-30 10:44:43,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:43,001 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660379784] [2025-04-30 10:44:43,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:43,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:43,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:44:43,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:44:43,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:43,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:43,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:43,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:43,199 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660379784] [2025-04-30 10:44:43,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660379784] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:43,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:43,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-30 10:44:43,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091598200] [2025-04-30 10:44:43,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:43,199 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:44:43,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:43,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:44:43,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:44:43,200 INFO L87 Difference]: Start difference. First operand 1105 states and 1499 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:43,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:43,452 INFO L93 Difference]: Finished difference Result 1349 states and 1813 transitions. [2025-04-30 10:44:43,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:44:43,453 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-04-30 10:44:43,453 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:43,456 INFO L225 Difference]: With dead ends: 1349 [2025-04-30 10:44:43,456 INFO L226 Difference]: Without dead ends: 1349 [2025-04-30 10:44:43,456 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:44:43,457 INFO L437 NwaCegarLoop]: 142 mSDtfsCounter, 360 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:43,457 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1039 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:43,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2025-04-30 10:44:43,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1136. [2025-04-30 10:44:43,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 1005 states have (on average 1.3970149253731343) internal successors, (1404), 1083 states have internal predecessors, (1404), 46 states have call successors, (46), 23 states have call predecessors, (46), 46 states have return successors, (92), 29 states have call predecessors, (92), 46 states have call successors, (92) [2025-04-30 10:44:43,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1542 transitions. [2025-04-30 10:44:43,468 INFO L79 Accepts]: Start accepts. Automaton has 1136 states and 1542 transitions. Word has length 53 [2025-04-30 10:44:43,468 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:43,468 INFO L485 AbstractCegarLoop]: Abstraction has 1136 states and 1542 transitions. [2025-04-30 10:44:43,468 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:43,468 INFO L278 IsEmpty]: Start isEmpty. Operand 1136 states and 1542 transitions. [2025-04-30 10:44:43,469 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-30 10:44:43,469 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:43,469 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:43,469 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-04-30 10:44:43,469 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:43,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:43,469 INFO L85 PathProgramCache]: Analyzing trace with hash -884334389, now seen corresponding path program 1 times [2025-04-30 10:44:43,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:43,469 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574019960] [2025-04-30 10:44:43,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:43,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:43,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:44:43,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:44:43,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:43,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:43,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:43,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:43,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574019960] [2025-04-30 10:44:43,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574019960] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:43,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:43,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-30 10:44:43,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326347578] [2025-04-30 10:44:43,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:43,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:44:43,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:43,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:44:43,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:44:43,740 INFO L87 Difference]: Start difference. First operand 1136 states and 1542 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:44,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:44,091 INFO L93 Difference]: Finished difference Result 1325 states and 1758 transitions. [2025-04-30 10:44:44,091 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:44:44,091 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-04-30 10:44:44,091 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:44,094 INFO L225 Difference]: With dead ends: 1325 [2025-04-30 10:44:44,094 INFO L226 Difference]: Without dead ends: 1325 [2025-04-30 10:44:44,094 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:44:44,094 INFO L437 NwaCegarLoop]: 137 mSDtfsCounter, 343 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:44,094 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1153 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:44:44,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2025-04-30 10:44:44,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 910. [2025-04-30 10:44:44,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 803 states have (on average 1.398505603985056) internal successors, (1123), 869 states have internal predecessors, (1123), 34 states have call successors, (34), 17 states have call predecessors, (34), 34 states have return successors, (68), 23 states have call predecessors, (68), 34 states have call successors, (68) [2025-04-30 10:44:44,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1225 transitions. [2025-04-30 10:44:44,105 INFO L79 Accepts]: Start accepts. Automaton has 910 states and 1225 transitions. Word has length 53 [2025-04-30 10:44:44,105 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:44,105 INFO L485 AbstractCegarLoop]: Abstraction has 910 states and 1225 transitions. [2025-04-30 10:44:44,105 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:44,105 INFO L278 IsEmpty]: Start isEmpty. Operand 910 states and 1225 transitions. [2025-04-30 10:44:44,105 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-30 10:44:44,105 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:44,106 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:44,106 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-04-30 10:44:44,106 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:44,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:44,106 INFO L85 PathProgramCache]: Analyzing trace with hash -882486964, now seen corresponding path program 1 times [2025-04-30 10:44:44,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:44,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047544849] [2025-04-30 10:44:44,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:44,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:44,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:44:44,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:44:44,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:44,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:44,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:44,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:44,226 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047544849] [2025-04-30 10:44:44,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047544849] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:44,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:44,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:44:44,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515083785] [2025-04-30 10:44:44,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:44,226 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:44:44,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:44,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:44:44,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:44,226 INFO L87 Difference]: Start difference. First operand 910 states and 1225 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:44,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:44,408 INFO L93 Difference]: Finished difference Result 1137 states and 1507 transitions. [2025-04-30 10:44:44,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:44:44,408 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-04-30 10:44:44,408 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:44,411 INFO L225 Difference]: With dead ends: 1137 [2025-04-30 10:44:44,411 INFO L226 Difference]: Without dead ends: 1137 [2025-04-30 10:44:44,411 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:44:44,411 INFO L437 NwaCegarLoop]: 229 mSDtfsCounter, 138 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:44,411 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1316 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:44,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2025-04-30 10:44:44,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 784. [2025-04-30 10:44:44,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 693 states have (on average 1.3982683982683983) internal successors, (969), 751 states have internal predecessors, (969), 26 states have call successors, (26), 13 states have call predecessors, (26), 26 states have return successors, (52), 19 states have call predecessors, (52), 26 states have call successors, (52) [2025-04-30 10:44:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1047 transitions. [2025-04-30 10:44:44,420 INFO L79 Accepts]: Start accepts. Automaton has 784 states and 1047 transitions. Word has length 53 [2025-04-30 10:44:44,420 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:44,420 INFO L485 AbstractCegarLoop]: Abstraction has 784 states and 1047 transitions. [2025-04-30 10:44:44,421 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:44,421 INFO L278 IsEmpty]: Start isEmpty. Operand 784 states and 1047 transitions. [2025-04-30 10:44:44,421 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-30 10:44:44,421 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:44,421 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:44,421 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-04-30 10:44:44,421 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:44,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:44,421 INFO L85 PathProgramCache]: Analyzing trace with hash -882487348, now seen corresponding path program 1 times [2025-04-30 10:44:44,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:44,422 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256617369] [2025-04-30 10:44:44,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:44,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:44,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:44:44,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:44:44,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:44,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:44,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:44,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:44,728 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256617369] [2025-04-30 10:44:44,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256617369] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:44,728 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010020561] [2025-04-30 10:44:44,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:44,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:44,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:44,730 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-30 10:44:44,731 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-30 10:44:44,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:44:44,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:44:44,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:44,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:44,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-04-30 10:44:44,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:44,891 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-30 10:44:45,092 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-30 10:44:45,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:44:45,134 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 15 [2025-04-30 10:44:45,199 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 21 treesize of output 9 [2025-04-30 10:44:45,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:45,202 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:45,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010020561] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:45,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:44:45,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 22 [2025-04-30 10:44:45,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66332872] [2025-04-30 10:44:45,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:45,203 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:44:45,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:45,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:44:45,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:44:45,203 INFO L87 Difference]: Start difference. First operand 784 states and 1047 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:45,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:45,689 INFO L93 Difference]: Finished difference Result 1194 states and 1568 transitions. [2025-04-30 10:44:45,690 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:44:45,690 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-04-30 10:44:45,690 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:45,692 INFO L225 Difference]: With dead ends: 1194 [2025-04-30 10:44:45,692 INFO L226 Difference]: Without dead ends: 1194 [2025-04-30 10:44:45,693 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2025-04-30 10:44:45,693 INFO L437 NwaCegarLoop]: 265 mSDtfsCounter, 267 mSDsluCounter, 1736 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 2001 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:45,693 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 2001 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:44:45,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2025-04-30 10:44:45,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 967. [2025-04-30 10:44:45,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 860 states have (on average 1.3872093023255814) internal successors, (1193), 926 states have internal predecessors, (1193), 34 states have call successors, (34), 17 states have call predecessors, (34), 34 states have return successors, (68), 23 states have call predecessors, (68), 34 states have call successors, (68) [2025-04-30 10:44:45,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1295 transitions. [2025-04-30 10:44:45,704 INFO L79 Accepts]: Start accepts. Automaton has 967 states and 1295 transitions. Word has length 53 [2025-04-30 10:44:45,704 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:45,704 INFO L485 AbstractCegarLoop]: Abstraction has 967 states and 1295 transitions. [2025-04-30 10:44:45,704 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:45,704 INFO L278 IsEmpty]: Start isEmpty. Operand 967 states and 1295 transitions. [2025-04-30 10:44:45,705 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-30 10:44:45,705 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:45,705 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:45,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-30 10:44:45,905 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-04-30 10:44:45,905 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:45,906 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:45,906 INFO L85 PathProgramCache]: Analyzing trace with hash -882487347, now seen corresponding path program 1 times [2025-04-30 10:44:45,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:45,906 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346961168] [2025-04-30 10:44:45,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:45,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:45,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:44:45,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:44:45,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:45,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:46,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:46,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:46,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346961168] [2025-04-30 10:44:46,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346961168] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:46,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421831603] [2025-04-30 10:44:46,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:46,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:46,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:46,320 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:46,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:44:46,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:44:46,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:44:46,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:46,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:46,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-04-30 10:44:46,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:46,501 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-30 10:44:46,749 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-30 10:44:46,754 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-30 10:44:46,815 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 25 treesize of output 13 [2025-04-30 10:44:46,820 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 23 treesize of output 11 [2025-04-30 10:44:46,930 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 17 treesize of output 9 [2025-04-30 10:44:46,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:46,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:46,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421831603] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:46,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:44:46,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 23 [2025-04-30 10:44:46,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431768660] [2025-04-30 10:44:46,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:46,973 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:44:46,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:46,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:44:46,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2025-04-30 10:44:46,973 INFO L87 Difference]: Start difference. First operand 967 states and 1295 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:47,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:47,459 INFO L93 Difference]: Finished difference Result 1275 states and 1681 transitions. [2025-04-30 10:44:47,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:44:47,459 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-04-30 10:44:47,459 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:47,462 INFO L225 Difference]: With dead ends: 1275 [2025-04-30 10:44:47,462 INFO L226 Difference]: Without dead ends: 1275 [2025-04-30 10:44:47,462 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2025-04-30 10:44:47,462 INFO L437 NwaCegarLoop]: 278 mSDtfsCounter, 302 mSDsluCounter, 1719 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 1997 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:47,463 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 1997 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:44:47,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2025-04-30 10:44:47,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 952. [2025-04-30 10:44:47,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 849 states have (on average 1.39811542991755) internal successors, (1187), 913 states have internal predecessors, (1187), 32 states have call successors, (32), 16 states have call predecessors, (32), 32 states have return successors, (64), 22 states have call predecessors, (64), 32 states have call successors, (64) [2025-04-30 10:44:47,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1283 transitions. [2025-04-30 10:44:47,473 INFO L79 Accepts]: Start accepts. Automaton has 952 states and 1283 transitions. Word has length 53 [2025-04-30 10:44:47,473 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:47,473 INFO L485 AbstractCegarLoop]: Abstraction has 952 states and 1283 transitions. [2025-04-30 10:44:47,473 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:47,473 INFO L278 IsEmpty]: Start isEmpty. Operand 952 states and 1283 transitions. [2025-04-30 10:44:47,473 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-30 10:44:47,473 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:47,474 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:47,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-30 10:44:47,674 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:47,674 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:47,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:47,674 INFO L85 PathProgramCache]: Analyzing trace with hash -384687225, now seen corresponding path program 1 times [2025-04-30 10:44:47,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:47,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723430885] [2025-04-30 10:44:47,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:47,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:47,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-30 10:44:47,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-30 10:44:47,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:47,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:48,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:48,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:48,015 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723430885] [2025-04-30 10:44:48,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723430885] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:48,016 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287079835] [2025-04-30 10:44:48,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:48,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:48,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:48,017 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:48,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-30 10:44:48,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-30 10:44:48,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-30 10:44:48,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:48,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:48,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-30 10:44:48,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:48,349 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-30 10:44:48,394 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 22 [2025-04-30 10:44:48,525 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:44:48,525 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2025-04-30 10:44:48,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:48,531 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:48,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287079835] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:48,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:44:48,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 21 [2025-04-30 10:44:48,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937616870] [2025-04-30 10:44:48,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:48,531 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:44:48,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:48,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:44:48,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:44:48,532 INFO L87 Difference]: Start difference. First operand 952 states and 1283 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:48,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:48,837 INFO L93 Difference]: Finished difference Result 1260 states and 1672 transitions. [2025-04-30 10:44:48,837 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:44:48,837 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-04-30 10:44:48,837 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:48,839 INFO L225 Difference]: With dead ends: 1260 [2025-04-30 10:44:48,839 INFO L226 Difference]: Without dead ends: 1260 [2025-04-30 10:44:48,840 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2025-04-30 10:44:48,840 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 282 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:48,840 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 884 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 432 Invalid, 1 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:48,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2025-04-30 10:44:48,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1062. [2025-04-30 10:44:48,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 947 states have (on average 1.399155227032735) internal successors, (1325), 1017 states have internal predecessors, (1325), 38 states have call successors, (38), 19 states have call predecessors, (38), 38 states have return successors, (76), 25 states have call predecessors, (76), 38 states have call successors, (76) [2025-04-30 10:44:48,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1439 transitions. [2025-04-30 10:44:48,850 INFO L79 Accepts]: Start accepts. Automaton has 1062 states and 1439 transitions. Word has length 56 [2025-04-30 10:44:48,850 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:48,851 INFO L485 AbstractCegarLoop]: Abstraction has 1062 states and 1439 transitions. [2025-04-30 10:44:48,851 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:48,851 INFO L278 IsEmpty]: Start isEmpty. Operand 1062 states and 1439 transitions. [2025-04-30 10:44:48,851 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-30 10:44:48,851 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:48,851 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:48,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-30 10:44:49,052 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:49,052 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:49,052 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:49,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1194033851, now seen corresponding path program 1 times [2025-04-30 10:44:49,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:49,052 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677385223] [2025-04-30 10:44:49,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:49,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:49,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-30 10:44:49,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-30 10:44:49,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:49,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:49,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:49,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:49,207 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677385223] [2025-04-30 10:44:49,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677385223] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:49,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:49,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:44:49,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353520313] [2025-04-30 10:44:49,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:49,208 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:44:49,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:49,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:44:49,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:44:49,209 INFO L87 Difference]: Start difference. First operand 1062 states and 1439 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:49,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:49,456 INFO L93 Difference]: Finished difference Result 1449 states and 1946 transitions. [2025-04-30 10:44:49,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:44:49,457 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-04-30 10:44:49,457 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:49,460 INFO L225 Difference]: With dead ends: 1449 [2025-04-30 10:44:49,460 INFO L226 Difference]: Without dead ends: 1449 [2025-04-30 10:44:49,460 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:44:49,461 INFO L437 NwaCegarLoop]: 119 mSDtfsCounter, 153 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:49,461 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 919 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:49,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2025-04-30 10:44:49,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1239. [2025-04-30 10:44:49,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1104 states have (on average 1.4057971014492754) internal successors, (1552), 1184 states have internal predecessors, (1552), 48 states have call successors, (48), 24 states have call predecessors, (48), 48 states have return successors, (96), 30 states have call predecessors, (96), 48 states have call successors, (96) [2025-04-30 10:44:49,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1696 transitions. [2025-04-30 10:44:49,479 INFO L79 Accepts]: Start accepts. Automaton has 1239 states and 1696 transitions. Word has length 56 [2025-04-30 10:44:49,480 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:49,480 INFO L485 AbstractCegarLoop]: Abstraction has 1239 states and 1696 transitions. [2025-04-30 10:44:49,480 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:49,480 INFO L278 IsEmpty]: Start isEmpty. Operand 1239 states and 1696 transitions. [2025-04-30 10:44:49,480 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-30 10:44:49,480 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:49,480 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:49,481 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-04-30 10:44:49,481 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:49,481 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:49,482 INFO L85 PathProgramCache]: Analyzing trace with hash 123823530, now seen corresponding path program 1 times [2025-04-30 10:44:49,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:49,482 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840601373] [2025-04-30 10:44:49,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:49,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:49,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-30 10:44:49,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-30 10:44:49,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:49,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:49,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:49,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:49,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840601373] [2025-04-30 10:44:49,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840601373] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:49,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:49,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-30 10:44:49,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105545250] [2025-04-30 10:44:49,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:49,696 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:44:49,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:49,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:44:49,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:44:49,697 INFO L87 Difference]: Start difference. First operand 1239 states and 1696 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:49,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:49,987 INFO L93 Difference]: Finished difference Result 1463 states and 1961 transitions. [2025-04-30 10:44:49,988 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:44:49,988 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-04-30 10:44:49,988 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:49,990 INFO L225 Difference]: With dead ends: 1463 [2025-04-30 10:44:49,990 INFO L226 Difference]: Without dead ends: 1463 [2025-04-30 10:44:49,990 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2025-04-30 10:44:49,990 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 425 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:49,990 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1003 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:49,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2025-04-30 10:44:50,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1239. [2025-04-30 10:44:50,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1104 states have (on average 1.4057971014492754) internal successors, (1552), 1184 states have internal predecessors, (1552), 48 states have call successors, (48), 24 states have call predecessors, (48), 48 states have return successors, (96), 30 states have call predecessors, (96), 48 states have call successors, (96) [2025-04-30 10:44:50,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1696 transitions. [2025-04-30 10:44:50,004 INFO L79 Accepts]: Start accepts. Automaton has 1239 states and 1696 transitions. Word has length 56 [2025-04-30 10:44:50,004 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:50,004 INFO L485 AbstractCegarLoop]: Abstraction has 1239 states and 1696 transitions. [2025-04-30 10:44:50,004 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:50,004 INFO L278 IsEmpty]: Start isEmpty. Operand 1239 states and 1696 transitions. [2025-04-30 10:44:50,005 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-30 10:44:50,005 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:50,005 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:50,005 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-04-30 10:44:50,005 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:50,005 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:50,006 INFO L85 PathProgramCache]: Analyzing trace with hash -685523096, now seen corresponding path program 1 times [2025-04-30 10:44:50,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:50,006 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90719027] [2025-04-30 10:44:50,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:50,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:50,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-30 10:44:50,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-30 10:44:50,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:50,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:50,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:50,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:50,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90719027] [2025-04-30 10:44:50,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90719027] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:50,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101107607] [2025-04-30 10:44:50,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:50,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:50,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:50,367 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:50,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-30 10:44:50,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-30 10:44:50,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-30 10:44:50,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:50,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:50,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-30 10:44:50,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:50,727 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-30 10:44:50,761 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 15 [2025-04-30 10:44:50,811 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 21 treesize of output 9 [2025-04-30 10:44:50,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:50,817 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:50,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101107607] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:50,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:44:50,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2025-04-30 10:44:50,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988033546] [2025-04-30 10:44:50,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:50,817 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:44:50,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:50,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:44:50,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-04-30 10:44:50,818 INFO L87 Difference]: Start difference. First operand 1239 states and 1696 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:51,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:51,202 INFO L93 Difference]: Finished difference Result 1459 states and 1946 transitions. [2025-04-30 10:44:51,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:44:51,202 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-04-30 10:44:51,202 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:51,204 INFO L225 Difference]: With dead ends: 1459 [2025-04-30 10:44:51,204 INFO L226 Difference]: Without dead ends: 1459 [2025-04-30 10:44:51,205 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2025-04-30 10:44:51,205 INFO L437 NwaCegarLoop]: 240 mSDtfsCounter, 271 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:51,205 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 2000 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:44:51,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2025-04-30 10:44:51,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1134. [2025-04-30 10:44:51,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 1011 states have (on average 1.4045499505440158) internal successors, (1420), 1085 states have internal predecessors, (1420), 42 states have call successors, (42), 21 states have call predecessors, (42), 42 states have return successors, (84), 27 states have call predecessors, (84), 42 states have call successors, (84) [2025-04-30 10:44:51,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1546 transitions. [2025-04-30 10:44:51,227 INFO L79 Accepts]: Start accepts. Automaton has 1134 states and 1546 transitions. Word has length 56 [2025-04-30 10:44:51,227 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:51,227 INFO L485 AbstractCegarLoop]: Abstraction has 1134 states and 1546 transitions. [2025-04-30 10:44:51,227 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:51,227 INFO L278 IsEmpty]: Start isEmpty. Operand 1134 states and 1546 transitions. [2025-04-30 10:44:51,228 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-04-30 10:44:51,228 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:51,228 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2025-04-30 10:44:51,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-30 10:44:51,428 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2025-04-30 10:44:51,429 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:51,429 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:51,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1898871048, now seen corresponding path program 1 times [2025-04-30 10:44:51,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:51,429 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029291377] [2025-04-30 10:44:51,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:51,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:51,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-30 10:44:51,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-30 10:44:51,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:51,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:52,263 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:44:52,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:52,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029291377] [2025-04-30 10:44:52,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029291377] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:52,264 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925153890] [2025-04-30 10:44:52,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:52,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:52,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:52,266 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:52,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-30 10:44:52,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-30 10:44:52,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-30 10:44:52,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:52,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:52,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-04-30 10:44:52,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:52,431 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-30 10:44:52,639 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-30 10:44:52,643 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-30 10:44:52,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 27 treesize of output 11 [2025-04-30 10:44:52,692 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 36 treesize of output 27 [2025-04-30 10:44:52,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:44:52,775 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 23 treesize of output 18 [2025-04-30 10:44:52,783 INFO L325 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2025-04-30 10:44:52,783 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 20 treesize of output 20 [2025-04-30 10:44:52,934 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 12 [2025-04-30 10:44:52,936 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:52,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:53,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925153890] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:53,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:44:53,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 29 [2025-04-30 10:44:53,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241182761] [2025-04-30 10:44:53,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:53,138 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-30 10:44:53,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:53,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-30 10:44:53,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1077, Unknown=0, NotChecked=0, Total=1190 [2025-04-30 10:44:53,139 INFO L87 Difference]: Start difference. First operand 1134 states and 1546 transitions. Second operand has 30 states, 29 states have (on average 3.586206896551724) internal successors, (104), 28 states have internal predecessors, (104), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:44:55,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:55,431 INFO L93 Difference]: Finished difference Result 1610 states and 2121 transitions. [2025-04-30 10:44:55,431 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-30 10:44:55,431 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.586206896551724) internal successors, (104), 28 states have internal predecessors, (104), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 58 [2025-04-30 10:44:55,431 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:55,433 INFO L225 Difference]: With dead ends: 1610 [2025-04-30 10:44:55,433 INFO L226 Difference]: Without dead ends: 1610 [2025-04-30 10:44:55,434 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=640, Invalid=4616, Unknown=0, NotChecked=0, Total=5256 [2025-04-30 10:44:55,434 INFO L437 NwaCegarLoop]: 127 mSDtfsCounter, 994 mSDsluCounter, 2745 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 2872 SdHoareTripleChecker+Invalid, 2554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:55,434 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 2872 Invalid, 2554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-30 10:44:55,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2025-04-30 10:44:55,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1154. [2025-04-30 10:44:55,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1031 states have (on average 1.4034917555771096) internal successors, (1447), 1103 states have internal predecessors, (1447), 42 states have call successors, (42), 21 states have call predecessors, (42), 42 states have return successors, (84), 29 states have call predecessors, (84), 42 states have call successors, (84) [2025-04-30 10:44:55,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1573 transitions. [2025-04-30 10:44:55,445 INFO L79 Accepts]: Start accepts. Automaton has 1154 states and 1573 transitions. Word has length 58 [2025-04-30 10:44:55,446 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:55,446 INFO L485 AbstractCegarLoop]: Abstraction has 1154 states and 1573 transitions. [2025-04-30 10:44:55,446 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.586206896551724) internal successors, (104), 28 states have internal predecessors, (104), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:44:55,446 INFO L278 IsEmpty]: Start isEmpty. Operand 1154 states and 1573 transitions. [2025-04-30 10:44:55,446 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-04-30 10:44:55,446 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:55,446 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2025-04-30 10:44:55,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-30 10:44:55,647 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:55,647 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:55,648 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:55,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1898871049, now seen corresponding path program 1 times [2025-04-30 10:44:55,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:55,648 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582085393] [2025-04-30 10:44:55,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:55,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:55,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-30 10:44:55,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-30 10:44:55,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:55,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:56,159 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:44:56,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:56,160 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582085393] [2025-04-30 10:44:56,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582085393] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:56,160 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312387600] [2025-04-30 10:44:56,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:56,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:56,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:56,162 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:56,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-30 10:44:56,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-30 10:44:56,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-30 10:44:56,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:56,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:56,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-30 10:44:56,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:56,418 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-30 10:44:56,454 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 22 [2025-04-30 10:44:56,558 INFO L325 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2025-04-30 10:44:56,559 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 25 treesize of output 28 [2025-04-30 10:44:56,615 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:44:56,616 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 32 treesize of output 12 [2025-04-30 10:44:56,617 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:56,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:56,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312387600] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:56,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:44:56,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 24 [2025-04-30 10:44:56,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079855829] [2025-04-30 10:44:56,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:56,686 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-30 10:44:56,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:56,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-30 10:44:56,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2025-04-30 10:44:56,687 INFO L87 Difference]: Start difference. First operand 1154 states and 1573 transitions. Second operand has 25 states, 24 states have (on average 4.333333333333333) internal successors, (104), 22 states have internal predecessors, (104), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:44:57,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:57,548 INFO L93 Difference]: Finished difference Result 1652 states and 2192 transitions. [2025-04-30 10:44:57,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-30 10:44:57,548 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.333333333333333) internal successors, (104), 22 states have internal predecessors, (104), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 58 [2025-04-30 10:44:57,548 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:57,551 INFO L225 Difference]: With dead ends: 1652 [2025-04-30 10:44:57,551 INFO L226 Difference]: Without dead ends: 1652 [2025-04-30 10:44:57,551 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=360, Invalid=1992, Unknown=0, NotChecked=0, Total=2352 [2025-04-30 10:44:57,551 INFO L437 NwaCegarLoop]: 157 mSDtfsCounter, 1013 mSDsluCounter, 1960 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 2117 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:57,551 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 2117 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-30 10:44:57,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2025-04-30 10:44:57,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1164. [2025-04-30 10:44:57,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 1041 states have (on average 1.4024975984630164) internal successors, (1460), 1112 states have internal predecessors, (1460), 42 states have call successors, (42), 21 states have call predecessors, (42), 42 states have return successors, (84), 30 states have call predecessors, (84), 42 states have call successors, (84) [2025-04-30 10:44:57,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1586 transitions. [2025-04-30 10:44:57,562 INFO L79 Accepts]: Start accepts. Automaton has 1164 states and 1586 transitions. Word has length 58 [2025-04-30 10:44:57,562 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:57,562 INFO L485 AbstractCegarLoop]: Abstraction has 1164 states and 1586 transitions. [2025-04-30 10:44:57,562 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.333333333333333) internal successors, (104), 22 states have internal predecessors, (104), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:44:57,562 INFO L278 IsEmpty]: Start isEmpty. Operand 1164 states and 1586 transitions. [2025-04-30 10:44:57,563 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-04-30 10:44:57,563 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:57,563 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:57,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:57,763 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2025-04-30 10:44:57,763 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:44:57,764 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:57,764 INFO L85 PathProgramCache]: Analyzing trace with hash -429297623, now seen corresponding path program 1 times [2025-04-30 10:44:57,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:57,764 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297353126] [2025-04-30 10:44:57,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:57,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:57,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-30 10:44:57,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-30 10:44:57,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:57,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:44:58,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:58,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297353126] [2025-04-30 10:44:58,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297353126] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:58,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816315448] [2025-04-30 10:44:58,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:58,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:58,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:58,063 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:58,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-30 10:44:58,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-30 10:44:58,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-30 10:44:58,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:58,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:58,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-30 10:44:58,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:58,234 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-30 10:44:58,411 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:44:58,435 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 11 treesize of output 7 [2025-04-30 10:44:58,474 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 24 treesize of output 19 [2025-04-30 10:44:58,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:44:58,614 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:44:58,615 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 46 [2025-04-30 10:44:58,724 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:58,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:58,965 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 74 treesize of output 70 [2025-04-30 10:44:58,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:44:58,982 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:44:58,983 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 22 treesize of output 18 [2025-04-30 10:44:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:44:59,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816315448] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:59,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:59,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 16] total 40 [2025-04-30 10:44:59,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807904913] [2025-04-30 10:44:59,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:59,263 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-30 10:44:59,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:59,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-30 10:44:59,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1440, Unknown=0, NotChecked=0, Total=1560 [2025-04-30 10:44:59,264 INFO L87 Difference]: Start difference. First operand 1164 states and 1586 transitions. Second operand has 40 states, 40 states have (on average 3.6) internal successors, (144), 40 states have internal predecessors, (144), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-30 10:45:00,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:00,245 INFO L93 Difference]: Finished difference Result 1457 states and 1954 transitions. [2025-04-30 10:45:00,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:45:00,245 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.6) internal successors, (144), 40 states have internal predecessors, (144), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 58 [2025-04-30 10:45:00,245 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:00,247 INFO L225 Difference]: With dead ends: 1457 [2025-04-30 10:45:00,247 INFO L226 Difference]: Without dead ends: 1457 [2025-04-30 10:45:00,247 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=279, Invalid=2373, Unknown=0, NotChecked=0, Total=2652 [2025-04-30 10:45:00,248 INFO L437 NwaCegarLoop]: 130 mSDtfsCounter, 651 mSDsluCounter, 2511 mSDsCounter, 0 mSdLazyCounter, 1687 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 2641 SdHoareTripleChecker+Invalid, 1699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-30 10:45:00,248 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 2641 Invalid, 1699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1687 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-30 10:45:00,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2025-04-30 10:45:00,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1249. [2025-04-30 10:45:00,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1114 states have (on average 1.4003590664272891) internal successors, (1560), 1191 states have internal predecessors, (1560), 48 states have call successors, (48), 24 states have call predecessors, (48), 48 states have return successors, (96), 33 states have call predecessors, (96), 48 states have call successors, (96) [2025-04-30 10:45:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1704 transitions. [2025-04-30 10:45:00,257 INFO L79 Accepts]: Start accepts. Automaton has 1249 states and 1704 transitions. Word has length 58 [2025-04-30 10:45:00,258 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:00,258 INFO L485 AbstractCegarLoop]: Abstraction has 1249 states and 1704 transitions. [2025-04-30 10:45:00,258 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.6) internal successors, (144), 40 states have internal predecessors, (144), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-30 10:45:00,258 INFO L278 IsEmpty]: Start isEmpty. Operand 1249 states and 1704 transitions. [2025-04-30 10:45:00,258 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-04-30 10:45:00,258 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:00,258 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:45:00,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-30 10:45:00,459 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2025-04-30 10:45:00,459 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:45:00,459 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:00,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1376733812, now seen corresponding path program 1 times [2025-04-30 10:45:00,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:00,459 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271016553] [2025-04-30 10:45:00,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:00,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:00,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-30 10:45:00,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-30 10:45:00,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:00,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:00,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:45:00,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:00,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271016553] [2025-04-30 10:45:00,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271016553] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:45:00,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:45:00,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-04-30 10:45:00,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166110205] [2025-04-30 10:45:00,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:45:00,754 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-30 10:45:00,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:00,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-30 10:45:00,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:45:00,755 INFO L87 Difference]: Start difference. First operand 1249 states and 1704 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:45:01,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:01,171 INFO L93 Difference]: Finished difference Result 1443 states and 1928 transitions. [2025-04-30 10:45:01,171 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-30 10:45:01,171 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2025-04-30 10:45:01,171 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:01,173 INFO L225 Difference]: With dead ends: 1443 [2025-04-30 10:45:01,173 INFO L226 Difference]: Without dead ends: 1441 [2025-04-30 10:45:01,173 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2025-04-30 10:45:01,174 INFO L437 NwaCegarLoop]: 153 mSDtfsCounter, 313 mSDsluCounter, 1583 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:45:01,174 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1736 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:45:01,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2025-04-30 10:45:01,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1150. [2025-04-30 10:45:01,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 1027 states have (on average 1.394352482960078) internal successors, (1432), 1098 states have internal predecessors, (1432), 42 states have call successors, (42), 21 states have call predecessors, (42), 42 states have return successors, (84), 30 states have call predecessors, (84), 42 states have call successors, (84) [2025-04-30 10:45:01,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1558 transitions. [2025-04-30 10:45:01,183 INFO L79 Accepts]: Start accepts. Automaton has 1150 states and 1558 transitions. Word has length 58 [2025-04-30 10:45:01,183 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:01,183 INFO L485 AbstractCegarLoop]: Abstraction has 1150 states and 1558 transitions. [2025-04-30 10:45:01,183 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:45:01,183 INFO L278 IsEmpty]: Start isEmpty. Operand 1150 states and 1558 transitions. [2025-04-30 10:45:01,184 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-04-30 10:45:01,184 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:01,184 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1] [2025-04-30 10:45:01,184 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-04-30 10:45:01,184 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:45:01,184 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:01,184 INFO L85 PathProgramCache]: Analyzing trace with hash 577209385, now seen corresponding path program 1 times [2025-04-30 10:45:01,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:01,184 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685246681] [2025-04-30 10:45:01,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:01,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:01,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:45:01,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:45:01,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:01,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:02,294 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:45:02,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:02,294 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685246681] [2025-04-30 10:45:02,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685246681] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:02,294 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891954669] [2025-04-30 10:45:02,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:02,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:02,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:02,296 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:45:02,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-30 10:45:02,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:45:02,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:45:02,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:02,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:02,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-04-30 10:45:02,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:02,481 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-30 10:45:02,832 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-30 10:45:02,835 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-30 10:45:03,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:45:03,039 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 20 treesize of output 15 [2025-04-30 10:45:03,044 INFO L325 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2025-04-30 10:45:03,044 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 17 treesize of output 17 [2025-04-30 10:45:03,211 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:45:03,211 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2025-04-30 10:45:03,215 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:45:03,215 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2025-04-30 10:45:03,240 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:45:03,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:45:03,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891954669] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:03,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:45:03,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 13] total 40 [2025-04-30 10:45:03,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597882282] [2025-04-30 10:45:03,452 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:45:03,452 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-30 10:45:03,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:03,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-30 10:45:03,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1924, Unknown=0, NotChecked=0, Total=2070 [2025-04-30 10:45:03,453 INFO L87 Difference]: Start difference. First operand 1150 states and 1558 transitions. Second operand has 41 states, 40 states have (on average 2.725) internal successors, (109), 38 states have internal predecessors, (109), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:45:06,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:06,540 INFO L93 Difference]: Finished difference Result 1560 states and 2048 transitions. [2025-04-30 10:45:06,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-04-30 10:45:06,540 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.725) internal successors, (109), 38 states have internal predecessors, (109), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 59 [2025-04-30 10:45:06,540 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:06,542 INFO L225 Difference]: With dead ends: 1560 [2025-04-30 10:45:06,543 INFO L226 Difference]: Without dead ends: 1560 [2025-04-30 10:45:06,543 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1763 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=638, Invalid=6502, Unknown=0, NotChecked=0, Total=7140 [2025-04-30 10:45:06,543 INFO L437 NwaCegarLoop]: 153 mSDtfsCounter, 676 mSDsluCounter, 3620 mSDsCounter, 0 mSdLazyCounter, 3703 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 3773 SdHoareTripleChecker+Invalid, 3758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 3703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-30 10:45:06,543 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 3773 Invalid, 3758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 3703 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-30 10:45:06,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2025-04-30 10:45:06,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1222. [2025-04-30 10:45:06,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 1091 states have (on average 1.387717690192484) internal successors, (1514), 1164 states have internal predecessors, (1514), 46 states have call successors, (46), 23 states have call predecessors, (46), 46 states have return successors, (92), 34 states have call predecessors, (92), 46 states have call successors, (92) [2025-04-30 10:45:06,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1652 transitions. [2025-04-30 10:45:06,553 INFO L79 Accepts]: Start accepts. Automaton has 1222 states and 1652 transitions. Word has length 59 [2025-04-30 10:45:06,553 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:06,553 INFO L485 AbstractCegarLoop]: Abstraction has 1222 states and 1652 transitions. [2025-04-30 10:45:06,553 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.725) internal successors, (109), 38 states have internal predecessors, (109), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:45:06,553 INFO L278 IsEmpty]: Start isEmpty. Operand 1222 states and 1652 transitions. [2025-04-30 10:45:06,553 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-04-30 10:45:06,553 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:06,553 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1] [2025-04-30 10:45:06,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-30 10:45:06,754 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2025-04-30 10:45:06,754 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:45:06,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:06,754 INFO L85 PathProgramCache]: Analyzing trace with hash 577209384, now seen corresponding path program 1 times [2025-04-30 10:45:06,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:06,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22030683] [2025-04-30 10:45:06,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:06,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:06,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:45:06,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:45:06,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:06,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:06,984 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:45:06,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:06,984 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22030683] [2025-04-30 10:45:06,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22030683] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:06,984 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585121999] [2025-04-30 10:45:06,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:06,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:06,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:06,986 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:45:06,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-30 10:45:07,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:45:07,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:45:07,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:07,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:07,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-30 10:45:07,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:07,233 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-30 10:45:07,300 INFO L325 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-04-30 10:45:07,300 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 23 treesize of output 24 [2025-04-30 10:45:07,328 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 17 treesize of output 9 [2025-04-30 10:45:07,330 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:45:07,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:45:07,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585121999] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:07,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:45:07,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2025-04-30 10:45:07,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095345960] [2025-04-30 10:45:07,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:45:07,402 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-30 10:45:07,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:07,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-30 10:45:07,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:45:07,403 INFO L87 Difference]: Start difference. First operand 1222 states and 1652 transitions. Second operand has 20 states, 19 states have (on average 5.684210526315789) internal successors, (108), 18 states have internal predecessors, (108), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:45:07,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:07,787 INFO L93 Difference]: Finished difference Result 1505 states and 2015 transitions. [2025-04-30 10:45:07,787 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:45:07,787 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 5.684210526315789) internal successors, (108), 18 states have internal predecessors, (108), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 59 [2025-04-30 10:45:07,787 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:07,789 INFO L225 Difference]: With dead ends: 1505 [2025-04-30 10:45:07,789 INFO L226 Difference]: Without dead ends: 1505 [2025-04-30 10:45:07,789 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2025-04-30 10:45:07,790 INFO L437 NwaCegarLoop]: 176 mSDtfsCounter, 433 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:45:07,790 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 1710 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:45:07,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2025-04-30 10:45:07,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1268. [2025-04-30 10:45:07,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 1133 states have (on average 1.383936451897617) internal successors, (1568), 1206 states have internal predecessors, (1568), 48 states have call successors, (48), 24 states have call predecessors, (48), 48 states have return successors, (96), 37 states have call predecessors, (96), 48 states have call successors, (96) [2025-04-30 10:45:07,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1712 transitions. [2025-04-30 10:45:07,800 INFO L79 Accepts]: Start accepts. Automaton has 1268 states and 1712 transitions. Word has length 59 [2025-04-30 10:45:07,800 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:07,800 INFO L485 AbstractCegarLoop]: Abstraction has 1268 states and 1712 transitions. [2025-04-30 10:45:07,800 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.684210526315789) internal successors, (108), 18 states have internal predecessors, (108), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:45:07,800 INFO L278 IsEmpty]: Start isEmpty. Operand 1268 states and 1712 transitions. [2025-04-30 10:45:07,801 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-04-30 10:45:07,801 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:07,801 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2025-04-30 10:45:07,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-30 10:45:08,001 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2025-04-30 10:45:08,002 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:45:08,002 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:08,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1271458598, now seen corresponding path program 1 times [2025-04-30 10:45:08,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:08,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972797003] [2025-04-30 10:45:08,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:08,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:08,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:45:08,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:45:08,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:08,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:08,609 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:45:08,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:08,609 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972797003] [2025-04-30 10:45:08,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972797003] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:08,609 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178124687] [2025-04-30 10:45:08,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:08,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:08,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:08,611 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:45:08,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-30 10:45:08,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:45:08,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:45:08,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:08,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:08,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-04-30 10:45:08,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:08,826 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-30 10:45:08,830 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-30 10:45:09,099 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-30 10:45:09,102 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-30 10:45:09,161 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 18 [2025-04-30 10:45:09,165 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 23 treesize of output 11 [2025-04-30 10:45:09,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:45:09,289 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 18 treesize of output 13 [2025-04-30 10:45:09,292 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-30 10:45:09,293 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 15 treesize of output 15 [2025-04-30 10:45:09,381 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 17 treesize of output 9 [2025-04-30 10:45:09,383 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:45:09,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:45:09,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178124687] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:09,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:45:09,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 26 [2025-04-30 10:45:09,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754237670] [2025-04-30 10:45:09,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:45:09,540 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-30 10:45:09,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:09,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-30 10:45:09,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=858, Unknown=0, NotChecked=0, Total=992 [2025-04-30 10:45:09,541 INFO L87 Difference]: Start difference. First operand 1268 states and 1712 transitions. Second operand has 27 states, 26 states have (on average 4.153846153846154) internal successors, (108), 24 states have internal predecessors, (108), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:45:10,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:10,586 INFO L93 Difference]: Finished difference Result 1537 states and 2033 transitions. [2025-04-30 10:45:10,586 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:45:10,586 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.153846153846154) internal successors, (108), 24 states have internal predecessors, (108), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 59 [2025-04-30 10:45:10,586 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:10,588 INFO L225 Difference]: With dead ends: 1537 [2025-04-30 10:45:10,588 INFO L226 Difference]: Without dead ends: 1537 [2025-04-30 10:45:10,589 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=224, Invalid=1108, Unknown=0, NotChecked=0, Total=1332 [2025-04-30 10:45:10,589 INFO L437 NwaCegarLoop]: 244 mSDtfsCounter, 605 mSDsluCounter, 2834 mSDsCounter, 0 mSdLazyCounter, 2665 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 3078 SdHoareTripleChecker+Invalid, 2675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-30 10:45:10,589 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 3078 Invalid, 2675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2665 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-30 10:45:10,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2025-04-30 10:45:10,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1290. [2025-04-30 10:45:10,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 1155 states have (on average 1.3826839826839827) internal successors, (1597), 1226 states have internal predecessors, (1597), 48 states have call successors, (48), 24 states have call predecessors, (48), 48 states have return successors, (96), 39 states have call predecessors, (96), 48 states have call successors, (96) [2025-04-30 10:45:10,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1741 transitions. [2025-04-30 10:45:10,600 INFO L79 Accepts]: Start accepts. Automaton has 1290 states and 1741 transitions. Word has length 59 [2025-04-30 10:45:10,600 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:10,600 INFO L485 AbstractCegarLoop]: Abstraction has 1290 states and 1741 transitions. [2025-04-30 10:45:10,600 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.153846153846154) internal successors, (108), 24 states have internal predecessors, (108), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:45:10,600 INFO L278 IsEmpty]: Start isEmpty. Operand 1290 states and 1741 transitions. [2025-04-30 10:45:10,601 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-04-30 10:45:10,601 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:10,602 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2025-04-30 10:45:10,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-30 10:45:10,802 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:10,803 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:45:10,803 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:10,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1271458597, now seen corresponding path program 1 times [2025-04-30 10:45:10,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:10,803 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495004957] [2025-04-30 10:45:10,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:10,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:10,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:45:10,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:45:10,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:10,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:11,802 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:45:11,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:11,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495004957] [2025-04-30 10:45:11,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495004957] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:11,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037303602] [2025-04-30 10:45:11,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:11,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:11,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:11,804 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:45:11,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-30 10:45:11,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:45:11,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:45:11,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:11,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:11,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-04-30 10:45:11,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:12,031 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-30 10:45:12,249 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-30 10:45:12,298 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 25 treesize of output 13 [2025-04-30 10:45:12,406 INFO L325 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-04-30 10:45:12,406 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 23 treesize of output 24 [2025-04-30 10:45:12,450 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 17 treesize of output 9 [2025-04-30 10:45:12,451 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:45:12,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:45:12,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037303602] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:12,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:45:12,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11] total 32 [2025-04-30 10:45:12,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776772227] [2025-04-30 10:45:12,524 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:45:12,524 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-30 10:45:12,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:12,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-30 10:45:12,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1071, Unknown=0, NotChecked=0, Total=1190 [2025-04-30 10:45:12,524 INFO L87 Difference]: Start difference. First operand 1290 states and 1741 transitions. Second operand has 33 states, 32 states have (on average 3.3125) internal successors, (106), 29 states have internal predecessors, (106), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:45:13,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:13,872 INFO L93 Difference]: Finished difference Result 1529 states and 2024 transitions. [2025-04-30 10:45:13,872 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-30 10:45:13,872 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.3125) internal successors, (106), 29 states have internal predecessors, (106), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 59 [2025-04-30 10:45:13,872 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:13,874 INFO L225 Difference]: With dead ends: 1529 [2025-04-30 10:45:13,874 INFO L226 Difference]: Without dead ends: 1529 [2025-04-30 10:45:13,875 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=324, Invalid=2226, Unknown=0, NotChecked=0, Total=2550 [2025-04-30 10:45:13,875 INFO L437 NwaCegarLoop]: 260 mSDtfsCounter, 606 mSDsluCounter, 3504 mSDsCounter, 0 mSdLazyCounter, 2704 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 3764 SdHoareTripleChecker+Invalid, 2747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:45:13,875 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 3764 Invalid, 2747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2704 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-30 10:45:13,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2025-04-30 10:45:13,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1218. [2025-04-30 10:45:13,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 1091 states have (on average 1.388634280476627) internal successors, (1515), 1160 states have internal predecessors, (1515), 44 states have call successors, (44), 22 states have call predecessors, (44), 44 states have return successors, (88), 35 states have call predecessors, (88), 44 states have call successors, (88) [2025-04-30 10:45:13,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1647 transitions. [2025-04-30 10:45:13,884 INFO L79 Accepts]: Start accepts. Automaton has 1218 states and 1647 transitions. Word has length 59 [2025-04-30 10:45:13,884 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:13,885 INFO L485 AbstractCegarLoop]: Abstraction has 1218 states and 1647 transitions. [2025-04-30 10:45:13,885 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.3125) internal successors, (106), 29 states have internal predecessors, (106), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:45:13,885 INFO L278 IsEmpty]: Start isEmpty. Operand 1218 states and 1647 transitions. [2025-04-30 10:45:13,885 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-04-30 10:45:13,885 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:13,885 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:45:13,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-30 10:45:14,085 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:14,086 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:45:14,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:14,087 INFO L85 PathProgramCache]: Analyzing trace with hash -230513899, now seen corresponding path program 1 times [2025-04-30 10:45:14,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:14,087 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033792111] [2025-04-30 10:45:14,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:14,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:14,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-30 10:45:14,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-30 10:45:14,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:14,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:14,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:45:14,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:14,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033792111] [2025-04-30 10:45:14,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033792111] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:14,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144193321] [2025-04-30 10:45:14,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:14,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:14,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:14,179 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:45:14,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-30 10:45:14,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-30 10:45:14,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-30 10:45:14,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:14,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:14,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-30 10:45:14,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:45:14,486 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:45:14,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144193321] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:45:14,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:45:14,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 12 [2025-04-30 10:45:14,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686448130] [2025-04-30 10:45:14,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:45:14,486 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:45:14,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:14,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:45:14,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:45:14,487 INFO L87 Difference]: Start difference. First operand 1218 states and 1647 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:45:14,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:14,569 INFO L93 Difference]: Finished difference Result 1225 states and 1627 transitions. [2025-04-30 10:45:14,569 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:45:14,569 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 60 [2025-04-30 10:45:14,569 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:14,571 INFO L225 Difference]: With dead ends: 1225 [2025-04-30 10:45:14,571 INFO L226 Difference]: Without dead ends: 1225 [2025-04-30 10:45:14,571 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:45:14,572 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 324 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:45:14,572 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 308 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:45:14,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-04-30 10:45:14,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1215. [2025-04-30 10:45:14,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 1091 states have (on average 1.3611365719523374) internal successors, (1485), 1157 states have internal predecessors, (1485), 44 states have call successors, (44), 22 states have call predecessors, (44), 44 states have return successors, (88), 35 states have call predecessors, (88), 44 states have call successors, (88) [2025-04-30 10:45:14,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1617 transitions. [2025-04-30 10:45:14,592 INFO L79 Accepts]: Start accepts. Automaton has 1215 states and 1617 transitions. Word has length 60 [2025-04-30 10:45:14,592 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:14,592 INFO L485 AbstractCegarLoop]: Abstraction has 1215 states and 1617 transitions. [2025-04-30 10:45:14,592 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:45:14,592 INFO L278 IsEmpty]: Start isEmpty. Operand 1215 states and 1617 transitions. [2025-04-30 10:45:14,594 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-04-30 10:45:14,594 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:14,594 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:45:14,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-30 10:45:14,794 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:14,795 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:45:14,795 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:14,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1244066350, now seen corresponding path program 1 times [2025-04-30 10:45:14,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:14,795 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935460281] [2025-04-30 10:45:14,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:14,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:14,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:45:14,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:45:14,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:14,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:15,171 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:45:15,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:15,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935460281] [2025-04-30 10:45:15,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935460281] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:15,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834358294] [2025-04-30 10:45:15,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:15,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:15,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:15,173 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:45:15,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-30 10:45:15,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:45:15,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:45:15,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:15,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:15,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-30 10:45:15,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:15,608 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-30 10:45:15,666 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 43 treesize of output 30 [2025-04-30 10:45:15,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:45:15,840 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:45:15,841 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 20 [2025-04-30 10:45:15,858 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 13 treesize of output 9 [2025-04-30 10:45:15,879 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:45:15,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:45:15,944 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 106 treesize of output 102 [2025-04-30 10:45:17,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834358294] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:17,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:45:17,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2025-04-30 10:45:17,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79952230] [2025-04-30 10:45:17,100 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:45:17,101 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-30 10:45:17,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:17,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-30 10:45:17,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1124, Unknown=0, NotChecked=0, Total=1260 [2025-04-30 10:45:17,101 INFO L87 Difference]: Start difference. First operand 1215 states and 1617 transitions. Second operand has 28 states, 27 states have (on average 4.0) internal successors, (108), 27 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:45:18,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:45:18,071 INFO L93 Difference]: Finished difference Result 1376 states and 1799 transitions. [2025-04-30 10:45:18,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-30 10:45:18,071 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.0) internal successors, (108), 27 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 59 [2025-04-30 10:45:18,071 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:45:18,073 INFO L225 Difference]: With dead ends: 1376 [2025-04-30 10:45:18,073 INFO L226 Difference]: Without dead ends: 1374 [2025-04-30 10:45:18,073 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=351, Invalid=2841, Unknown=0, NotChecked=0, Total=3192 [2025-04-30 10:45:18,074 INFO L437 NwaCegarLoop]: 154 mSDtfsCounter, 639 mSDsluCounter, 1751 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:45:18,074 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 1905 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-30 10:45:18,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2025-04-30 10:45:18,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1264. [2025-04-30 10:45:18,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 1139 states have (on average 1.3511852502194908) internal successors, (1539), 1205 states have internal predecessors, (1539), 45 states have call successors, (45), 22 states have call predecessors, (45), 44 states have return successors, (90), 36 states have call predecessors, (90), 45 states have call successors, (90) [2025-04-30 10:45:18,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1674 transitions. [2025-04-30 10:45:18,084 INFO L79 Accepts]: Start accepts. Automaton has 1264 states and 1674 transitions. Word has length 59 [2025-04-30 10:45:18,085 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:45:18,085 INFO L485 AbstractCegarLoop]: Abstraction has 1264 states and 1674 transitions. [2025-04-30 10:45:18,085 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.0) internal successors, (108), 27 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:45:18,085 INFO L278 IsEmpty]: Start isEmpty. Operand 1264 states and 1674 transitions. [2025-04-30 10:45:18,085 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-04-30 10:45:18,085 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:45:18,085 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:45:18,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-30 10:45:18,285 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:18,286 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2025-04-30 10:45:18,286 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:18,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1244066734, now seen corresponding path program 1 times [2025-04-30 10:45:18,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:18,286 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239949690] [2025-04-30 10:45:18,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:18,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:18,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:45:18,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:45:18,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:18,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15