./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-52.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 65e290fb975399bc2cc283273eaab9fa300db5fe57e6fb279b59522887532a83 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:47:04,524 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:47:04,570 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:47:04,581 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:47:04,581 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:47:04,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:47:04,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:47:04,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:47:04,616 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:47:04,616 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:47:04,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:47:04,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:47:04,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:47:04,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:47:04,616 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:47:04,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:47:04,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:47:04,617 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:47:04,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:47:04,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:47:04,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:47:04,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:47:04,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:47:04,618 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:47:04,618 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:47:04,618 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:47:04,618 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:47:04,618 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:47:04,618 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:47:04,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:47:04,619 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:47:04,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:47:04,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:47:04,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:47:04,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:47:04,619 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:47:04,619 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:47:04,620 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:47:04,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:47:04,620 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:47:04,620 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:47:04,620 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:47:04,620 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:47:04,620 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 ! call(reach_error())) ) 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 -> 65e290fb975399bc2cc283273eaab9fa300db5fe57e6fb279b59522887532a83 [2025-03-17 01:47:04,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:47:04,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:47:04,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:47:04,884 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:47:04,884 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:47:04,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-52.i [2025-03-17 01:47:06,078 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9523ffe9/74c03ce4fba14c31990a2e5f0918a014/FLAG60dff7a00 [2025-03-17 01:47:06,342 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:47:06,343 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-52.i [2025-03-17 01:47:06,355 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9523ffe9/74c03ce4fba14c31990a2e5f0918a014/FLAG60dff7a00 [2025-03-17 01:47:06,372 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9523ffe9/74c03ce4fba14c31990a2e5f0918a014 [2025-03-17 01:47:06,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:47:06,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:47:06,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:47:06,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:47:06,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:47:06,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:47:06" (1/1) ... [2025-03-17 01:47:06,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e9330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06, skipping insertion in model container [2025-03-17 01:47:06,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:47:06" (1/1) ... [2025-03-17 01:47:06,401 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:47:06,518 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-52.i[919,932] [2025-03-17 01:47:06,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:47:06,578 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:47:06,587 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-52.i[919,932] [2025-03-17 01:47:06,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:47:06,618 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:47:06,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06 WrapperNode [2025-03-17 01:47:06,619 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:47:06,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:47:06,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:47:06,620 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:47:06,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06" (1/1) ... [2025-03-17 01:47:06,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06" (1/1) ... [2025-03-17 01:47:06,662 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203 [2025-03-17 01:47:06,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:47:06,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:47:06,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:47:06,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:47:06,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06" (1/1) ... [2025-03-17 01:47:06,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06" (1/1) ... [2025-03-17 01:47:06,674 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06" (1/1) ... [2025-03-17 01:47:06,694 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 01:47:06,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06" (1/1) ... [2025-03-17 01:47:06,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06" (1/1) ... [2025-03-17 01:47:06,711 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06" (1/1) ... [2025-03-17 01:47:06,712 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06" (1/1) ... [2025-03-17 01:47:06,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06" (1/1) ... [2025-03-17 01:47:06,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06" (1/1) ... [2025-03-17 01:47:06,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:47:06,716 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:47:06,716 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:47:06,716 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:47:06,721 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06" (1/1) ... [2025-03-17 01:47:06,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:47:06,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:47:06,748 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-03-17 01:47:06,764 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-03-17 01:47:06,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:47:06,783 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:47:06,783 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:47:06,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:47:06,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:47:06,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:47:06,845 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:47:06,847 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:47:07,254 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-17 01:47:07,255 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:47:07,278 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:47:07,280 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:47:07,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:47:07 BoogieIcfgContainer [2025-03-17 01:47:07,281 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:47:07,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:47:07,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:47:07,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:47:07,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:47:06" (1/3) ... [2025-03-17 01:47:07,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@332313b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:47:07, skipping insertion in model container [2025-03-17 01:47:07,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06" (2/3) ... [2025-03-17 01:47:07,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@332313b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:47:07, skipping insertion in model container [2025-03-17 01:47:07,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:47:07" (3/3) ... [2025-03-17 01:47:07,291 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-52.i [2025-03-17 01:47:07,302 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:47:07,304 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-52.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:47:07,346 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:47:07,354 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@e3e3b7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:47:07,355 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:47:07,358 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 55 states have (on average 1.509090909090909) internal successors, (83), 56 states have internal predecessors, (83), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 01:47:07,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 01:47:07,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:07,367 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 01:47:07,368 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:07,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:07,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1306975975, now seen corresponding path program 1 times [2025-03-17 01:47:07,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:07,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050332884] [2025-03-17 01:47:07,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:07,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:07,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 01:47:07,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 01:47:07,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:07,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:07,694 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-17 01:47:07,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:07,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050332884] [2025-03-17 01:47:07,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050332884] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:47:07,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477992819] [2025-03-17 01:47:07,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:07,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:47:07,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:47:07,699 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-03-17 01:47:07,701 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-03-17 01:47:07,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 01:47:07,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 01:47:07,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:07,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:07,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:47:07,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:47:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-17 01:47:07,877 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:47:07,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477992819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:07,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:47:07,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:47:07,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502061169] [2025-03-17 01:47:07,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:07,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:47:07,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:07,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:47:07,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:47:07,903 INFO L87 Difference]: Start difference. First operand has 80 states, 55 states have (on average 1.509090909090909) internal successors, (83), 56 states have internal predecessors, (83), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 01:47:07,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:07,934 INFO L93 Difference]: Finished difference Result 157 states and 274 transitions. [2025-03-17 01:47:07,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:47:07,937 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 147 [2025-03-17 01:47:07,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:07,942 INFO L225 Difference]: With dead ends: 157 [2025-03-17 01:47:07,943 INFO L226 Difference]: Without dead ends: 78 [2025-03-17 01:47:07,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:47:07,948 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:07,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:47:07,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-17 01:47:07,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-17 01:47:07,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 54 states have (on average 1.462962962962963) internal successors, (79), 54 states have internal predecessors, (79), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 01:47:07,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 123 transitions. [2025-03-17 01:47:07,981 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 123 transitions. Word has length 147 [2025-03-17 01:47:07,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:07,981 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 123 transitions. [2025-03-17 01:47:07,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 01:47:07,982 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 123 transitions. [2025-03-17 01:47:07,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 01:47:07,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:07,986 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 01:47:07,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 01:47:08,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 01:47:08,191 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:08,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:08,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1511188917, now seen corresponding path program 1 times [2025-03-17 01:47:08,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:08,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71886348] [2025-03-17 01:47:08,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:08,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:08,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 01:47:08,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 01:47:08,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:08,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:08,670 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:47:08,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:08,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71886348] [2025-03-17 01:47:08,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71886348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:08,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:08,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:47:08,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679129873] [2025-03-17 01:47:08,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:08,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:47:08,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:08,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:47:08,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:47:08,675 INFO L87 Difference]: Start difference. First operand 78 states and 123 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:47:08,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:08,753 INFO L93 Difference]: Finished difference Result 228 states and 363 transitions. [2025-03-17 01:47:08,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:47:08,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2025-03-17 01:47:08,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:08,756 INFO L225 Difference]: With dead ends: 228 [2025-03-17 01:47:08,756 INFO L226 Difference]: Without dead ends: 151 [2025-03-17 01:47:08,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-03-17 01:47:08,757 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 71 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:08,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 220 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:47:08,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-17 01:47:08,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 132. [2025-03-17 01:47:08,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 85 states have (on average 1.4) internal successors, (119), 85 states have internal predecessors, (119), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 01:47:08,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 207 transitions. [2025-03-17 01:47:08,791 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 207 transitions. Word has length 147 [2025-03-17 01:47:08,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:08,791 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 207 transitions. [2025-03-17 01:47:08,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:47:08,792 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 207 transitions. [2025-03-17 01:47:08,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-17 01:47:08,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:08,797 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 01:47:08,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:47:08,797 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:08,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:08,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1673897043, now seen corresponding path program 1 times [2025-03-17 01:47:08,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:08,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939945082] [2025-03-17 01:47:08,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:08,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:08,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 01:47:08,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 01:47:08,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:08,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:09,028 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:47:09,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:09,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939945082] [2025-03-17 01:47:09,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939945082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:09,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:09,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:47:09,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100526022] [2025-03-17 01:47:09,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:09,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:47:09,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:09,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:47:09,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:47:09,033 INFO L87 Difference]: Start difference. First operand 132 states and 207 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:47:09,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:09,113 INFO L93 Difference]: Finished difference Result 294 states and 465 transitions. [2025-03-17 01:47:09,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:47:09,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2025-03-17 01:47:09,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:09,116 INFO L225 Difference]: With dead ends: 294 [2025-03-17 01:47:09,116 INFO L226 Difference]: Without dead ends: 209 [2025-03-17 01:47:09,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-03-17 01:47:09,117 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 82 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:09,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 221 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:47:09,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-17 01:47:09,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2025-03-17 01:47:09,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 137 states have (on average 1.416058394160584) internal successors, (194), 137 states have internal predecessors, (194), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 01:47:09,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 326 transitions. [2025-03-17 01:47:09,160 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 326 transitions. Word has length 148 [2025-03-17 01:47:09,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:09,160 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 326 transitions. [2025-03-17 01:47:09,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:47:09,161 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 326 transitions. [2025-03-17 01:47:09,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 01:47:09,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:09,163 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 01:47:09,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 01:47:09,163 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:09,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:09,163 INFO L85 PathProgramCache]: Analyzing trace with hash -926582739, now seen corresponding path program 1 times [2025-03-17 01:47:09,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:09,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878199770] [2025-03-17 01:47:09,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:09,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:09,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 01:47:09,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 01:47:09,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:09,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:09,826 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:47:09,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:09,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878199770] [2025-03-17 01:47:09,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878199770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:09,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:09,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:47:09,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477010286] [2025-03-17 01:47:09,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:09,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:47:09,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:09,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:47:09,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:47:09,828 INFO L87 Difference]: Start difference. First operand 207 states and 326 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:47:10,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:10,006 INFO L93 Difference]: Finished difference Result 444 states and 687 transitions. [2025-03-17 01:47:10,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:47:10,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2025-03-17 01:47:10,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:10,009 INFO L225 Difference]: With dead ends: 444 [2025-03-17 01:47:10,009 INFO L226 Difference]: Without dead ends: 292 [2025-03-17 01:47:10,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:47:10,011 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 135 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:10,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 287 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:47:10,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-17 01:47:10,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 246. [2025-03-17 01:47:10,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 173 states have (on average 1.3757225433526012) internal successors, (238), 173 states have internal predecessors, (238), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 01:47:10,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 370 transitions. [2025-03-17 01:47:10,042 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 370 transitions. Word has length 149 [2025-03-17 01:47:10,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:10,042 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 370 transitions. [2025-03-17 01:47:10,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:47:10,042 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 370 transitions. [2025-03-17 01:47:10,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 01:47:10,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:10,044 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 01:47:10,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 01:47:10,044 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:10,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:10,044 INFO L85 PathProgramCache]: Analyzing trace with hash -89467244, now seen corresponding path program 1 times [2025-03-17 01:47:10,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:10,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986922502] [2025-03-17 01:47:10,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:10,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:10,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 01:47:10,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 01:47:10,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:10,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:10,397 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:47:10,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:10,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986922502] [2025-03-17 01:47:10,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986922502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:10,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:10,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 01:47:10,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787251127] [2025-03-17 01:47:10,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:10,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 01:47:10,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:10,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 01:47:10,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 01:47:10,402 INFO L87 Difference]: Start difference. First operand 246 states and 370 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:47:10,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:10,725 INFO L93 Difference]: Finished difference Result 524 states and 793 transitions. [2025-03-17 01:47:10,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:47:10,726 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-03-17 01:47:10,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:10,729 INFO L225 Difference]: With dead ends: 524 [2025-03-17 01:47:10,731 INFO L226 Difference]: Without dead ends: 338 [2025-03-17 01:47:10,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 01:47:10,734 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 189 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:10,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 364 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 01:47:10,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-17 01:47:10,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 282. [2025-03-17 01:47:10,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 209 states have (on average 1.3779904306220097) internal successors, (288), 209 states have internal predecessors, (288), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 01:47:10,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 420 transitions. [2025-03-17 01:47:10,772 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 420 transitions. Word has length 150 [2025-03-17 01:47:10,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:10,776 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 420 transitions. [2025-03-17 01:47:10,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:47:10,776 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 420 transitions. [2025-03-17 01:47:10,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 01:47:10,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:10,778 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 01:47:10,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 01:47:10,778 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:10,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:10,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1263842453, now seen corresponding path program 1 times [2025-03-17 01:47:10,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:10,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517335449] [2025-03-17 01:47:10,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:10,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:10,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 01:47:10,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 01:47:10,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:10,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:10,939 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:47:10,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:10,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517335449] [2025-03-17 01:47:10,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517335449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:10,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:10,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:47:10,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611951392] [2025-03-17 01:47:10,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:10,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:47:10,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:10,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:47:10,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:47:10,941 INFO L87 Difference]: Start difference. First operand 282 states and 420 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:47:11,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:11,203 INFO L93 Difference]: Finished difference Result 768 states and 1153 transitions. [2025-03-17 01:47:11,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:47:11,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-03-17 01:47:11,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:11,211 INFO L225 Difference]: With dead ends: 768 [2025-03-17 01:47:11,212 INFO L226 Difference]: Without dead ends: 581 [2025-03-17 01:47:11,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:47:11,214 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 196 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:11,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 526 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:47:11,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-17 01:47:11,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 318. [2025-03-17 01:47:11,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 245 states have (on average 1.3959183673469389) internal successors, (342), 245 states have internal predecessors, (342), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 01:47:11,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 474 transitions. [2025-03-17 01:47:11,282 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 474 transitions. Word has length 150 [2025-03-17 01:47:11,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:11,284 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 474 transitions. [2025-03-17 01:47:11,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:47:11,284 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 474 transitions. [2025-03-17 01:47:11,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 01:47:11,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:11,285 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 01:47:11,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 01:47:11,286 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:11,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:11,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1620079797, now seen corresponding path program 1 times [2025-03-17 01:47:11,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:11,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360644123] [2025-03-17 01:47:11,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:11,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:11,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 01:47:11,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 01:47:11,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:11,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:11,351 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:47:11,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:11,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360644123] [2025-03-17 01:47:11,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360644123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:11,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:11,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:47:11,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518713897] [2025-03-17 01:47:11,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:11,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:47:11,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:11,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:47:11,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:47:11,353 INFO L87 Difference]: Start difference. First operand 318 states and 474 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:47:11,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:11,418 INFO L93 Difference]: Finished difference Result 678 states and 1015 transitions. [2025-03-17 01:47:11,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:47:11,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-03-17 01:47:11,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:11,421 INFO L225 Difference]: With dead ends: 678 [2025-03-17 01:47:11,421 INFO L226 Difference]: Without dead ends: 458 [2025-03-17 01:47:11,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:47:11,424 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 95 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:11,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 299 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:47:11,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-03-17 01:47:11,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 334. [2025-03-17 01:47:11,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 261 states have (on average 1.3908045977011494) internal successors, (363), 261 states have internal predecessors, (363), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 01:47:11,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 495 transitions. [2025-03-17 01:47:11,450 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 495 transitions. Word has length 150 [2025-03-17 01:47:11,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:11,450 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 495 transitions. [2025-03-17 01:47:11,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:47:11,451 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 495 transitions. [2025-03-17 01:47:11,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 01:47:11,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:11,452 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 01:47:11,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 01:47:11,452 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:11,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:11,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1989689582, now seen corresponding path program 1 times [2025-03-17 01:47:11,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:11,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069788652] [2025-03-17 01:47:11,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:11,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:11,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 01:47:11,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 01:47:11,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:11,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:11,870 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:47:11,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:11,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069788652] [2025-03-17 01:47:11,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069788652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:11,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:11,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:47:11,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391852421] [2025-03-17 01:47:11,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:11,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:47:11,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:11,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:47:11,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:47:11,872 INFO L87 Difference]: Start difference. First operand 334 states and 495 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:47:11,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:11,964 INFO L93 Difference]: Finished difference Result 651 states and 966 transitions. [2025-03-17 01:47:11,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:47:11,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-03-17 01:47:11,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:11,967 INFO L225 Difference]: With dead ends: 651 [2025-03-17 01:47:11,967 INFO L226 Difference]: Without dead ends: 370 [2025-03-17 01:47:11,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-03-17 01:47:11,968 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 67 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:11,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 320 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:47:11,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-17 01:47:12,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 334. [2025-03-17 01:47:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 261 states have (on average 1.3831417624521072) internal successors, (361), 261 states have internal predecessors, (361), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 01:47:12,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 493 transitions. [2025-03-17 01:47:12,021 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 493 transitions. Word has length 150 [2025-03-17 01:47:12,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:12,022 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 493 transitions. [2025-03-17 01:47:12,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:47:12,022 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 493 transitions. [2025-03-17 01:47:12,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 01:47:12,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:12,024 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 01:47:12,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 01:47:12,025 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:12,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:12,025 INFO L85 PathProgramCache]: Analyzing trace with hash 844533677, now seen corresponding path program 1 times [2025-03-17 01:47:12,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:12,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150747042] [2025-03-17 01:47:12,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:12,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:12,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 01:47:12,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 01:47:12,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:12,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:23,119 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:47:23,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:23,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150747042] [2025-03-17 01:47:23,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150747042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:23,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:23,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 01:47:23,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242704018] [2025-03-17 01:47:23,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:23,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 01:47:23,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:23,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 01:47:23,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:47:23,121 INFO L87 Difference]: Start difference. First operand 334 states and 493 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-17 01:47:25,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:25,137 INFO L93 Difference]: Finished difference Result 715 states and 1051 transitions. [2025-03-17 01:47:25,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 01:47:25,138 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 152 [2025-03-17 01:47:25,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:25,140 INFO L225 Difference]: With dead ends: 715 [2025-03-17 01:47:25,140 INFO L226 Difference]: Without dead ends: 490 [2025-03-17 01:47:25,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2025-03-17 01:47:25,143 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 356 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:25,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 795 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 01:47:25,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-03-17 01:47:25,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 346. [2025-03-17 01:47:25,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 271 states have (on average 1.3726937269372694) internal successors, (372), 271 states have internal predecessors, (372), 66 states have call successors, (66), 8 states have call predecessors, (66), 8 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 01:47:25,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 504 transitions. [2025-03-17 01:47:25,171 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 504 transitions. Word has length 152 [2025-03-17 01:47:25,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:25,172 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 504 transitions. [2025-03-17 01:47:25,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-17 01:47:25,172 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 504 transitions. [2025-03-17 01:47:25,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 01:47:25,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:25,174 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 01:47:25,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 01:47:25,174 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:25,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:25,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1828233589, now seen corresponding path program 1 times [2025-03-17 01:47:25,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:25,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306082805] [2025-03-17 01:47:25,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:25,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:25,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 01:47:25,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 01:47:25,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:25,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:47:25,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:25,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306082805] [2025-03-17 01:47:25,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306082805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:25,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:25,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:47:25,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347081571] [2025-03-17 01:47:25,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:25,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:47:25,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:25,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:47:25,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:47:25,346 INFO L87 Difference]: Start difference. First operand 346 states and 504 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:47:25,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:25,569 INFO L93 Difference]: Finished difference Result 699 states and 1030 transitions. [2025-03-17 01:47:25,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:47:25,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2025-03-17 01:47:25,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:25,572 INFO L225 Difference]: With dead ends: 699 [2025-03-17 01:47:25,572 INFO L226 Difference]: Without dead ends: 424 [2025-03-17 01:47:25,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 01:47:25,573 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 150 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:25,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 376 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:47:25,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-03-17 01:47:25,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 364. [2025-03-17 01:47:25,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 289 states have (on average 1.3667820069204153) internal successors, (395), 289 states have internal predecessors, (395), 66 states have call successors, (66), 8 states have call predecessors, (66), 8 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 01:47:25,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 527 transitions. [2025-03-17 01:47:25,593 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 527 transitions. Word has length 152 [2025-03-17 01:47:25,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:25,593 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 527 transitions. [2025-03-17 01:47:25,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:47:25,593 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 527 transitions. [2025-03-17 01:47:25,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 01:47:25,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:25,597 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 01:47:25,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 01:47:25,597 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:25,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:25,597 INFO L85 PathProgramCache]: Analyzing trace with hash 589797132, now seen corresponding path program 1 times [2025-03-17 01:47:25,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:25,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982141332] [2025-03-17 01:47:25,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:25,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:25,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 01:47:25,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 01:47:25,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:25,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:25,672 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:47:25,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:25,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982141332] [2025-03-17 01:47:25,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982141332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:25,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:25,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:47:25,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006650431] [2025-03-17 01:47:25,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:25,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:47:25,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:25,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:47:25,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:47:25,674 INFO L87 Difference]: Start difference. First operand 364 states and 527 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:47:25,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:25,782 INFO L93 Difference]: Finished difference Result 609 states and 887 transitions. [2025-03-17 01:47:25,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:47:25,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2025-03-17 01:47:25,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:25,787 INFO L225 Difference]: With dead ends: 609 [2025-03-17 01:47:25,787 INFO L226 Difference]: Without dead ends: 314 [2025-03-17 01:47:25,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:47:25,788 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 139 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:25,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 176 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:47:25,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-17 01:47:25,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2025-03-17 01:47:25,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 239 states have (on average 1.3263598326359833) internal successors, (317), 239 states have internal predecessors, (317), 66 states have call successors, (66), 8 states have call predecessors, (66), 8 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 01:47:25,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 449 transitions. [2025-03-17 01:47:25,808 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 449 transitions. Word has length 152 [2025-03-17 01:47:25,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:25,809 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 449 transitions. [2025-03-17 01:47:25,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:47:25,809 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 449 transitions. [2025-03-17 01:47:25,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 01:47:25,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:25,811 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 01:47:25,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 01:47:25,811 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:25,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:25,811 INFO L85 PathProgramCache]: Analyzing trace with hash -612620029, now seen corresponding path program 1 times [2025-03-17 01:47:25,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:25,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512705640] [2025-03-17 01:47:25,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:25,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:25,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 01:47:25,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 01:47:25,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:25,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:28,651 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:47:28,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:28,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512705640] [2025-03-17 01:47:28,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512705640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:28,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:28,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 01:47:28,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494935852] [2025-03-17 01:47:28,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:28,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 01:47:28,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:28,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 01:47:28,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:47:28,653 INFO L87 Difference]: Start difference. First operand 314 states and 449 transitions. Second operand has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 15 states have internal predecessors, (47), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-17 01:47:29,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:29,953 INFO L93 Difference]: Finished difference Result 376 states and 524 transitions. [2025-03-17 01:47:29,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 01:47:29,953 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 15 states have internal predecessors, (47), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) Word has length 154 [2025-03-17 01:47:29,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:29,955 INFO L225 Difference]: With dead ends: 376 [2025-03-17 01:47:29,955 INFO L226 Difference]: Without dead ends: 374 [2025-03-17 01:47:29,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2025-03-17 01:47:29,956 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 371 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:29,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 800 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 01:47:29,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-03-17 01:47:29,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 335. [2025-03-17 01:47:29,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 260 states have (on average 1.3269230769230769) internal successors, (345), 260 states have internal predecessors, (345), 66 states have call successors, (66), 8 states have call predecessors, (66), 8 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 01:47:29,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 477 transitions. [2025-03-17 01:47:29,976 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 477 transitions. Word has length 154 [2025-03-17 01:47:29,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:29,977 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 477 transitions. [2025-03-17 01:47:29,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 15 states have internal predecessors, (47), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-17 01:47:29,977 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 477 transitions. [2025-03-17 01:47:29,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 01:47:29,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:29,978 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 01:47:29,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 01:47:29,978 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:29,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:29,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1130190306, now seen corresponding path program 1 times [2025-03-17 01:47:29,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:29,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918865613] [2025-03-17 01:47:29,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:29,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:29,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 01:47:30,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 01:47:30,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:30,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:31,579 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:47:31,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:31,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918865613] [2025-03-17 01:47:31,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918865613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:31,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:31,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 01:47:31,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039332935] [2025-03-17 01:47:31,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:31,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 01:47:31,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:31,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 01:47:31,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:47:31,581 INFO L87 Difference]: Start difference. First operand 335 states and 477 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:47:32,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:32,079 INFO L93 Difference]: Finished difference Result 662 states and 954 transitions. [2025-03-17 01:47:32,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 01:47:32,083 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2025-03-17 01:47:32,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:32,086 INFO L225 Difference]: With dead ends: 662 [2025-03-17 01:47:32,086 INFO L226 Difference]: Without dead ends: 461 [2025-03-17 01:47:32,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2025-03-17 01:47:32,089 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 306 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:32,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 234 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 01:47:32,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-03-17 01:47:32,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 397. [2025-03-17 01:47:32,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 322 states have (on average 1.3416149068322982) internal successors, (432), 322 states have internal predecessors, (432), 66 states have call successors, (66), 8 states have call predecessors, (66), 8 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 01:47:32,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 564 transitions. [2025-03-17 01:47:32,121 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 564 transitions. Word has length 154 [2025-03-17 01:47:32,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:32,121 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 564 transitions. [2025-03-17 01:47:32,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:47:32,121 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 564 transitions. [2025-03-17 01:47:32,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 01:47:32,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:32,123 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 01:47:32,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 01:47:32,123 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:32,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:32,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1899902212, now seen corresponding path program 1 times [2025-03-17 01:47:32,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:32,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528786960] [2025-03-17 01:47:32,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:32,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:32,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 01:47:32,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 01:47:32,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:32,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:32,234 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:47:32,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:32,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528786960] [2025-03-17 01:47:32,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528786960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:32,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:32,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 01:47:32,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676046722] [2025-03-17 01:47:32,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:32,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 01:47:32,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:32,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 01:47:32,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 01:47:32,238 INFO L87 Difference]: Start difference. First operand 397 states and 564 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 01:47:32,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:32,578 INFO L93 Difference]: Finished difference Result 770 states and 1095 transitions. [2025-03-17 01:47:32,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:47:32,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 154 [2025-03-17 01:47:32,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:32,586 INFO L225 Difference]: With dead ends: 770 [2025-03-17 01:47:32,589 INFO L226 Difference]: Without dead ends: 481 [2025-03-17 01:47:32,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 01:47:32,591 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 276 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:32,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 224 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 01:47:32,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-17 01:47:32,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 405. [2025-03-17 01:47:32,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 328 states have (on average 1.326219512195122) internal successors, (435), 328 states have internal predecessors, (435), 66 states have call successors, (66), 10 states have call predecessors, (66), 10 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 01:47:32,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 567 transitions. [2025-03-17 01:47:32,644 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 567 transitions. Word has length 154 [2025-03-17 01:47:32,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:32,644 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 567 transitions. [2025-03-17 01:47:32,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 01:47:32,644 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 567 transitions. [2025-03-17 01:47:32,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 01:47:32,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:32,646 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 01:47:32,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 01:47:32,647 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:32,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:32,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1884530907, now seen corresponding path program 1 times [2025-03-17 01:47:32,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:32,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726674105] [2025-03-17 01:47:32,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:32,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:32,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 01:47:32,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 01:47:32,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:32,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:39,486 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:47:39,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:39,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726674105] [2025-03-17 01:47:39,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726674105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:39,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:39,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 01:47:39,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44506969] [2025-03-17 01:47:39,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:39,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 01:47:39,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:39,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 01:47:39,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:47:39,489 INFO L87 Difference]: Start difference. First operand 405 states and 567 transitions. Second operand has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-17 01:47:41,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:41,981 INFO L93 Difference]: Finished difference Result 756 states and 1054 transitions. [2025-03-17 01:47:41,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 01:47:41,981 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 154 [2025-03-17 01:47:41,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:41,984 INFO L225 Difference]: With dead ends: 756 [2025-03-17 01:47:41,984 INFO L226 Difference]: Without dead ends: 478 [2025-03-17 01:47:41,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2025-03-17 01:47:41,987 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 576 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:41,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 702 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 01:47:41,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-03-17 01:47:42,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 401. [2025-03-17 01:47:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 324 states have (on average 1.3179012345679013) internal successors, (427), 324 states have internal predecessors, (427), 66 states have call successors, (66), 10 states have call predecessors, (66), 10 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 01:47:42,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 559 transitions. [2025-03-17 01:47:42,012 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 559 transitions. Word has length 154 [2025-03-17 01:47:42,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:42,012 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 559 transitions. [2025-03-17 01:47:42,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-17 01:47:42,013 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 559 transitions. [2025-03-17 01:47:42,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 01:47:42,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:42,014 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 01:47:42,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 01:47:42,014 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:42,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:42,014 INFO L85 PathProgramCache]: Analyzing trace with hash -213237060, now seen corresponding path program 1 times [2025-03-17 01:47:42,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:42,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680143341] [2025-03-17 01:47:42,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:42,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:42,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 01:47:42,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 01:47:42,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:42,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:44,355 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:47:44,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:44,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680143341] [2025-03-17 01:47:44,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680143341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:44,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:44,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 01:47:44,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278034957] [2025-03-17 01:47:44,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:44,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 01:47:44,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:44,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 01:47:44,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-17 01:47:44,357 INFO L87 Difference]: Start difference. First operand 401 states and 559 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 01:47:45,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:45,045 INFO L93 Difference]: Finished difference Result 746 states and 1041 transitions. [2025-03-17 01:47:45,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 01:47:45,045 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 154 [2025-03-17 01:47:45,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:45,047 INFO L225 Difference]: With dead ends: 746 [2025-03-17 01:47:45,047 INFO L226 Difference]: Without dead ends: 454 [2025-03-17 01:47:45,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2025-03-17 01:47:45,049 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 613 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:45,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 485 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 01:47:45,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-03-17 01:47:45,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 370. [2025-03-17 01:47:45,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 293 states have (on average 1.3003412969283277) internal successors, (381), 293 states have internal predecessors, (381), 66 states have call successors, (66), 10 states have call predecessors, (66), 10 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 01:47:45,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 513 transitions. [2025-03-17 01:47:45,072 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 513 transitions. Word has length 154 [2025-03-17 01:47:45,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:45,072 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 513 transitions. [2025-03-17 01:47:45,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 01:47:45,072 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 513 transitions. [2025-03-17 01:47:45,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 01:47:45,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:45,073 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 01:47:45,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 01:47:45,073 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:45,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:45,074 INFO L85 PathProgramCache]: Analyzing trace with hash 740107429, now seen corresponding path program 1 times [2025-03-17 01:47:45,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:45,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248797451] [2025-03-17 01:47:45,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:45,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:45,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 01:47:45,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 01:47:45,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:45,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:46,947 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:47:46,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:46,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248797451] [2025-03-17 01:47:46,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248797451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:46,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:46,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 01:47:46,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767829167] [2025-03-17 01:47:46,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:46,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 01:47:46,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:46,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 01:47:46,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:47:46,948 INFO L87 Difference]: Start difference. First operand 370 states and 513 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-17 01:47:47,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:47,593 INFO L93 Difference]: Finished difference Result 650 states and 905 transitions. [2025-03-17 01:47:47,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 01:47:47,593 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) Word has length 154 [2025-03-17 01:47:47,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:47,595 INFO L225 Difference]: With dead ends: 650 [2025-03-17 01:47:47,595 INFO L226 Difference]: Without dead ends: 379 [2025-03-17 01:47:47,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:47:47,596 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 291 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:47,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 528 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 01:47:47,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-03-17 01:47:47,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 356. [2025-03-17 01:47:47,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 279 states have (on average 1.3010752688172043) internal successors, (363), 279 states have internal predecessors, (363), 66 states have call successors, (66), 10 states have call predecessors, (66), 10 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 01:47:47,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 495 transitions. [2025-03-17 01:47:47,623 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 495 transitions. Word has length 154 [2025-03-17 01:47:47,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:47,623 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 495 transitions. [2025-03-17 01:47:47,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-17 01:47:47,624 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 495 transitions. [2025-03-17 01:47:47,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 01:47:47,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:47,625 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 01:47:47,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 01:47:47,625 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:47,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:47,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1642383616, now seen corresponding path program 1 times [2025-03-17 01:47:47,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:47,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34923512] [2025-03-17 01:47:47,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:47,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:47,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 01:47:47,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 01:47:47,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:47,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:50,094 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:47:50,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:50,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34923512] [2025-03-17 01:47:50,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34923512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:50,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:50,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 01:47:50,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318884919] [2025-03-17 01:47:50,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:50,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 01:47:50,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:50,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 01:47:50,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:47:50,096 INFO L87 Difference]: Start difference. First operand 356 states and 495 transitions. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 16 states have internal predecessors, (48), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-17 01:47:51,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:51,347 INFO L93 Difference]: Finished difference Result 397 states and 541 transitions. [2025-03-17 01:47:51,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 01:47:51,356 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 16 states have internal predecessors, (48), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) Word has length 155 [2025-03-17 01:47:51,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:51,358 INFO L225 Difference]: With dead ends: 397 [2025-03-17 01:47:51,358 INFO L226 Difference]: Without dead ends: 395 [2025-03-17 01:47:51,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=174, Invalid=476, Unknown=0, NotChecked=0, Total=650 [2025-03-17 01:47:51,358 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 398 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:51,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 646 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 01:47:51,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-17 01:47:51,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 357. [2025-03-17 01:47:51,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 280 states have (on average 1.3) internal successors, (364), 280 states have internal predecessors, (364), 66 states have call successors, (66), 10 states have call predecessors, (66), 10 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 01:47:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 496 transitions. [2025-03-17 01:47:51,381 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 496 transitions. Word has length 155 [2025-03-17 01:47:51,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:51,381 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 496 transitions. [2025-03-17 01:47:51,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 16 states have internal predecessors, (48), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-17 01:47:51,382 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 496 transitions. [2025-03-17 01:47:51,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 01:47:51,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:51,382 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 01:47:51,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 01:47:51,383 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:51,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:51,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1986101830, now seen corresponding path program 1 times [2025-03-17 01:47:51,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:51,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123152854] [2025-03-17 01:47:51,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:51,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:51,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 01:47:51,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 01:47:51,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:51,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:47:51,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:51,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123152854] [2025-03-17 01:47:51,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123152854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:51,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:51,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 01:47:51,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362005050] [2025-03-17 01:47:51,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:51,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 01:47:51,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:51,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 01:47:51,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 01:47:51,681 INFO L87 Difference]: Start difference. First operand 357 states and 496 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:47:51,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:51,779 INFO L93 Difference]: Finished difference Result 661 states and 925 transitions. [2025-03-17 01:47:51,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 01:47:51,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2025-03-17 01:47:51,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:51,782 INFO L225 Difference]: With dead ends: 661 [2025-03-17 01:47:51,782 INFO L226 Difference]: Without dead ends: 402 [2025-03-17 01:47:51,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 01:47:51,783 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 111 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:51,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 313 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:47:51,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-03-17 01:47:51,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 367. [2025-03-17 01:47:51,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 290 states have (on average 1.2862068965517242) internal successors, (373), 290 states have internal predecessors, (373), 66 states have call successors, (66), 10 states have call predecessors, (66), 10 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 01:47:51,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 505 transitions. [2025-03-17 01:47:51,804 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 505 transitions. Word has length 155 [2025-03-17 01:47:51,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:51,805 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 505 transitions. [2025-03-17 01:47:51,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:47:51,805 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 505 transitions. [2025-03-17 01:47:51,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-17 01:47:51,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:51,807 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:47:51,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 01:47:51,807 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:51,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:51,807 INFO L85 PathProgramCache]: Analyzing trace with hash -36782768, now seen corresponding path program 1 times [2025-03-17 01:47:51,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:51,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204357574] [2025-03-17 01:47:51,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:51,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:51,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-17 01:47:51,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-17 01:47:51,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:51,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:52,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3842 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 3821 trivial. 0 not checked. [2025-03-17 01:47:52,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:52,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204357574] [2025-03-17 01:47:52,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204357574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:52,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:52,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:47:52,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141626351] [2025-03-17 01:47:52,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:52,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:47:52,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:52,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:47:52,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:47:52,057 INFO L87 Difference]: Start difference. First operand 367 states and 505 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:47:52,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:52,363 INFO L93 Difference]: Finished difference Result 791 states and 1095 transitions. [2025-03-17 01:47:52,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:47:52,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 301 [2025-03-17 01:47:52,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:52,367 INFO L225 Difference]: With dead ends: 791 [2025-03-17 01:47:52,367 INFO L226 Difference]: Without dead ends: 522 [2025-03-17 01:47:52,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:47:52,370 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 223 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:52,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 462 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:47:52,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-17 01:47:52,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 386. [2025-03-17 01:47:52,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 309 states have (on average 1.2815533980582525) internal successors, (396), 309 states have internal predecessors, (396), 66 states have call successors, (66), 10 states have call predecessors, (66), 10 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 01:47:52,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 528 transitions. [2025-03-17 01:47:52,406 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 528 transitions. Word has length 301 [2025-03-17 01:47:52,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:52,407 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 528 transitions. [2025-03-17 01:47:52,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:47:52,407 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 528 transitions. [2025-03-17 01:47:52,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-17 01:47:52,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:52,409 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:47:52,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 01:47:52,410 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:52,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:52,410 INFO L85 PathProgramCache]: Analyzing trace with hash -206042812, now seen corresponding path program 1 times [2025-03-17 01:47:52,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:52,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451455404] [2025-03-17 01:47:52,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:52,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:52,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-17 01:47:52,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-17 01:47:52,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:52,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:52,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3840 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 3822 trivial. 0 not checked. [2025-03-17 01:47:52,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:52,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451455404] [2025-03-17 01:47:52,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451455404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:52,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:52,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:47:52,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031679340] [2025-03-17 01:47:52,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:52,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:47:52,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:52,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:47:52,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:47:52,769 INFO L87 Difference]: Start difference. First operand 386 states and 528 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:47:52,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:52,887 INFO L93 Difference]: Finished difference Result 822 states and 1139 transitions. [2025-03-17 01:47:52,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:47:52,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 301 [2025-03-17 01:47:52,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:52,890 INFO L225 Difference]: With dead ends: 822 [2025-03-17 01:47:52,890 INFO L226 Difference]: Without dead ends: 524 [2025-03-17 01:47:52,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 01:47:52,891 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 46 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:52,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 517 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:47:52,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-17 01:47:52,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 411. [2025-03-17 01:47:52,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 334 states have (on average 1.2964071856287425) internal successors, (433), 334 states have internal predecessors, (433), 66 states have call successors, (66), 10 states have call predecessors, (66), 10 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 01:47:52,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 565 transitions. [2025-03-17 01:47:52,921 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 565 transitions. Word has length 301 [2025-03-17 01:47:52,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:52,921 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 565 transitions. [2025-03-17 01:47:52,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:47:52,922 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 565 transitions. [2025-03-17 01:47:52,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-17 01:47:52,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:52,923 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:47:52,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 01:47:52,924 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:52,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:52,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1050514683, now seen corresponding path program 1 times [2025-03-17 01:47:52,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:52,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295623250] [2025-03-17 01:47:52,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:52,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:52,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-17 01:47:53,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-17 01:47:53,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:53,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:54,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3840 backedges. 3 proven. 53 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-17 01:47:54,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:54,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295623250] [2025-03-17 01:47:54,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295623250] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:47:54,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908250191] [2025-03-17 01:47:54,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:54,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:47:54,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:47:54,286 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-03-17 01:47:54,287 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-03-17 01:47:54,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-17 01:47:54,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-17 01:47:54,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:54,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:54,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 01:47:54,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:47:54,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3840 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3821 trivial. 0 not checked. [2025-03-17 01:47:54,561 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:47:54,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908250191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:54,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:47:54,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [20] total 22 [2025-03-17 01:47:54,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83075208] [2025-03-17 01:47:54,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:54,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:47:54,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:54,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:47:54,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2025-03-17 01:47:54,563 INFO L87 Difference]: Start difference. First operand 411 states and 565 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:47:54,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:54,744 INFO L93 Difference]: Finished difference Result 681 states and 942 transitions. [2025-03-17 01:47:54,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:47:54,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 301 [2025-03-17 01:47:54,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:54,747 INFO L225 Difference]: With dead ends: 681 [2025-03-17 01:47:54,747 INFO L226 Difference]: Without dead ends: 358 [2025-03-17 01:47:54,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2025-03-17 01:47:54,752 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 106 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:54,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 340 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:47:54,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-03-17 01:47:54,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2025-03-17 01:47:54,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 281 states have (on average 1.2597864768683273) internal successors, (354), 281 states have internal predecessors, (354), 66 states have call successors, (66), 10 states have call predecessors, (66), 10 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 01:47:54,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 486 transitions. [2025-03-17 01:47:54,795 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 486 transitions. Word has length 301 [2025-03-17 01:47:54,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:54,795 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 486 transitions. [2025-03-17 01:47:54,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:47:54,795 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 486 transitions. [2025-03-17 01:47:54,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-03-17 01:47:54,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:54,797 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:47:54,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 01:47:54,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-17 01:47:54,998 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:54,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:54,999 INFO L85 PathProgramCache]: Analyzing trace with hash -539249216, now seen corresponding path program 1 times [2025-03-17 01:47:54,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:54,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752228223] [2025-03-17 01:47:54,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:54,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:55,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-17 01:47:55,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-17 01:47:55,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:55,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:48:03,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1 proven. 59 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-17 01:48:03,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:48:03,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752228223] [2025-03-17 01:48:03,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752228223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:48:03,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469875604] [2025-03-17 01:48:03,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:48:03,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:48:03,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:48:03,154 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-03-17 01:48:03,157 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-03-17 01:48:03,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-17 01:48:03,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-17 01:48:03,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:48:03,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:48:03,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 01:48:03,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:48:04,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 2454 proven. 81 refuted. 0 times theorem prover too weak. 1309 trivial. 0 not checked. [2025-03-17 01:48:04,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:48:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 50 proven. 259 refuted. 0 times theorem prover too weak. 3535 trivial. 0 not checked. [2025-03-17 01:48:05,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469875604] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:48:05,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 01:48:05,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 15] total 34 [2025-03-17 01:48:05,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273770062] [2025-03-17 01:48:05,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 01:48:05,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-17 01:48:05,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:48:05,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-17 01:48:05,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=998, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 01:48:05,117 INFO L87 Difference]: Start difference. First operand 358 states and 486 transitions. Second operand has 34 states, 34 states have (on average 6.882352941176471) internal successors, (234), 34 states have internal predecessors, (234), 8 states have call successors, (125), 4 states have call predecessors, (125), 8 states have return successors, (126), 8 states have call predecessors, (126), 8 states have call successors, (126) [2025-03-17 01:48:10,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:48:10,995 INFO L93 Difference]: Finished difference Result 710 states and 943 transitions. [2025-03-17 01:48:10,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-03-17 01:48:10,996 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 6.882352941176471) internal successors, (234), 34 states have internal predecessors, (234), 8 states have call successors, (125), 4 states have call predecessors, (125), 8 states have return successors, (126), 8 states have call predecessors, (126), 8 states have call successors, (126) Word has length 303 [2025-03-17 01:48:10,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:48:11,006 INFO L225 Difference]: With dead ends: 710 [2025-03-17 01:48:11,006 INFO L226 Difference]: Without dead ends: 437 [2025-03-17 01:48:11,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 599 SyntacticMatches, 3 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2879 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1492, Invalid=8408, Unknown=0, NotChecked=0, Total=9900 [2025-03-17 01:48:11,012 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 642 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 3266 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 3749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 3266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:48:11,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 1499 Invalid, 3749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 3266 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-17 01:48:11,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-17 01:48:11,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 310. [2025-03-17 01:48:11,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 227 states have (on average 1.1850220264317182) internal successors, (269), 227 states have internal predecessors, (269), 66 states have call successors, (66), 16 states have call predecessors, (66), 16 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 01:48:11,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 401 transitions. [2025-03-17 01:48:11,076 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 401 transitions. Word has length 303 [2025-03-17 01:48:11,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:48:11,080 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 401 transitions. [2025-03-17 01:48:11,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.882352941176471) internal successors, (234), 34 states have internal predecessors, (234), 8 states have call successors, (125), 4 states have call predecessors, (125), 8 states have return successors, (126), 8 states have call predecessors, (126), 8 states have call successors, (126) [2025-03-17 01:48:11,081 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 401 transitions. [2025-03-17 01:48:11,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-03-17 01:48:11,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:48:11,088 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:48:11,097 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-03-17 01:48:11,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:48:11,290 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:48:11,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:48:11,292 INFO L85 PathProgramCache]: Analyzing trace with hash 783053700, now seen corresponding path program 1 times [2025-03-17 01:48:11,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:48:11,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81141866] [2025-03-17 01:48:11,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:48:11,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:48:11,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-17 01:48:11,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-17 01:48:11,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:48:11,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:48:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3843 backedges. 19 proven. 40 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-17 01:48:14,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:48:14,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81141866] [2025-03-17 01:48:14,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81141866] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:48:14,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055248409] [2025-03-17 01:48:14,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:48:14,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:48:14,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:48:14,256 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-03-17 01:48:14,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process