./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety-ext/tree_parent_ptr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/memsafety-ext/tree_parent_ptr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1103de0182acb7a86f6f87cccb1f9be73fd96acc0d50f3669719d984cf7d6bb7 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:22:49,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:22:49,776 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:22:49,780 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:22:49,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:22:49,801 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:22:49,801 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:22:49,801 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:22:49,802 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:22:49,802 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:22:49,802 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:22:49,802 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:22:49,802 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:22:49,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:22:49,802 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:22:49,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:22:49,803 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:22:49,803 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:22:49,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:22:49,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:22:49,803 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:22:49,803 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:22:49,803 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:22:49,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:22:49,803 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:22:49,803 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:22:49,803 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:22:49,804 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:22:49,804 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:22:49,804 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:22:49,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:22:49,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:22:49,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:22:49,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:22:49,804 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:22:49,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:22:49,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:22:49,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:22:49,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:22:49,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:22:49,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:22:49,805 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:22:49,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:22:49,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:22:49,805 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:22:49,805 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:22:49,805 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 -> 1103de0182acb7a86f6f87cccb1f9be73fd96acc0d50f3669719d984cf7d6bb7 [2025-04-29 11:22:50,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:22:50,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:22:50,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:22:50,031 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:22:50,032 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:22:50,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_parent_ptr.c [2025-04-29 11:22:51,310 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f41467bb2/b7a5a390adfc477fac191f1ce17626b6/FLAG4d6e607c4 [2025-04-29 11:22:51,497 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:22:51,498 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety-ext/tree_parent_ptr.c [2025-04-29 11:22:51,499 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:22:51,499 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:22:51,503 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f41467bb2/b7a5a390adfc477fac191f1ce17626b6/FLAG4d6e607c4 [2025-04-29 11:22:52,310 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f41467bb2/b7a5a390adfc477fac191f1ce17626b6 [2025-04-29 11:22:52,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:22:52,313 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:22:52,314 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:22:52,314 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:22:52,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:22:52,318 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:22:52" (1/1) ... [2025-04-29 11:22:52,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f19875f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:52, skipping insertion in model container [2025-04-29 11:22:52,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:22:52" (1/1) ... [2025-04-29 11:22:52,329 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:22:52,465 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:22:52,470 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:22:52,497 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:22:52,514 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:22:52,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:52 WrapperNode [2025-04-29 11:22:52,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:22:52,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:22:52,516 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:22:52,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:22:52,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:52" (1/1) ... [2025-04-29 11:22:52,533 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:52" (1/1) ... [2025-04-29 11:22:52,553 INFO L138 Inliner]: procedures = 10, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 141 [2025-04-29 11:22:52,556 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:22:52,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:22:52,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:22:52,556 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:22:52,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:52" (1/1) ... [2025-04-29 11:22:52,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:52" (1/1) ... [2025-04-29 11:22:52,568 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:52" (1/1) ... [2025-04-29 11:22:52,587 INFO L175 MemorySlicer]: Split 35 memory accesses to 1 slices as follows [35]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 17 writes are split as follows [17]. [2025-04-29 11:22:52,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:52" (1/1) ... [2025-04-29 11:22:52,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:52" (1/1) ... [2025-04-29 11:22:52,593 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:52" (1/1) ... [2025-04-29 11:22:52,594 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:52" (1/1) ... [2025-04-29 11:22:52,596 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:52" (1/1) ... [2025-04-29 11:22:52,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:52" (1/1) ... [2025-04-29 11:22:52,597 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:52" (1/1) ... [2025-04-29 11:22:52,602 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:22:52,602 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:22:52,602 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:22:52,602 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:22:52,607 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:52" (1/1) ... [2025-04-29 11:22:52,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:22:52,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:52,635 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:22:52,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:22:52,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:22:52,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:22:52,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:22:52,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:22:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:22:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:22:52,711 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:22:52,713 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:22:53,118 INFO L? ?]: Removed 176 outVars from TransFormulas that were not future-live. [2025-04-29 11:22:53,120 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:22:53,132 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:22:53,133 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-29 11:22:53,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:22:53 BoogieIcfgContainer [2025-04-29 11:22:53,134 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:22:53,135 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:22:53,136 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:22:53,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:22:53,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:22:52" (1/3) ... [2025-04-29 11:22:53,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71dc67cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:22:53, skipping insertion in model container [2025-04-29 11:22:53,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:52" (2/3) ... [2025-04-29 11:22:53,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71dc67cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:22:53, skipping insertion in model container [2025-04-29 11:22:53,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:22:53" (3/3) ... [2025-04-29 11:22:53,143 INFO L128 eAbstractionObserver]: Analyzing ICFG tree_parent_ptr.c [2025-04-29 11:22:53,153 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:22:53,155 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tree_parent_ptr.c that has 1 procedures, 156 locations, 168 edges, 1 initial locations, 3 loop locations, and 77 error locations. [2025-04-29 11:22:53,189 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:22:53,198 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;@77160cf3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:22:53,198 INFO L341 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2025-04-29 11:22:53,202 INFO L278 IsEmpty]: Start isEmpty. Operand has 156 states, 78 states have (on average 2.1538461538461537) internal successors, (168), 155 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:53,205 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-04-29 11:22:53,205 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:53,205 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-04-29 11:22:53,206 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:22:53,210 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:53,211 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2025-04-29 11:22:53,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:53,216 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657576761] [2025-04-29 11:22:53,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:53,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:53,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-29 11:22:53,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-29 11:22:53,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:53,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:53,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:53,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657576761] [2025-04-29 11:22:53,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657576761] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:53,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:53,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:22:53,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145552468] [2025-04-29 11:22:53,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:53,341 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:53,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:53,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:53,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:53,361 INFO L87 Difference]: Start difference. First operand has 156 states, 78 states have (on average 2.1538461538461537) internal successors, (168), 155 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:53,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:53,492 INFO L93 Difference]: Finished difference Result 153 states and 163 transitions. [2025-04-29 11:22:53,493 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:53,494 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-04-29 11:22:53,495 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:53,499 INFO L225 Difference]: With dead ends: 153 [2025-04-29 11:22:53,500 INFO L226 Difference]: Without dead ends: 151 [2025-04-29 11:22:53,502 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:53,504 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 99 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:53,507 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 136 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:53,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-04-29 11:22:53,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-04-29 11:22:53,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 77 states have (on average 2.090909090909091) internal successors, (161), 150 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2025-04-29 11:22:53,535 INFO L79 Accepts]: Start accepts. Automaton has 151 states and 161 transitions. Word has length 3 [2025-04-29 11:22:53,535 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:53,536 INFO L485 AbstractCegarLoop]: Abstraction has 151 states and 161 transitions. [2025-04-29 11:22:53,536 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:53,536 INFO L278 IsEmpty]: Start isEmpty. Operand 151 states and 161 transitions. [2025-04-29 11:22:53,536 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-04-29 11:22:53,536 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:53,536 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-04-29 11:22:53,536 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:22:53,538 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:22:53,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:53,539 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2025-04-29 11:22:53,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:53,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912556423] [2025-04-29 11:22:53,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:53,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:53,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-29 11:22:53,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-29 11:22:53,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:53,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:53,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:53,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:53,627 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912556423] [2025-04-29 11:22:53,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912556423] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:53,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:53,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:22:53,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625820289] [2025-04-29 11:22:53,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:53,628 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:53,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:53,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:53,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:53,629 INFO L87 Difference]: Start difference. First operand 151 states and 161 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:53,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:53,719 INFO L93 Difference]: Finished difference Result 148 states and 158 transitions. [2025-04-29 11:22:53,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:53,719 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-04-29 11:22:53,719 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:53,720 INFO L225 Difference]: With dead ends: 148 [2025-04-29 11:22:53,720 INFO L226 Difference]: Without dead ends: 148 [2025-04-29 11:22:53,720 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:53,721 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 94 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:53,721 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 145 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:53,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-04-29 11:22:53,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-04-29 11:22:53,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 77 states have (on average 2.051948051948052) internal successors, (158), 147 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:53,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2025-04-29 11:22:53,727 INFO L79 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 3 [2025-04-29 11:22:53,727 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:53,727 INFO L485 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2025-04-29 11:22:53,727 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:53,727 INFO L278 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2025-04-29 11:22:53,727 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:22:53,727 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:53,727 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:53,728 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:22:53,728 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:22:53,728 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:53,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1837202379, now seen corresponding path program 1 times [2025-04-29 11:22:53,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:53,728 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916601885] [2025-04-29 11:22:53,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:53,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:53,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:22:53,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:22:53,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:53,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:53,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:53,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:53,806 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916601885] [2025-04-29 11:22:53,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916601885] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:53,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:53,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:53,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284373797] [2025-04-29 11:22:53,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:53,807 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:22:53,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:53,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:22:53,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:22:53,808 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:53,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:53,968 INFO L93 Difference]: Finished difference Result 153 states and 165 transitions. [2025-04-29 11:22:53,968 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:53,972 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-29 11:22:53,972 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:53,972 INFO L225 Difference]: With dead ends: 153 [2025-04-29 11:22:53,972 INFO L226 Difference]: Without dead ends: 153 [2025-04-29 11:22:53,973 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-29 11:22:53,973 INFO L437 NwaCegarLoop]: 81 mSDtfsCounter, 177 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:53,973 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 123 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:53,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-04-29 11:22:53,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 132. [2025-04-29 11:22:53,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 78 states have (on average 1.8333333333333333) internal successors, (143), 131 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2025-04-29 11:22:53,984 INFO L79 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 9 [2025-04-29 11:22:53,984 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:53,984 INFO L485 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2025-04-29 11:22:53,984 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:53,984 INFO L278 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2025-04-29 11:22:53,984 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:22:53,984 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:53,984 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:53,984 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:22:53,985 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:22:53,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:53,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1837202380, now seen corresponding path program 1 times [2025-04-29 11:22:53,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:53,985 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932876501] [2025-04-29 11:22:53,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:53,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:53,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:22:53,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:22:53,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:53,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:54,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:54,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:54,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932876501] [2025-04-29 11:22:54,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932876501] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:54,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:54,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:54,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753441373] [2025-04-29 11:22:54,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:54,115 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:22:54,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:54,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:22:54,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:22:54,115 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:54,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:54,274 INFO L93 Difference]: Finished difference Result 186 states and 204 transitions. [2025-04-29 11:22:54,274 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:22:54,274 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-29 11:22:54,275 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:54,275 INFO L225 Difference]: With dead ends: 186 [2025-04-29 11:22:54,275 INFO L226 Difference]: Without dead ends: 186 [2025-04-29 11:22:54,276 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-29 11:22:54,276 INFO L437 NwaCegarLoop]: 97 mSDtfsCounter, 188 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:54,276 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 184 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:54,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-04-29 11:22:54,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 169. [2025-04-29 11:22:54,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 115 states have (on average 1.7043478260869565) internal successors, (196), 168 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:54,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 196 transitions. [2025-04-29 11:22:54,285 INFO L79 Accepts]: Start accepts. Automaton has 169 states and 196 transitions. Word has length 9 [2025-04-29 11:22:54,285 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:54,285 INFO L485 AbstractCegarLoop]: Abstraction has 169 states and 196 transitions. [2025-04-29 11:22:54,285 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:54,285 INFO L278 IsEmpty]: Start isEmpty. Operand 169 states and 196 transitions. [2025-04-29 11:22:54,285 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:22:54,285 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:54,285 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:54,285 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:22:54,285 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:22:54,286 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:54,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1837208362, now seen corresponding path program 1 times [2025-04-29 11:22:54,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:54,286 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826537571] [2025-04-29 11:22:54,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:54,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:54,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:22:54,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:22:54,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:54,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:54,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:54,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:54,325 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826537571] [2025-04-29 11:22:54,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826537571] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:54,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:54,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:22:54,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466767539] [2025-04-29 11:22:54,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:54,325 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:54,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:54,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:54,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:54,325 INFO L87 Difference]: Start difference. First operand 169 states and 196 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:54,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:54,392 INFO L93 Difference]: Finished difference Result 169 states and 198 transitions. [2025-04-29 11:22:54,392 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:54,392 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-29 11:22:54,392 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:54,393 INFO L225 Difference]: With dead ends: 169 [2025-04-29 11:22:54,393 INFO L226 Difference]: Without dead ends: 169 [2025-04-29 11:22:54,394 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:54,394 INFO L437 NwaCegarLoop]: 131 mSDtfsCounter, 3 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:54,394 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 202 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:54,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-04-29 11:22:54,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-04-29 11:22:54,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 117 states have (on average 1.6923076923076923) internal successors, (198), 168 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:54,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 198 transitions. [2025-04-29 11:22:54,408 INFO L79 Accepts]: Start accepts. Automaton has 169 states and 198 transitions. Word has length 9 [2025-04-29 11:22:54,408 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:54,408 INFO L485 AbstractCegarLoop]: Abstraction has 169 states and 198 transitions. [2025-04-29 11:22:54,408 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:54,408 INFO L278 IsEmpty]: Start isEmpty. Operand 169 states and 198 transitions. [2025-04-29 11:22:54,408 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:22:54,408 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:54,408 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:54,408 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:22:54,409 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:22:54,409 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:54,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1837208363, now seen corresponding path program 1 times [2025-04-29 11:22:54,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:54,410 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765576964] [2025-04-29 11:22:54,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:54,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:54,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:22:54,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:22:54,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:54,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:54,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:54,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:54,480 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765576964] [2025-04-29 11:22:54,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765576964] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:54,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:54,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:22:54,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915102885] [2025-04-29 11:22:54,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:54,480 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:54,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:54,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:54,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:54,481 INFO L87 Difference]: Start difference. First operand 169 states and 198 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:54,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:54,586 INFO L93 Difference]: Finished difference Result 167 states and 195 transitions. [2025-04-29 11:22:54,587 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:54,587 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-29 11:22:54,587 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:54,588 INFO L225 Difference]: With dead ends: 167 [2025-04-29 11:22:54,588 INFO L226 Difference]: Without dead ends: 167 [2025-04-29 11:22:54,588 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:54,589 INFO L437 NwaCegarLoop]: 132 mSDtfsCounter, 3 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:54,589 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 192 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:54,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-04-29 11:22:54,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-04-29 11:22:54,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 117 states have (on average 1.6666666666666667) internal successors, (195), 166 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:54,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 195 transitions. [2025-04-29 11:22:54,593 INFO L79 Accepts]: Start accepts. Automaton has 167 states and 195 transitions. Word has length 9 [2025-04-29 11:22:54,593 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:54,593 INFO L485 AbstractCegarLoop]: Abstraction has 167 states and 195 transitions. [2025-04-29 11:22:54,593 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:54,593 INFO L278 IsEmpty]: Start isEmpty. Operand 167 states and 195 transitions. [2025-04-29 11:22:54,593 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-29 11:22:54,593 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:54,594 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:54,594 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:22:54,594 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:22:54,594 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:54,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1506183666, now seen corresponding path program 1 times [2025-04-29 11:22:54,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:54,594 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491071805] [2025-04-29 11:22:54,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:54,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:54,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:22:54,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:22:54,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:54,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:54,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:54,625 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491071805] [2025-04-29 11:22:54,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491071805] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:54,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:54,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:54,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211654926] [2025-04-29 11:22:54,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:54,626 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:54,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:54,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:54,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:54,627 INFO L87 Difference]: Start difference. First operand 167 states and 195 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:54,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:54,641 INFO L93 Difference]: Finished difference Result 167 states and 194 transitions. [2025-04-29 11:22:54,642 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:54,642 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-04-29 11:22:54,642 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:54,642 INFO L225 Difference]: With dead ends: 167 [2025-04-29 11:22:54,643 INFO L226 Difference]: Without dead ends: 167 [2025-04-29 11:22:54,643 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:54,643 INFO L437 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:54,643 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 256 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:54,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-04-29 11:22:54,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-04-29 11:22:54,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 117 states have (on average 1.6581196581196582) internal successors, (194), 166 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:54,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 194 transitions. [2025-04-29 11:22:54,654 INFO L79 Accepts]: Start accepts. Automaton has 167 states and 194 transitions. Word has length 12 [2025-04-29 11:22:54,654 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:54,654 INFO L485 AbstractCegarLoop]: Abstraction has 167 states and 194 transitions. [2025-04-29 11:22:54,655 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:54,655 INFO L278 IsEmpty]: Start isEmpty. Operand 167 states and 194 transitions. [2025-04-29 11:22:54,655 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:22:54,655 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:54,655 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:54,655 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:22:54,655 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:22:54,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:54,655 INFO L85 PathProgramCache]: Analyzing trace with hash 36683411, now seen corresponding path program 1 times [2025-04-29 11:22:54,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:54,655 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15496692] [2025-04-29 11:22:54,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:54,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:54,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:22:54,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:22:54,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:54,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:54,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:54,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:54,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15496692] [2025-04-29 11:22:54,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15496692] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:54,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:54,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:22:54,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129614849] [2025-04-29 11:22:54,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:54,720 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:54,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:54,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:54,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:54,721 INFO L87 Difference]: Start difference. First operand 167 states and 194 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:54,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:54,825 INFO L93 Difference]: Finished difference Result 174 states and 203 transitions. [2025-04-29 11:22:54,825 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:54,825 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-29 11:22:54,826 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:54,826 INFO L225 Difference]: With dead ends: 174 [2025-04-29 11:22:54,826 INFO L226 Difference]: Without dead ends: 174 [2025-04-29 11:22:54,826 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-29 11:22:54,827 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 21 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:54,827 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 249 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:54,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-04-29 11:22:54,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 164. [2025-04-29 11:22:54,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 119 states have (on average 1.6134453781512605) internal successors, (192), 163 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 192 transitions. [2025-04-29 11:22:54,832 INFO L79 Accepts]: Start accepts. Automaton has 164 states and 192 transitions. Word has length 14 [2025-04-29 11:22:54,832 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:54,832 INFO L485 AbstractCegarLoop]: Abstraction has 164 states and 192 transitions. [2025-04-29 11:22:54,832 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:54,834 INFO L278 IsEmpty]: Start isEmpty. Operand 164 states and 192 transitions. [2025-04-29 11:22:54,834 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:22:54,834 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:54,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:54,834 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:22:54,835 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:22:54,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:54,835 INFO L85 PathProgramCache]: Analyzing trace with hash 36683412, now seen corresponding path program 1 times [2025-04-29 11:22:54,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:54,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341278101] [2025-04-29 11:22:54,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:54,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:54,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:22:54,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:22:54,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:54,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:54,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:54,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:54,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341278101] [2025-04-29 11:22:54,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341278101] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:54,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:54,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:54,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159396898] [2025-04-29 11:22:54,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:54,925 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:22:54,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:54,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:22:54,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:22:54,926 INFO L87 Difference]: Start difference. First operand 164 states and 192 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:55,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:55,047 INFO L93 Difference]: Finished difference Result 176 states and 206 transitions. [2025-04-29 11:22:55,048 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:55,048 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-29 11:22:55,048 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:55,049 INFO L225 Difference]: With dead ends: 176 [2025-04-29 11:22:55,049 INFO L226 Difference]: Without dead ends: 176 [2025-04-29 11:22:55,049 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-29 11:22:55,049 INFO L437 NwaCegarLoop]: 118 mSDtfsCounter, 20 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:55,049 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 230 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:55,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-04-29 11:22:55,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 171. [2025-04-29 11:22:55,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 130 states have (on average 1.5769230769230769) internal successors, (205), 170 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:55,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 205 transitions. [2025-04-29 11:22:55,052 INFO L79 Accepts]: Start accepts. Automaton has 171 states and 205 transitions. Word has length 14 [2025-04-29 11:22:55,052 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:55,052 INFO L485 AbstractCegarLoop]: Abstraction has 171 states and 205 transitions. [2025-04-29 11:22:55,053 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:55,053 INFO L278 IsEmpty]: Start isEmpty. Operand 171 states and 205 transitions. [2025-04-29 11:22:55,053 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 11:22:55,053 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:55,053 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:55,053 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:22:55,053 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:22:55,053 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:55,054 INFO L85 PathProgramCache]: Analyzing trace with hash 617594462, now seen corresponding path program 1 times [2025-04-29 11:22:55,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:55,054 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974426566] [2025-04-29 11:22:55,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:55,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:55,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:22:55,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:22:55,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:55,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:55,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:55,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:55,073 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974426566] [2025-04-29 11:22:55,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974426566] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:55,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:55,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:55,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5354838] [2025-04-29 11:22:55,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:55,074 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:55,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:55,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:55,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:55,075 INFO L87 Difference]: Start difference. First operand 171 states and 205 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:55,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:55,081 INFO L93 Difference]: Finished difference Result 173 states and 207 transitions. [2025-04-29 11:22:55,082 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:55,082 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-29 11:22:55,082 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:55,082 INFO L225 Difference]: With dead ends: 173 [2025-04-29 11:22:55,083 INFO L226 Difference]: Without dead ends: 173 [2025-04-29 11:22:55,083 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:55,083 INFO L437 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:55,083 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 248 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:55,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-04-29 11:22:55,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-04-29 11:22:55,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 132 states have (on average 1.5681818181818181) internal successors, (207), 172 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:55,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 207 transitions. [2025-04-29 11:22:55,086 INFO L79 Accepts]: Start accepts. Automaton has 173 states and 207 transitions. Word has length 17 [2025-04-29 11:22:55,086 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:55,086 INFO L485 AbstractCegarLoop]: Abstraction has 173 states and 207 transitions. [2025-04-29 11:22:55,087 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:55,087 INFO L278 IsEmpty]: Start isEmpty. Operand 173 states and 207 transitions. [2025-04-29 11:22:55,087 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 11:22:55,087 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:55,087 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:55,087 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:22:55,087 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:22:55,088 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:55,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1913940022, now seen corresponding path program 1 times [2025-04-29 11:22:55,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:55,088 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697584062] [2025-04-29 11:22:55,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:55,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:55,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:22:55,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:22:55,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:55,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:55,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:55,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:55,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697584062] [2025-04-29 11:22:55,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697584062] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:55,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:55,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:22:55,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807117634] [2025-04-29 11:22:55,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:55,145 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:55,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:55,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:55,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:55,146 INFO L87 Difference]: Start difference. First operand 173 states and 207 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:55,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:55,212 INFO L93 Difference]: Finished difference Result 179 states and 209 transitions. [2025-04-29 11:22:55,212 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:22:55,212 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-29 11:22:55,212 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:55,213 INFO L225 Difference]: With dead ends: 179 [2025-04-29 11:22:55,213 INFO L226 Difference]: Without dead ends: 179 [2025-04-29 11:22:55,213 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:55,214 INFO L437 NwaCegarLoop]: 121 mSDtfsCounter, 19 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:55,214 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 433 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:55,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-04-29 11:22:55,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 174. [2025-04-29 11:22:55,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 133 states have (on average 1.5639097744360901) internal successors, (208), 173 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:55,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 208 transitions. [2025-04-29 11:22:55,220 INFO L79 Accepts]: Start accepts. Automaton has 174 states and 208 transitions. Word has length 17 [2025-04-29 11:22:55,220 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:55,220 INFO L485 AbstractCegarLoop]: Abstraction has 174 states and 208 transitions. [2025-04-29 11:22:55,220 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:55,220 INFO L278 IsEmpty]: Start isEmpty. Operand 174 states and 208 transitions. [2025-04-29 11:22:55,221 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:22:55,221 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:55,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:55,221 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:22:55,222 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:22:55,222 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:55,222 INFO L85 PathProgramCache]: Analyzing trace with hash -232103557, now seen corresponding path program 1 times [2025-04-29 11:22:55,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:55,222 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426415563] [2025-04-29 11:22:55,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:55,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:55,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:22:55,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:22:55,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:55,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:55,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:55,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:55,418 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426415563] [2025-04-29 11:22:55,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426415563] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:55,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:55,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:22:55,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930189938] [2025-04-29 11:22:55,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:55,419 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:22:55,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:55,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:22:55,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:55,420 INFO L87 Difference]: Start difference. First operand 174 states and 208 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:55,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:55,564 INFO L93 Difference]: Finished difference Result 215 states and 255 transitions. [2025-04-29 11:22:55,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:22:55,565 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-29 11:22:55,565 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:55,565 INFO L225 Difference]: With dead ends: 215 [2025-04-29 11:22:55,565 INFO L226 Difference]: Without dead ends: 215 [2025-04-29 11:22:55,566 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:22:55,566 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 52 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:55,566 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 485 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:55,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-04-29 11:22:55,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 189. [2025-04-29 11:22:55,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 148 states have (on average 1.5405405405405406) internal successors, (228), 188 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:55,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 228 transitions. [2025-04-29 11:22:55,570 INFO L79 Accepts]: Start accepts. Automaton has 189 states and 228 transitions. Word has length 19 [2025-04-29 11:22:55,570 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:55,570 INFO L485 AbstractCegarLoop]: Abstraction has 189 states and 228 transitions. [2025-04-29 11:22:55,570 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:55,570 INFO L278 IsEmpty]: Start isEmpty. Operand 189 states and 228 transitions. [2025-04-29 11:22:55,570 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:22:55,570 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:55,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:55,570 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:22:55,571 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:22:55,571 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:55,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1050364954, now seen corresponding path program 1 times [2025-04-29 11:22:55,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:55,571 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234805132] [2025-04-29 11:22:55,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:55,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:55,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:22:55,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:22:55,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:55,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:55,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:55,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234805132] [2025-04-29 11:22:55,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234805132] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:55,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:55,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:22:55,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072219469] [2025-04-29 11:22:55,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:55,899 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:22:55,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:55,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:22:55,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:22:55,899 INFO L87 Difference]: Start difference. First operand 189 states and 228 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:56,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:56,291 INFO L93 Difference]: Finished difference Result 218 states and 252 transitions. [2025-04-29 11:22:56,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:22:56,291 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-29 11:22:56,291 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:56,292 INFO L225 Difference]: With dead ends: 218 [2025-04-29 11:22:56,292 INFO L226 Difference]: Without dead ends: 218 [2025-04-29 11:22:56,292 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:22:56,293 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 328 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:56,293 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 339 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:22:56,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-04-29 11:22:56,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 198. [2025-04-29 11:22:56,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 157 states have (on average 1.5286624203821657) internal successors, (240), 197 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:56,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 240 transitions. [2025-04-29 11:22:56,296 INFO L79 Accepts]: Start accepts. Automaton has 198 states and 240 transitions. Word has length 19 [2025-04-29 11:22:56,296 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:56,296 INFO L485 AbstractCegarLoop]: Abstraction has 198 states and 240 transitions. [2025-04-29 11:22:56,296 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:56,296 INFO L278 IsEmpty]: Start isEmpty. Operand 198 states and 240 transitions. [2025-04-29 11:22:56,297 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:22:56,297 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:56,297 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:56,297 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:22:56,297 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:22:56,297 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:56,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1050364953, now seen corresponding path program 1 times [2025-04-29 11:22:56,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:56,298 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488455669] [2025-04-29 11:22:56,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:56,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:56,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:22:56,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:22:56,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:56,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:56,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:56,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:56,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488455669] [2025-04-29 11:22:56,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488455669] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:56,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:56,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-29 11:22:56,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008544281] [2025-04-29 11:22:56,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:56,594 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:22:56,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:56,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:22:56,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:22:56,595 INFO L87 Difference]: Start difference. First operand 198 states and 240 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:57,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:57,002 INFO L93 Difference]: Finished difference Result 212 states and 255 transitions. [2025-04-29 11:22:57,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-29 11:22:57,002 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-29 11:22:57,003 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:57,003 INFO L225 Difference]: With dead ends: 212 [2025-04-29 11:22:57,003 INFO L226 Difference]: Without dead ends: 212 [2025-04-29 11:22:57,004 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:22:57,004 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 248 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:57,004 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 356 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:22:57,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-04-29 11:22:57,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 198. [2025-04-29 11:22:57,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 157 states have (on average 1.5222929936305734) internal successors, (239), 197 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:57,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 239 transitions. [2025-04-29 11:22:57,008 INFO L79 Accepts]: Start accepts. Automaton has 198 states and 239 transitions. Word has length 19 [2025-04-29 11:22:57,008 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:57,008 INFO L485 AbstractCegarLoop]: Abstraction has 198 states and 239 transitions. [2025-04-29 11:22:57,008 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:57,008 INFO L278 IsEmpty]: Start isEmpty. Operand 198 states and 239 transitions. [2025-04-29 11:22:57,009 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:22:57,009 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:57,009 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] [2025-04-29 11:22:57,009 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:22:57,009 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:22:57,009 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:57,009 INFO L85 PathProgramCache]: Analyzing trace with hash 493184809, now seen corresponding path program 1 times [2025-04-29 11:22:57,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:57,010 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280508811] [2025-04-29 11:22:57,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:57,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:57,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:22:57,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:22:57,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:57,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:57,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:57,073 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280508811] [2025-04-29 11:22:57,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280508811] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:57,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:57,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:22:57,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968662505] [2025-04-29 11:22:57,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:57,073 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:57,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:57,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:57,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:57,074 INFO L87 Difference]: Start difference. First operand 198 states and 239 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:57,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:57,204 INFO L93 Difference]: Finished difference Result 197 states and 237 transitions. [2025-04-29 11:22:57,204 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:57,205 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-29 11:22:57,205 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:57,205 INFO L225 Difference]: With dead ends: 197 [2025-04-29 11:22:57,205 INFO L226 Difference]: Without dead ends: 197 [2025-04-29 11:22:57,206 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:57,206 INFO L437 NwaCegarLoop]: 122 mSDtfsCounter, 3 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:57,206 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 306 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:57,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-04-29 11:22:57,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-04-29 11:22:57,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 157 states have (on average 1.5095541401273886) internal successors, (237), 196 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:57,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 237 transitions. [2025-04-29 11:22:57,209 INFO L79 Accepts]: Start accepts. Automaton has 197 states and 237 transitions. Word has length 20 [2025-04-29 11:22:57,209 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:57,209 INFO L485 AbstractCegarLoop]: Abstraction has 197 states and 237 transitions. [2025-04-29 11:22:57,210 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:57,210 INFO L278 IsEmpty]: Start isEmpty. Operand 197 states and 237 transitions. [2025-04-29 11:22:57,210 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:22:57,210 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:57,210 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] [2025-04-29 11:22:57,210 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:22:57,210 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:22:57,210 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:57,210 INFO L85 PathProgramCache]: Analyzing trace with hash 493184810, now seen corresponding path program 1 times [2025-04-29 11:22:57,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:57,210 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321995415] [2025-04-29 11:22:57,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:57,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:57,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:22:57,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:22:57,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:57,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:57,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-29 11:22:57,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:57,319 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321995415] [2025-04-29 11:22:57,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321995415] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:57,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:57,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:22:57,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000328510] [2025-04-29 11:22:57,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:57,320 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:57,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:57,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:57,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:57,321 INFO L87 Difference]: Start difference. First operand 197 states and 237 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:57,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:57,464 INFO L93 Difference]: Finished difference Result 196 states and 235 transitions. [2025-04-29 11:22:57,464 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:57,464 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-29 11:22:57,464 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:57,465 INFO L225 Difference]: With dead ends: 196 [2025-04-29 11:22:57,465 INFO L226 Difference]: Without dead ends: 196 [2025-04-29 11:22:57,465 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:57,466 INFO L437 NwaCegarLoop]: 121 mSDtfsCounter, 2 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:57,466 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 287 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:57,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-04-29 11:22:57,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-04-29 11:22:57,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 157 states have (on average 1.4968152866242037) internal successors, (235), 195 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:57,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 235 transitions. [2025-04-29 11:22:57,470 INFO L79 Accepts]: Start accepts. Automaton has 196 states and 235 transitions. Word has length 20 [2025-04-29 11:22:57,470 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:57,470 INFO L485 AbstractCegarLoop]: Abstraction has 196 states and 235 transitions. [2025-04-29 11:22:57,470 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:57,470 INFO L278 IsEmpty]: Start isEmpty. Operand 196 states and 235 transitions. [2025-04-29 11:22:57,471 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 11:22:57,471 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:57,471 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-29 11:22:57,471 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:22:57,471 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:22:57,472 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:57,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1709255840, now seen corresponding path program 1 times [2025-04-29 11:22:57,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:57,473 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476539923] [2025-04-29 11:22:57,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:57,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:57,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:22:57,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:22:57,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:57,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:57,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:57,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:57,556 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476539923] [2025-04-29 11:22:57,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476539923] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:57,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:57,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:57,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835390658] [2025-04-29 11:22:57,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:57,557 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:22:57,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:57,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:22:57,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:22:57,557 INFO L87 Difference]: Start difference. First operand 196 states and 235 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:57,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:57,659 INFO L93 Difference]: Finished difference Result 203 states and 244 transitions. [2025-04-29 11:22:57,659 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:57,659 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-04-29 11:22:57,659 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:57,660 INFO L225 Difference]: With dead ends: 203 [2025-04-29 11:22:57,660 INFO L226 Difference]: Without dead ends: 203 [2025-04-29 11:22:57,660 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-29 11:22:57,660 INFO L437 NwaCegarLoop]: 75 mSDtfsCounter, 139 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:57,661 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 91 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:57,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-04-29 11:22:57,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 188. [2025-04-29 11:22:57,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 156 states have (on average 1.455128205128205) internal successors, (227), 187 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:57,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 227 transitions. [2025-04-29 11:22:57,664 INFO L79 Accepts]: Start accepts. Automaton has 188 states and 227 transitions. Word has length 22 [2025-04-29 11:22:57,664 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:57,664 INFO L485 AbstractCegarLoop]: Abstraction has 188 states and 227 transitions. [2025-04-29 11:22:57,664 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:57,664 INFO L278 IsEmpty]: Start isEmpty. Operand 188 states and 227 transitions. [2025-04-29 11:22:57,664 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 11:22:57,664 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:57,664 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:57,664 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:22:57,665 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:22:57,665 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:57,665 INFO L85 PathProgramCache]: Analyzing trace with hash -614418061, now seen corresponding path program 1 times [2025-04-29 11:22:57,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:57,665 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759519856] [2025-04-29 11:22:57,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:57,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:57,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:22:57,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:22:57,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:57,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:57,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:57,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:57,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759519856] [2025-04-29 11:22:57,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759519856] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:57,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:57,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:22:57,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738786985] [2025-04-29 11:22:57,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:57,786 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:22:57,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:57,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:22:57,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:22:57,786 INFO L87 Difference]: Start difference. First operand 188 states and 227 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:58,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:58,032 INFO L93 Difference]: Finished difference Result 201 states and 241 transitions. [2025-04-29 11:22:58,033 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:22:58,033 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-29 11:22:58,033 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:58,034 INFO L225 Difference]: With dead ends: 201 [2025-04-29 11:22:58,034 INFO L226 Difference]: Without dead ends: 201 [2025-04-29 11:22:58,034 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:22:58,034 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 139 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:58,034 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 306 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:58,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-04-29 11:22:58,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 187. [2025-04-29 11:22:58,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 156 states have (on average 1.4423076923076923) internal successors, (225), 186 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:58,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 225 transitions. [2025-04-29 11:22:58,037 INFO L79 Accepts]: Start accepts. Automaton has 187 states and 225 transitions. Word has length 23 [2025-04-29 11:22:58,037 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:58,037 INFO L485 AbstractCegarLoop]: Abstraction has 187 states and 225 transitions. [2025-04-29 11:22:58,038 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:58,038 INFO L278 IsEmpty]: Start isEmpty. Operand 187 states and 225 transitions. [2025-04-29 11:22:58,038 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 11:22:58,038 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:58,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:58,038 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:22:58,039 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:22:58,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:58,040 INFO L85 PathProgramCache]: Analyzing trace with hash -614418060, now seen corresponding path program 1 times [2025-04-29 11:22:58,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:58,040 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690926314] [2025-04-29 11:22:58,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:58,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:58,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:22:58,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:22:58,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:58,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:58,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:58,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:58,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690926314] [2025-04-29 11:22:58,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690926314] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:58,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:58,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:22:58,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998485521] [2025-04-29 11:22:58,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:58,216 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:22:58,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:58,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:22:58,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:22:58,217 INFO L87 Difference]: Start difference. First operand 187 states and 225 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:58,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:58,497 INFO L93 Difference]: Finished difference Result 200 states and 239 transitions. [2025-04-29 11:22:58,497 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:22:58,497 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-29 11:22:58,497 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:58,498 INFO L225 Difference]: With dead ends: 200 [2025-04-29 11:22:58,498 INFO L226 Difference]: Without dead ends: 200 [2025-04-29 11:22:58,498 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:22:58,498 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 136 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:58,498 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 348 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:58,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-04-29 11:22:58,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 186. [2025-04-29 11:22:58,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 156 states have (on average 1.4294871794871795) internal successors, (223), 185 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:58,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 223 transitions. [2025-04-29 11:22:58,501 INFO L79 Accepts]: Start accepts. Automaton has 186 states and 223 transitions. Word has length 23 [2025-04-29 11:22:58,501 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:58,501 INFO L485 AbstractCegarLoop]: Abstraction has 186 states and 223 transitions. [2025-04-29 11:22:58,501 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:58,501 INFO L278 IsEmpty]: Start isEmpty. Operand 186 states and 223 transitions. [2025-04-29 11:22:58,502 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:22:58,502 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:58,502 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] [2025-04-29 11:22:58,502 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:22:58,502 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:22:58,502 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:58,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1841807221, now seen corresponding path program 1 times [2025-04-29 11:22:58,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:58,503 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370817145] [2025-04-29 11:22:58,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:58,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:58,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:22:58,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:22:58,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:58,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:58,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:58,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:58,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370817145] [2025-04-29 11:22:58,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370817145] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:58,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:58,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:58,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394868496] [2025-04-29 11:22:58,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:58,524 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:58,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:58,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:58,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:58,525 INFO L87 Difference]: Start difference. First operand 186 states and 223 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:58,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:58,531 INFO L93 Difference]: Finished difference Result 189 states and 226 transitions. [2025-04-29 11:22:58,531 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:58,531 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-29 11:22:58,531 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:58,532 INFO L225 Difference]: With dead ends: 189 [2025-04-29 11:22:58,532 INFO L226 Difference]: Without dead ends: 189 [2025-04-29 11:22:58,532 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:58,532 INFO L437 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:58,532 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:58,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-04-29 11:22:58,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2025-04-29 11:22:58,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 158 states have (on average 1.4240506329113924) internal successors, (225), 187 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:58,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 225 transitions. [2025-04-29 11:22:58,536 INFO L79 Accepts]: Start accepts. Automaton has 188 states and 225 transitions. Word has length 24 [2025-04-29 11:22:58,536 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:58,536 INFO L485 AbstractCegarLoop]: Abstraction has 188 states and 225 transitions. [2025-04-29 11:22:58,536 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:58,536 INFO L278 IsEmpty]: Start isEmpty. Operand 188 states and 225 transitions. [2025-04-29 11:22:58,537 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:22:58,537 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:58,537 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] [2025-04-29 11:22:58,537 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-29 11:22:58,537 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:22:58,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:58,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1899065523, now seen corresponding path program 1 times [2025-04-29 11:22:58,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:58,538 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476523404] [2025-04-29 11:22:58,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:58,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:58,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:22:58,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:22:58,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:58,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:58,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:58,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:58,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476523404] [2025-04-29 11:22:58,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476523404] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:58,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:58,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:22:58,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089992199] [2025-04-29 11:22:58,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:58,593 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:58,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:58,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:58,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:58,594 INFO L87 Difference]: Start difference. First operand 188 states and 225 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:58,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:58,717 INFO L93 Difference]: Finished difference Result 187 states and 223 transitions. [2025-04-29 11:22:58,717 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:58,717 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-29 11:22:58,717 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:58,718 INFO L225 Difference]: With dead ends: 187 [2025-04-29 11:22:58,718 INFO L226 Difference]: Without dead ends: 187 [2025-04-29 11:22:58,718 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:58,718 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 3 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:58,719 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 275 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:58,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-04-29 11:22:58,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-04-29 11:22:58,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 158 states have (on average 1.4113924050632911) internal successors, (223), 186 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:58,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 223 transitions. [2025-04-29 11:22:58,722 INFO L79 Accepts]: Start accepts. Automaton has 187 states and 223 transitions. Word has length 24 [2025-04-29 11:22:58,722 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:58,722 INFO L485 AbstractCegarLoop]: Abstraction has 187 states and 223 transitions. [2025-04-29 11:22:58,722 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:58,722 INFO L278 IsEmpty]: Start isEmpty. Operand 187 states and 223 transitions. [2025-04-29 11:22:58,722 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:22:58,722 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:58,722 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] [2025-04-29 11:22:58,723 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-29 11:22:58,723 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:22:58,724 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:58,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1899065522, now seen corresponding path program 1 times [2025-04-29 11:22:58,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:58,724 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274875157] [2025-04-29 11:22:58,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:58,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:58,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:22:58,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:22:58,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:58,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:58,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:58,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:58,804 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274875157] [2025-04-29 11:22:58,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274875157] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:58,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:58,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:22:58,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83812262] [2025-04-29 11:22:58,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:58,805 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:58,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:58,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:58,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:58,805 INFO L87 Difference]: Start difference. First operand 187 states and 223 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:58,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:58,918 INFO L93 Difference]: Finished difference Result 186 states and 221 transitions. [2025-04-29 11:22:58,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:58,919 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-29 11:22:58,919 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:58,919 INFO L225 Difference]: With dead ends: 186 [2025-04-29 11:22:58,919 INFO L226 Difference]: Without dead ends: 186 [2025-04-29 11:22:58,920 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:58,921 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 2 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:58,921 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 270 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:58,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-04-29 11:22:58,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-04-29 11:22:58,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 158 states have (on average 1.3987341772151898) internal successors, (221), 185 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 221 transitions. [2025-04-29 11:22:58,924 INFO L79 Accepts]: Start accepts. Automaton has 186 states and 221 transitions. Word has length 24 [2025-04-29 11:22:58,924 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:58,924 INFO L485 AbstractCegarLoop]: Abstraction has 186 states and 221 transitions. [2025-04-29 11:22:58,924 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:58,924 INFO L278 IsEmpty]: Start isEmpty. Operand 186 states and 221 transitions. [2025-04-29 11:22:58,924 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:22:58,924 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:58,924 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] [2025-04-29 11:22:58,925 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 11:22:58,925 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:22:58,925 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:58,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1905854791, now seen corresponding path program 1 times [2025-04-29 11:22:58,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:58,925 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608892487] [2025-04-29 11:22:58,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:58,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:58,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:22:58,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:22:58,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:58,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:59,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:59,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:59,074 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608892487] [2025-04-29 11:22:59,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608892487] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:59,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:59,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:22:59,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079820040] [2025-04-29 11:22:59,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:59,074 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:22:59,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:59,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:22:59,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:22:59,075 INFO L87 Difference]: Start difference. First operand 186 states and 221 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:59,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:59,358 INFO L93 Difference]: Finished difference Result 223 states and 259 transitions. [2025-04-29 11:22:59,358 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:22:59,358 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-29 11:22:59,358 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:59,359 INFO L225 Difference]: With dead ends: 223 [2025-04-29 11:22:59,359 INFO L226 Difference]: Without dead ends: 223 [2025-04-29 11:22:59,359 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:22:59,360 INFO L437 NwaCegarLoop]: 78 mSDtfsCounter, 192 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:59,360 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 459 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:59,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-04-29 11:22:59,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 199. [2025-04-29 11:22:59,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 171 states have (on average 1.391812865497076) internal successors, (238), 198 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 238 transitions. [2025-04-29 11:22:59,363 INFO L79 Accepts]: Start accepts. Automaton has 199 states and 238 transitions. Word has length 24 [2025-04-29 11:22:59,363 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:59,363 INFO L485 AbstractCegarLoop]: Abstraction has 199 states and 238 transitions. [2025-04-29 11:22:59,363 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:59,363 INFO L278 IsEmpty]: Start isEmpty. Operand 199 states and 238 transitions. [2025-04-29 11:22:59,363 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:22:59,363 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:59,363 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] [2025-04-29 11:22:59,363 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-29 11:22:59,364 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:22:59,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:59,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1905866767, now seen corresponding path program 1 times [2025-04-29 11:22:59,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:59,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805125474] [2025-04-29 11:22:59,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:59,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:59,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:22:59,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:22:59,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:59,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:59,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:59,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:59,422 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805125474] [2025-04-29 11:22:59,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805125474] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:59,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:59,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:22:59,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588854751] [2025-04-29 11:22:59,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:59,422 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:59,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:59,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:59,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:59,423 INFO L87 Difference]: Start difference. First operand 199 states and 238 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:59,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:59,532 INFO L93 Difference]: Finished difference Result 241 states and 287 transitions. [2025-04-29 11:22:59,532 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:22:59,532 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-29 11:22:59,532 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:59,533 INFO L225 Difference]: With dead ends: 241 [2025-04-29 11:22:59,534 INFO L226 Difference]: Without dead ends: 241 [2025-04-29 11:22:59,534 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-29 11:22:59,534 INFO L437 NwaCegarLoop]: 85 mSDtfsCounter, 135 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:59,534 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 128 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:59,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-04-29 11:22:59,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 176. [2025-04-29 11:22:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 154 states have (on average 1.3506493506493507) internal successors, (208), 175 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:59,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 208 transitions. [2025-04-29 11:22:59,538 INFO L79 Accepts]: Start accepts. Automaton has 176 states and 208 transitions. Word has length 24 [2025-04-29 11:22:59,538 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:59,538 INFO L485 AbstractCegarLoop]: Abstraction has 176 states and 208 transitions. [2025-04-29 11:22:59,538 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:59,539 INFO L278 IsEmpty]: Start isEmpty. Operand 176 states and 208 transitions. [2025-04-29 11:22:59,539 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 11:22:59,539 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:59,539 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-29 11:22:59,539 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-29 11:22:59,539 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:22:59,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:59,540 INFO L85 PathProgramCache]: Analyzing trace with hash 691657154, now seen corresponding path program 1 times [2025-04-29 11:22:59,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:59,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973903010] [2025-04-29 11:22:59,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:59,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:59,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:22:59,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:22:59,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:59,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:59,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:59,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:59,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973903010] [2025-04-29 11:22:59,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973903010] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:59,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:59,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-29 11:22:59,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595847172] [2025-04-29 11:22:59,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:59,973 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:22:59,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:59,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:22:59,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:22:59,974 INFO L87 Difference]: Start difference. First operand 176 states and 208 transitions. Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:00,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:00,539 INFO L93 Difference]: Finished difference Result 232 states and 270 transitions. [2025-04-29 11:23:00,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-29 11:23:00,540 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-29 11:23:00,540 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:00,540 INFO L225 Difference]: With dead ends: 232 [2025-04-29 11:23:00,540 INFO L226 Difference]: Without dead ends: 232 [2025-04-29 11:23:00,541 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2025-04-29 11:23:00,541 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 197 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:00,541 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 429 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:23:00,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-04-29 11:23:00,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 176. [2025-04-29 11:23:00,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 154 states have (on average 1.3376623376623376) internal successors, (206), 175 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:00,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 206 transitions. [2025-04-29 11:23:00,544 INFO L79 Accepts]: Start accepts. Automaton has 176 states and 206 transitions. Word has length 25 [2025-04-29 11:23:00,544 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:00,545 INFO L485 AbstractCegarLoop]: Abstraction has 176 states and 206 transitions. [2025-04-29 11:23:00,545 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:00,545 INFO L278 IsEmpty]: Start isEmpty. Operand 176 states and 206 transitions. [2025-04-29 11:23:00,545 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:23:00,545 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:00,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:00,545 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-29 11:23:00,545 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:23:00,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:00,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1022223888, now seen corresponding path program 1 times [2025-04-29 11:23:00,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:00,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809675851] [2025-04-29 11:23:00,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:00,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:00,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:23:00,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:23:00,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:00,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:00,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:00,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:00,685 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809675851] [2025-04-29 11:23:00,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809675851] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:00,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:00,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:23:00,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531702994] [2025-04-29 11:23:00,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:00,686 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:23:00,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:00,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:23:00,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:23:00,687 INFO L87 Difference]: Start difference. First operand 176 states and 206 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:00,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:00,917 INFO L93 Difference]: Finished difference Result 204 states and 239 transitions. [2025-04-29 11:23:00,917 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:23:00,917 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-29 11:23:00,917 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:00,918 INFO L225 Difference]: With dead ends: 204 [2025-04-29 11:23:00,918 INFO L226 Difference]: Without dead ends: 204 [2025-04-29 11:23:00,918 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:23:00,918 INFO L437 NwaCegarLoop]: 74 mSDtfsCounter, 139 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:00,919 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 293 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:23:00,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-04-29 11:23:00,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 175. [2025-04-29 11:23:00,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 154 states have (on average 1.3246753246753247) internal successors, (204), 174 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 204 transitions. [2025-04-29 11:23:00,922 INFO L79 Accepts]: Start accepts. Automaton has 175 states and 204 transitions. Word has length 26 [2025-04-29 11:23:00,922 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:00,922 INFO L485 AbstractCegarLoop]: Abstraction has 175 states and 204 transitions. [2025-04-29 11:23:00,922 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:00,922 INFO L278 IsEmpty]: Start isEmpty. Operand 175 states and 204 transitions. [2025-04-29 11:23:00,922 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:23:00,922 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:00,922 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:00,922 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-29 11:23:00,922 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:23:00,923 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:00,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1022223889, now seen corresponding path program 1 times [2025-04-29 11:23:00,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:00,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533001802] [2025-04-29 11:23:00,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:00,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:00,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:23:00,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:23:00,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:00,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:01,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:01,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:01,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533001802] [2025-04-29 11:23:01,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533001802] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:01,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:01,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:23:01,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746806331] [2025-04-29 11:23:01,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:01,114 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:23:01,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:01,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:23:01,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:23:01,115 INFO L87 Difference]: Start difference. First operand 175 states and 204 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:01,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:01,376 INFO L93 Difference]: Finished difference Result 188 states and 218 transitions. [2025-04-29 11:23:01,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:23:01,377 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-29 11:23:01,377 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:01,377 INFO L225 Difference]: With dead ends: 188 [2025-04-29 11:23:01,377 INFO L226 Difference]: Without dead ends: 188 [2025-04-29 11:23:01,377 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:23:01,378 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 123 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:01,378 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 300 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:23:01,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-04-29 11:23:01,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 174. [2025-04-29 11:23:01,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 154 states have (on average 1.3116883116883118) internal successors, (202), 173 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:01,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 202 transitions. [2025-04-29 11:23:01,380 INFO L79 Accepts]: Start accepts. Automaton has 174 states and 202 transitions. Word has length 26 [2025-04-29 11:23:01,380 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:01,380 INFO L485 AbstractCegarLoop]: Abstraction has 174 states and 202 transitions. [2025-04-29 11:23:01,381 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:01,381 INFO L278 IsEmpty]: Start isEmpty. Operand 174 states and 202 transitions. [2025-04-29 11:23:01,381 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 11:23:01,381 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:01,381 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-29 11:23:01,381 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-29 11:23:01,381 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:23:01,381 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:01,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1751675432, now seen corresponding path program 1 times [2025-04-29 11:23:01,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:01,382 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916492401] [2025-04-29 11:23:01,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:01,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:01,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:23:01,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:23:01,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:01,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:01,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:01,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:01,502 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916492401] [2025-04-29 11:23:01,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916492401] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:01,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:01,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:23:01,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797162867] [2025-04-29 11:23:01,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:01,502 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:23:01,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:01,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:23:01,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:23:01,503 INFO L87 Difference]: Start difference. First operand 174 states and 202 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:01,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:01,754 INFO L93 Difference]: Finished difference Result 187 states and 217 transitions. [2025-04-29 11:23:01,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:23:01,754 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-29 11:23:01,754 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:01,755 INFO L225 Difference]: With dead ends: 187 [2025-04-29 11:23:01,755 INFO L226 Difference]: Without dead ends: 187 [2025-04-29 11:23:01,755 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:23:01,755 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 118 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:01,756 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 336 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:23:01,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-04-29 11:23:01,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 173. [2025-04-29 11:23:01,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 154 states have (on average 1.3051948051948052) internal successors, (201), 172 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 201 transitions. [2025-04-29 11:23:01,760 INFO L79 Accepts]: Start accepts. Automaton has 173 states and 201 transitions. Word has length 27 [2025-04-29 11:23:01,760 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:01,760 INFO L485 AbstractCegarLoop]: Abstraction has 173 states and 201 transitions. [2025-04-29 11:23:01,760 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:01,760 INFO L278 IsEmpty]: Start isEmpty. Operand 173 states and 201 transitions. [2025-04-29 11:23:01,760 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 11:23:01,760 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:01,760 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-29 11:23:01,760 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-29 11:23:01,760 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:23:01,761 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:01,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1751675431, now seen corresponding path program 1 times [2025-04-29 11:23:01,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:01,761 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107767239] [2025-04-29 11:23:01,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:01,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:01,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:23:01,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:23:01,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:01,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:01,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:01,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:01,914 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107767239] [2025-04-29 11:23:01,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107767239] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:01,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:01,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:23:01,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742762639] [2025-04-29 11:23:01,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:01,914 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:23:01,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:01,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:23:01,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:23:01,915 INFO L87 Difference]: Start difference. First operand 173 states and 201 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:02,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:02,144 INFO L93 Difference]: Finished difference Result 186 states and 216 transitions. [2025-04-29 11:23:02,144 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:23:02,145 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-29 11:23:02,145 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:02,145 INFO L225 Difference]: With dead ends: 186 [2025-04-29 11:23:02,145 INFO L226 Difference]: Without dead ends: 186 [2025-04-29 11:23:02,145 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:23:02,146 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 116 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:02,146 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 298 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:23:02,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-04-29 11:23:02,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2025-04-29 11:23:02,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 154 states have (on average 1.2987012987012987) internal successors, (200), 171 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:02,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 200 transitions. [2025-04-29 11:23:02,148 INFO L79 Accepts]: Start accepts. Automaton has 172 states and 200 transitions. Word has length 27 [2025-04-29 11:23:02,148 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:02,148 INFO L485 AbstractCegarLoop]: Abstraction has 172 states and 200 transitions. [2025-04-29 11:23:02,148 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:02,148 INFO L278 IsEmpty]: Start isEmpty. Operand 172 states and 200 transitions. [2025-04-29 11:23:02,148 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 11:23:02,148 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:02,148 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-29 11:23:02,149 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-29 11:23:02,149 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:23:02,149 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:02,149 INFO L85 PathProgramCache]: Analyzing trace with hash -2147147519, now seen corresponding path program 1 times [2025-04-29 11:23:02,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:02,149 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350874071] [2025-04-29 11:23:02,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:02,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:02,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:23:02,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:23:02,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:02,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:02,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:02,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:02,347 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350874071] [2025-04-29 11:23:02,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350874071] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:02,347 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114178421] [2025-04-29 11:23:02,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:02,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:02,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:02,350 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:23:02,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:23:02,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:23:02,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:23:02,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:02,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:02,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-29 11:23:02,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:02,589 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:23:02,654 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:02,654 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 40 treesize of output 30 [2025-04-29 11:23:02,784 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:23:02,784 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 29 [2025-04-29 11:23:02,845 INFO L325 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2025-04-29 11:23:02,846 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 37 [2025-04-29 11:23:02,855 WARN L871 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~st~0#1.base_28| Int) (|v_ULTIMATE.start_main_~n~0#1.base_84| Int)) (and (= (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_84|) 0) (= (select |c_#valid| |v_ULTIMATE.start_main_~st~0#1.base_28|) 0) (= (store (store |c_#valid| |v_ULTIMATE.start_main_~st~0#1.base_28| 0) |v_ULTIMATE.start_main_~n~0#1.base_84| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from true [2025-04-29 11:23:02,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-04-29 11:23:02,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:02,947 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 14 treesize of output 12 [2025-04-29 11:23:02,950 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-04-29 11:23:02,964 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-04-29 11:23:02,969 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2025-04-29 11:23:11,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:11,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114178421] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:11,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:23:11,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 24 [2025-04-29 11:23:11,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241290155] [2025-04-29 11:23:11,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:11,400 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-29 11:23:11,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:11,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-29 11:23:11,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=482, Unknown=3, NotChecked=44, Total=600 [2025-04-29 11:23:11,401 INFO L87 Difference]: Start difference. First operand 172 states and 200 transitions. Second operand has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:12,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:12,295 INFO L93 Difference]: Finished difference Result 217 states and 248 transitions. [2025-04-29 11:23:12,295 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:23:12,296 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-29 11:23:12,296 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:12,296 INFO L225 Difference]: With dead ends: 217 [2025-04-29 11:23:12,296 INFO L226 Difference]: Without dead ends: 216 [2025-04-29 11:23:12,297 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=109, Invalid=762, Unknown=3, NotChecked=56, Total=930 [2025-04-29 11:23:12,297 INFO L437 NwaCegarLoop]: 78 mSDtfsCounter, 79 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:12,297 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 763 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 980 Invalid, 0 Unknown, 171 Unchecked, 0.7s Time] [2025-04-29 11:23:12,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-04-29 11:23:12,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 191. [2025-04-29 11:23:12,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 173 states have (on average 1.277456647398844) internal successors, (221), 190 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:12,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 221 transitions. [2025-04-29 11:23:12,302 INFO L79 Accepts]: Start accepts. Automaton has 191 states and 221 transitions. Word has length 27 [2025-04-29 11:23:12,302 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:12,302 INFO L485 AbstractCegarLoop]: Abstraction has 191 states and 221 transitions. [2025-04-29 11:23:12,302 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:12,302 INFO L278 IsEmpty]: Start isEmpty. Operand 191 states and 221 transitions. [2025-04-29 11:23:12,303 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 11:23:12,303 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:12,303 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:12,309 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-29 11:23:12,507 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:12,507 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:23:12,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:12,507 INFO L85 PathProgramCache]: Analyzing trace with hash -2147149439, now seen corresponding path program 1 times [2025-04-29 11:23:12,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:12,508 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380755784] [2025-04-29 11:23:12,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:12,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:12,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:23:12,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:23:12,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:12,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:12,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:12,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:12,601 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380755784] [2025-04-29 11:23:12,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380755784] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:12,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398920459] [2025-04-29 11:23:12,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:12,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:12,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:12,603 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:23:12,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:23:12,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:23:12,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:23:12,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:12,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:12,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-29 11:23:12,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:12,676 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:23:12,680 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:23:12,685 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-29 11:23:12,689 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-29 11:23:12,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:12,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:12,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:12,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398920459] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:12,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:23:12,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-04-29 11:23:12,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063376594] [2025-04-29 11:23:12,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:12,765 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:23:12,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:12,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:23:12,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:23:12,765 INFO L87 Difference]: Start difference. First operand 191 states and 221 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:12,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:12,818 INFO L93 Difference]: Finished difference Result 194 states and 223 transitions. [2025-04-29 11:23:12,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:23:12,818 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-29 11:23:12,818 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:12,818 INFO L225 Difference]: With dead ends: 194 [2025-04-29 11:23:12,818 INFO L226 Difference]: Without dead ends: 190 [2025-04-29 11:23:12,819 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:23:12,819 INFO L437 NwaCegarLoop]: 99 mSDtfsCounter, 2 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:12,819 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 349 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:23:12,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-04-29 11:23:12,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2025-04-29 11:23:12,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 171 states have (on average 1.2748538011695907) internal successors, (218), 188 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:12,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 218 transitions. [2025-04-29 11:23:12,821 INFO L79 Accepts]: Start accepts. Automaton has 189 states and 218 transitions. Word has length 27 [2025-04-29 11:23:12,821 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:12,822 INFO L485 AbstractCegarLoop]: Abstraction has 189 states and 218 transitions. [2025-04-29 11:23:12,822 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:12,822 INFO L278 IsEmpty]: Start isEmpty. Operand 189 states and 218 transitions. [2025-04-29 11:23:12,822 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:23:12,822 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:12,822 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] [2025-04-29 11:23:12,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:23:13,026 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,SelfDestructingSolverStorable30 [2025-04-29 11:23:13,026 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:23:13,027 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:13,027 INFO L85 PathProgramCache]: Analyzing trace with hash -310044012, now seen corresponding path program 1 times [2025-04-29 11:23:13,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:13,027 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668256267] [2025-04-29 11:23:13,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:13,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:13,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:23:13,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:23:13,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:13,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:13,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:13,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:13,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668256267] [2025-04-29 11:23:13,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668256267] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:13,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:13,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:23:13,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732148470] [2025-04-29 11:23:13,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:13,170 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:23:13,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:13,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:23:13,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:23:13,170 INFO L87 Difference]: Start difference. First operand 189 states and 218 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:13,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:13,465 INFO L93 Difference]: Finished difference Result 210 states and 241 transitions. [2025-04-29 11:23:13,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:23:13,465 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-29 11:23:13,465 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:13,466 INFO L225 Difference]: With dead ends: 210 [2025-04-29 11:23:13,466 INFO L226 Difference]: Without dead ends: 210 [2025-04-29 11:23:13,466 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:23:13,466 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 114 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:13,466 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 373 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:23:13,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-04-29 11:23:13,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 188. [2025-04-29 11:23:13,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 171 states have (on average 1.2690058479532165) internal successors, (217), 187 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:13,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 217 transitions. [2025-04-29 11:23:13,475 INFO L79 Accepts]: Start accepts. Automaton has 188 states and 217 transitions. Word has length 30 [2025-04-29 11:23:13,475 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:13,475 INFO L485 AbstractCegarLoop]: Abstraction has 188 states and 217 transitions. [2025-04-29 11:23:13,475 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:13,475 INFO L278 IsEmpty]: Start isEmpty. Operand 188 states and 217 transitions. [2025-04-29 11:23:13,475 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:23:13,475 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:13,475 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] [2025-04-29 11:23:13,475 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-29 11:23:13,475 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:23:13,476 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:13,476 INFO L85 PathProgramCache]: Analyzing trace with hash -310044011, now seen corresponding path program 1 times [2025-04-29 11:23:13,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:13,476 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278320002] [2025-04-29 11:23:13,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:13,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:13,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:23:13,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:23:13,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:13,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:13,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:13,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:13,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278320002] [2025-04-29 11:23:13,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278320002] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:13,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:13,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:23:13,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141244289] [2025-04-29 11:23:13,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:13,682 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:23:13,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:13,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:23:13,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:23:13,682 INFO L87 Difference]: Start difference. First operand 188 states and 217 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:13,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:13,997 INFO L93 Difference]: Finished difference Result 209 states and 240 transitions. [2025-04-29 11:23:13,998 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:23:13,998 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-29 11:23:13,998 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:13,998 INFO L225 Difference]: With dead ends: 209 [2025-04-29 11:23:13,998 INFO L226 Difference]: Without dead ends: 209 [2025-04-29 11:23:13,999 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:23:13,999 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 111 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:13,999 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 390 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:23:13,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-04-29 11:23:14,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 187. [2025-04-29 11:23:14,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 171 states have (on average 1.263157894736842) internal successors, (216), 186 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:14,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 216 transitions. [2025-04-29 11:23:14,002 INFO L79 Accepts]: Start accepts. Automaton has 187 states and 216 transitions. Word has length 30 [2025-04-29 11:23:14,002 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:14,002 INFO L485 AbstractCegarLoop]: Abstraction has 187 states and 216 transitions. [2025-04-29 11:23:14,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:14,002 INFO L278 IsEmpty]: Start isEmpty. Operand 187 states and 216 transitions. [2025-04-29 11:23:14,002 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-29 11:23:14,002 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:14,002 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] [2025-04-29 11:23:14,002 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-29 11:23:14,002 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:23:14,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:14,003 INFO L85 PathProgramCache]: Analyzing trace with hash -505950137, now seen corresponding path program 1 times [2025-04-29 11:23:14,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:14,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936677118] [2025-04-29 11:23:14,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:14,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:14,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:23:14,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:23:14,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:14,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:14,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:14,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:14,034 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936677118] [2025-04-29 11:23:14,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936677118] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:14,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:14,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:23:14,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109874509] [2025-04-29 11:23:14,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:14,034 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:23:14,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:14,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:23:14,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:23:14,035 INFO L87 Difference]: Start difference. First operand 187 states and 216 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:14,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:14,067 INFO L93 Difference]: Finished difference Result 194 states and 218 transitions. [2025-04-29 11:23:14,068 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:23:14,068 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-29 11:23:14,068 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:14,068 INFO L225 Difference]: With dead ends: 194 [2025-04-29 11:23:14,068 INFO L226 Difference]: Without dead ends: 194 [2025-04-29 11:23:14,068 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:23:14,069 INFO L437 NwaCegarLoop]: 93 mSDtfsCounter, 17 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:14,069 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 262 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:23:14,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-04-29 11:23:14,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 187. [2025-04-29 11:23:14,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 171 states have (on average 1.2573099415204678) internal successors, (215), 186 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:14,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 215 transitions. [2025-04-29 11:23:14,071 INFO L79 Accepts]: Start accepts. Automaton has 187 states and 215 transitions. Word has length 31 [2025-04-29 11:23:14,072 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:14,072 INFO L485 AbstractCegarLoop]: Abstraction has 187 states and 215 transitions. [2025-04-29 11:23:14,072 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:14,072 INFO L278 IsEmpty]: Start isEmpty. Operand 187 states and 215 transitions. [2025-04-29 11:23:14,072 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-29 11:23:14,072 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:14,072 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:14,072 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-29 11:23:14,072 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:23:14,072 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:14,072 INFO L85 PathProgramCache]: Analyzing trace with hash -505952057, now seen corresponding path program 1 times [2025-04-29 11:23:14,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:14,072 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051284068] [2025-04-29 11:23:14,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:14,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:14,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:23:14,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:23:14,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:14,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:14,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:14,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051284068] [2025-04-29 11:23:14,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051284068] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:14,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:14,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:23:14,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065756881] [2025-04-29 11:23:14,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:14,133 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:23:14,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:14,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:23:14,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:23:14,134 INFO L87 Difference]: Start difference. First operand 187 states and 215 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:14,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:14,295 INFO L93 Difference]: Finished difference Result 214 states and 240 transitions. [2025-04-29 11:23:14,295 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:23:14,295 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-29 11:23:14,296 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:14,296 INFO L225 Difference]: With dead ends: 214 [2025-04-29 11:23:14,296 INFO L226 Difference]: Without dead ends: 214 [2025-04-29 11:23:14,296 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:23:14,297 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 80 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:14,297 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 209 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:14,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-04-29 11:23:14,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 187. [2025-04-29 11:23:14,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 171 states have (on average 1.2514619883040936) internal successors, (214), 186 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:14,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 214 transitions. [2025-04-29 11:23:14,300 INFO L79 Accepts]: Start accepts. Automaton has 187 states and 214 transitions. Word has length 31 [2025-04-29 11:23:14,300 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:14,300 INFO L485 AbstractCegarLoop]: Abstraction has 187 states and 214 transitions. [2025-04-29 11:23:14,300 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:14,300 INFO L278 IsEmpty]: Start isEmpty. Operand 187 states and 214 transitions. [2025-04-29 11:23:14,301 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-29 11:23:14,301 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:14,301 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] [2025-04-29 11:23:14,301 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-29 11:23:14,301 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:23:14,301 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:14,301 INFO L85 PathProgramCache]: Analyzing trace with hash -888618072, now seen corresponding path program 1 times [2025-04-29 11:23:14,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:14,301 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914513740] [2025-04-29 11:23:14,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:14,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:14,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:23:14,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:23:14,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:14,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:14,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:23:14,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:14,332 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914513740] [2025-04-29 11:23:14,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914513740] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:14,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:14,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:23:14,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679689882] [2025-04-29 11:23:14,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:14,332 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:23:14,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:14,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:23:14,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:23:14,333 INFO L87 Difference]: Start difference. First operand 187 states and 214 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:14,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:14,403 INFO L93 Difference]: Finished difference Result 186 states and 212 transitions. [2025-04-29 11:23:14,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:23:14,403 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-29 11:23:14,403 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:14,403 INFO L225 Difference]: With dead ends: 186 [2025-04-29 11:23:14,403 INFO L226 Difference]: Without dead ends: 186 [2025-04-29 11:23:14,404 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:23:14,404 INFO L437 NwaCegarLoop]: 86 mSDtfsCounter, 11 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:14,404 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 174 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:14,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-04-29 11:23:14,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-04-29 11:23:14,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 171 states have (on average 1.239766081871345) internal successors, (212), 185 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:14,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 212 transitions. [2025-04-29 11:23:14,406 INFO L79 Accepts]: Start accepts. Automaton has 186 states and 212 transitions. Word has length 33 [2025-04-29 11:23:14,406 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:14,406 INFO L485 AbstractCegarLoop]: Abstraction has 186 states and 212 transitions. [2025-04-29 11:23:14,406 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:14,406 INFO L278 IsEmpty]: Start isEmpty. Operand 186 states and 212 transitions. [2025-04-29 11:23:14,407 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-29 11:23:14,407 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:14,407 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:14,407 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-29 11:23:14,407 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:23:14,408 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:14,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1049416667, now seen corresponding path program 1 times [2025-04-29 11:23:14,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:14,408 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726320531] [2025-04-29 11:23:14,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:14,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:14,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:23:14,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:23:14,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:14,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:14,832 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:14,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:14,832 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726320531] [2025-04-29 11:23:14,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726320531] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:14,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:14,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-29 11:23:14,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442107610] [2025-04-29 11:23:14,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:14,832 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:23:14,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:14,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:23:14,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:23:14,833 INFO L87 Difference]: Start difference. First operand 186 states and 212 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:15,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:15,318 INFO L93 Difference]: Finished difference Result 220 states and 247 transitions. [2025-04-29 11:23:15,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:23:15,318 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-29 11:23:15,318 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:15,319 INFO L225 Difference]: With dead ends: 220 [2025-04-29 11:23:15,319 INFO L226 Difference]: Without dead ends: 209 [2025-04-29 11:23:15,319 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2025-04-29 11:23:15,319 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 153 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:15,319 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 496 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:23:15,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-04-29 11:23:15,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 186. [2025-04-29 11:23:15,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 171 states have (on average 1.2339181286549707) internal successors, (211), 185 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:15,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 211 transitions. [2025-04-29 11:23:15,322 INFO L79 Accepts]: Start accepts. Automaton has 186 states and 211 transitions. Word has length 38 [2025-04-29 11:23:15,322 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:15,322 INFO L485 AbstractCegarLoop]: Abstraction has 186 states and 211 transitions. [2025-04-29 11:23:15,322 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:15,322 INFO L278 IsEmpty]: Start isEmpty. Operand 186 states and 211 transitions. [2025-04-29 11:23:15,323 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-29 11:23:15,323 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:15,323 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:15,323 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-29 11:23:15,323 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:23:15,323 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:15,323 INFO L85 PathProgramCache]: Analyzing trace with hash -659009819, now seen corresponding path program 1 times [2025-04-29 11:23:15,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:15,323 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687954738] [2025-04-29 11:23:15,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:15,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:15,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:23:15,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:23:15,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:15,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:15,706 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:15,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:15,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687954738] [2025-04-29 11:23:15,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687954738] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:15,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:15,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-29 11:23:15,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84938067] [2025-04-29 11:23:15,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:15,707 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:23:15,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:15,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:23:15,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:23:15,708 INFO L87 Difference]: Start difference. First operand 186 states and 211 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:16,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:16,052 INFO L93 Difference]: Finished difference Result 208 states and 233 transitions. [2025-04-29 11:23:16,052 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-29 11:23:16,052 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-29 11:23:16,052 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:16,053 INFO L225 Difference]: With dead ends: 208 [2025-04-29 11:23:16,053 INFO L226 Difference]: Without dead ends: 185 [2025-04-29 11:23:16,053 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:23:16,053 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 231 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:16,053 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 498 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:23:16,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-04-29 11:23:16,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 171. [2025-04-29 11:23:16,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 156 states have (on average 1.25) internal successors, (195), 170 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:16,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 195 transitions. [2025-04-29 11:23:16,056 INFO L79 Accepts]: Start accepts. Automaton has 171 states and 195 transitions. Word has length 38 [2025-04-29 11:23:16,056 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:16,056 INFO L485 AbstractCegarLoop]: Abstraction has 171 states and 195 transitions. [2025-04-29 11:23:16,056 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:16,056 INFO L278 IsEmpty]: Start isEmpty. Operand 171 states and 195 transitions. [2025-04-29 11:23:16,056 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-29 11:23:16,056 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:16,056 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:16,056 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-29 11:23:16,056 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:23:16,056 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:16,056 INFO L85 PathProgramCache]: Analyzing trace with hash 69220979, now seen corresponding path program 1 times [2025-04-29 11:23:16,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:16,056 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209848149] [2025-04-29 11:23:16,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:16,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:16,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:23:16,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:23:16,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:16,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:16,454 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:16,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:16,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209848149] [2025-04-29 11:23:16,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209848149] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:16,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093659446] [2025-04-29 11:23:16,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:16,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:16,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:16,456 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:23:16,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:23:16,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:23:16,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:23:16,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:16,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:16,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-04-29 11:23:16,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:16,588 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-29 11:23:16,593 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-29 11:23:16,624 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-29 11:23:16,631 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-04-29 11:23:16,664 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2025-04-29 11:23:16,670 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-29 11:23:16,934 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:23:16,934 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 11 treesize of output 11 [2025-04-29 11:23:16,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:23:16,990 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:23:16,992 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 14 [2025-04-29 11:23:17,010 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-29 11:23:17,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:23:17,129 INFO L325 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-04-29 11:23:17,130 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 46 [2025-04-29 11:23:17,134 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 18 [2025-04-29 11:23:17,240 INFO L325 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2025-04-29 11:23:17,240 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 44 [2025-04-29 11:23:17,249 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 18 [2025-04-29 11:23:17,382 INFO L325 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-04-29 11:23:17,382 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 60 [2025-04-29 11:23:17,386 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 18 [2025-04-29 11:23:17,484 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:17,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:17,505 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1050 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_1049 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1049) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))) is different from false [2025-04-29 11:23:17,511 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)))) (and (forall ((v_ArrVal_1050 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1050) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_1049 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1049) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)))) is different from false [2025-04-29 11:23:17,523 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem20#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_#t~mem20#1.offset| Int) (v_ArrVal_1050 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem20#1.base| (store .cse2 (+ |ULTIMATE.start_main_#t~mem20#1.offset| 4) 0)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1050)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((|ULTIMATE.start_main_#t~mem20#1.offset| Int) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1047 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_1047) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem20#1.base| (store .cse2 (+ |ULTIMATE.start_main_#t~mem20#1.offset| 4) 0)) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1049) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)))) is different from false [2025-04-29 11:23:17,601 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem19#1.base|))) (and (forall ((|ULTIMATE.start_main_#t~mem20#1.offset| Int) (v_ArrVal_1046 Int) (v_ArrVal_1050 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem19#1.base| (store .cse4 |c_ULTIMATE.start_main_#t~mem19#1.offset| v_ArrVal_1046)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |ULTIMATE.start_main_#t~mem20#1.offset| 4) 0)))))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1050)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((|ULTIMATE.start_main_#t~mem20#1.offset| Int) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= (select (select (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem19#1.base| (store .cse4 |c_ULTIMATE.start_main_#t~mem19#1.offset| v_ArrVal_1046)))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_1044) .cse5 v_ArrVal_1047) (select (select (store .cse6 .cse5 (store (select .cse6 .cse5) (+ |ULTIMATE.start_main_#t~mem20#1.offset| 4) 0)) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1049))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)))) is different from false [2025-04-29 11:23:17,629 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (let ((.cse5 (select |c_#memory_$Pointer$#0.base| .cse4)) (.cse6 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (and (forall ((|v_ULTIMATE.start_main_#t~mem19#1.offset_10| Int)) (or (forall ((|ULTIMATE.start_main_#t~mem20#1.offset| Int) (v_ArrVal_1046 Int) (v_ArrVal_1050 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#0.base| .cse4 (store .cse5 |v_ULTIMATE.start_main_#t~mem19#1.offset_10| v_ArrVal_1046)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |ULTIMATE.start_main_#t~mem20#1.offset| 4) 0)))))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1050)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (< .cse6 |v_ULTIMATE.start_main_#t~mem19#1.offset_10|))) (forall ((|v_ULTIMATE.start_main_#t~mem19#1.offset_10| Int)) (or (forall ((|ULTIMATE.start_main_#t~mem20#1.offset| Int) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= (select (select (let ((.cse8 (store |c_#memory_$Pointer$#0.base| .cse4 (store .cse5 |v_ULTIMATE.start_main_#t~mem19#1.offset_10| v_ArrVal_1046)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (store (store (store |c_#memory_$Pointer$#0.offset| .cse4 v_ArrVal_1044) .cse7 v_ArrVal_1047) (select (select (store .cse8 .cse7 (store (select .cse8 .cse7) (+ |ULTIMATE.start_main_#t~mem20#1.offset| 4) 0)) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1049))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (< .cse6 |v_ULTIMATE.start_main_#t~mem19#1.offset_10|))))))) is different from false [2025-04-29 11:23:17,679 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 |c_ULTIMATE.start_main_#t~malloc18#1.base|)))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_#t~malloc18#1.base|))) (and (forall ((v_ArrVal_1042 Int)) (or (< |c_ULTIMATE.start_main_#t~malloc18#1.offset| v_ArrVal_1042) (forall ((|v_ULTIMATE.start_main_#t~mem19#1.offset_10| Int)) (or (< v_ArrVal_1042 |v_ULTIMATE.start_main_#t~mem19#1.offset_10|) (forall ((|ULTIMATE.start_main_#t~mem20#1.offset| Int) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= (select (select (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_#t~malloc18#1.base| (store .cse4 |v_ULTIMATE.start_main_#t~mem19#1.offset_10| v_ArrVal_1046)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0))) (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 v_ArrVal_1042)) |c_ULTIMATE.start_main_#t~malloc18#1.base| v_ArrVal_1044) .cse1 v_ArrVal_1047) (select (select (store .cse2 .cse1 (store (select .cse2 .cse1) (+ |ULTIMATE.start_main_#t~mem20#1.offset| 4) 0)) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1049))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)))))) (forall ((|ULTIMATE.start_main_#t~mem20#1.offset| Int) (v_ArrVal_1046 Int) (|v_ULTIMATE.start_main_#t~mem19#1.offset_10| Int) (v_ArrVal_1050 (Array Int Int))) (or (= (select (select (let ((.cse5 (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_#t~malloc18#1.base| (store .cse4 |v_ULTIMATE.start_main_#t~mem19#1.offset_10| v_ArrVal_1046)))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0))) (store .cse6 .cse7 (store (select .cse6 .cse7) (+ |ULTIMATE.start_main_#t~mem20#1.offset| 4) 0)))))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1050)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0) (< |c_ULTIMATE.start_main_#t~malloc18#1.offset| |v_ULTIMATE.start_main_#t~mem19#1.offset_10|))))))) is different from false [2025-04-29 11:23:18,222 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:18,222 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 515 treesize of output 533 [2025-04-29 11:23:18,381 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_#t~mem20#1.offset| Int) (v_ArrVal_1046 Int) (|v_ULTIMATE.start_main_#t~mem19#1.offset_10| Int) (|v_ULTIMATE.start_main_#t~malloc18#1.base_9| Int) (v_ArrVal_1050 (Array Int Int))) (or (= (select (select (let ((.cse0 (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse5 .cse1 |v_ULTIMATE.start_main_#t~malloc18#1.base_9|)))) (store .cse4 |v_ULTIMATE.start_main_#t~malloc18#1.base_9| (store (select .cse4 |v_ULTIMATE.start_main_#t~malloc18#1.base_9|) |v_ULTIMATE.start_main_#t~mem19#1.offset_10| v_ArrVal_1046))))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |ULTIMATE.start_main_#t~mem20#1.offset| 4) 0)))))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1050)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0) (< 0 |v_ULTIMATE.start_main_#t~mem19#1.offset_10|) (= |v_ULTIMATE.start_main_#t~malloc18#1.base_9| |c_ULTIMATE.start_main_~n~0#1.base|))) (forall ((v_ArrVal_1042 Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1047 (Array Int Int)) (v_prenex_1 Int) (v_ArrVal_1044 (Array Int Int))) (or (< 0 v_ArrVal_1042) (= v_prenex_4 |c_ULTIMATE.start_main_~n~0#1.base|) (< v_ArrVal_1042 v_prenex_3) (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse5 .cse1 v_prenex_4)))) (store .cse8 v_prenex_4 (store (select .cse8 v_prenex_4) v_prenex_3 v_prenex_2))))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 v_ArrVal_1042)) v_prenex_4 v_ArrVal_1044) .cse6 v_ArrVal_1047) (select (select (store .cse7 .cse6 (store (select .cse7 .cse6) (+ v_prenex_1 4) 0)) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1049))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))))) is different from false [2025-04-29 11:23:18,552 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2025-04-29 11:23:18,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093659446] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:18,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:23:18,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 15] total 38 [2025-04-29 11:23:18,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297951109] [2025-04-29 11:23:18,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:18,553 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-29 11:23:18,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:18,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-29 11:23:18,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=769, Unknown=13, NotChecked=448, Total=1406 [2025-04-29 11:23:18,554 INFO L87 Difference]: Start difference. First operand 171 states and 195 transitions. Second operand has 38 states, 38 states have (on average 2.763157894736842) internal successors, (105), 38 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:20,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:20,553 INFO L93 Difference]: Finished difference Result 291 states and 334 transitions. [2025-04-29 11:23:20,553 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-29 11:23:20,554 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.763157894736842) internal successors, (105), 38 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-29 11:23:20,554 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:20,554 INFO L225 Difference]: With dead ends: 291 [2025-04-29 11:23:20,554 INFO L226 Difference]: Without dead ends: 291 [2025-04-29 11:23:20,555 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 69 SyntacticMatches, 9 SemanticMatches, 64 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=730, Invalid=2707, Unknown=13, NotChecked=840, Total=4290 [2025-04-29 11:23:20,556 INFO L437 NwaCegarLoop]: 72 mSDtfsCounter, 499 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 2752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1682 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:20,556 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 1053 Invalid, 2752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 992 Invalid, 0 Unknown, 1682 Unchecked, 0.8s Time] [2025-04-29 11:23:20,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-04-29 11:23:20,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 197. [2025-04-29 11:23:20,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 182 states have (on average 1.2417582417582418) internal successors, (226), 196 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:20,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 226 transitions. [2025-04-29 11:23:20,559 INFO L79 Accepts]: Start accepts. Automaton has 197 states and 226 transitions. Word has length 45 [2025-04-29 11:23:20,559 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:20,559 INFO L485 AbstractCegarLoop]: Abstraction has 197 states and 226 transitions. [2025-04-29 11:23:20,559 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.763157894736842) internal successors, (105), 38 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:20,559 INFO L278 IsEmpty]: Start isEmpty. Operand 197 states and 226 transitions. [2025-04-29 11:23:20,559 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-29 11:23:20,559 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:20,559 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:20,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:23:20,759 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:20,760 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2025-04-29 11:23:20,760 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:20,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1194077392, now seen corresponding path program 1 times [2025-04-29 11:23:20,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:20,760 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70019563] [2025-04-29 11:23:20,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:20,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:20,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:23:20,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:23:20,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:20,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:21,004 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:21,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:21,004 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70019563] [2025-04-29 11:23:21,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70019563] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:21,004 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293159616] [2025-04-29 11:23:21,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:21,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:21,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:21,006 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:23:21,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:23:21,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:23:21,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:23:21,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:21,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:21,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-29 11:23:21,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:21,113 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:23:21,245 INFO L325 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2025-04-29 11:23:21,245 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2025-04-29 11:23:21,282 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:23:21,367 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 11:23:21,367 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2025-04-29 11:23:21,426 INFO L325 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-04-29 11:23:21,426 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 38 [2025-04-29 11:23:21,549 INFO L325 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2025-04-29 11:23:21,549 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 51 [2025-04-29 11:23:21,713 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 38 treesize of output 22 [2025-04-29 11:23:21,774 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:21,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:22,057 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:22,058 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 125 [2025-04-29 11:23:22,109 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:22,110 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 5176 treesize of output 4588 [2025-04-29 11:23:22,208 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:22,208 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 1785 treesize of output 1613 [2025-04-29 11:23:22,231 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1432 treesize of output 1408 [2025-04-29 11:23:26,733 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-29 11:23:26,748 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-29 11:23:26,774 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 114 [2025-04-29 11:23:26,884 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-29 11:23:26,899 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-04-29 11:23:26,958 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 183 [2025-04-29 11:23:27,193 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-29 11:23:27,230 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-29 11:23:27,239 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-29 11:23:28,414 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-29 11:23:28,428 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-29 11:23:28,604 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-29 11:23:29,311 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:29,312 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 3010 treesize of output 2862 Killed by 15