./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c -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 c3ae342bfdc7bf76083bf4321cb5b6b26fe707bda9cd6edf475282aebbd1033a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:57:27,294 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:57:27,335 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:57:27,339 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:57:27,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:57:27,361 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:57:27,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:57:27,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:57:27,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:57:27,363 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:57:27,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:57:27,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:57:27,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:57:27,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:57:27,365 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:57:27,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:57:27,365 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:57:27,365 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:57:27,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:57:27,365 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:57:27,365 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:57:27,365 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:57:27,366 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:57:27,366 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:57:27,366 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:57:27,366 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:57:27,366 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:57:27,366 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:57:27,366 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:57:27,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:57:27,366 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:57:27,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:57:27,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:57:27,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:57:27,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:57:27,367 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:57:27,367 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:57:27,367 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:57:27,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:57:27,367 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:57:27,367 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:57:27,367 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:57:27,367 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:57:27,367 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 -> c3ae342bfdc7bf76083bf4321cb5b6b26fe707bda9cd6edf475282aebbd1033a [2025-03-08 05:57:27,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:57:27,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:57:27,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:57:27,580 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:57:27,580 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:57:27,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c [2025-03-08 05:57:28,729 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a955a1008/9e685d694095427cb6d5ee046d8e1160/FLAG7e8bb2111 [2025-03-08 05:57:28,988 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:57:28,988 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c [2025-03-08 05:57:28,999 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a955a1008/9e685d694095427cb6d5ee046d8e1160/FLAG7e8bb2111 [2025-03-08 05:57:29,015 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a955a1008/9e685d694095427cb6d5ee046d8e1160 [2025-03-08 05:57:29,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:57:29,018 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:57:29,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:57:29,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:57:29,026 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:57:29,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:57:29" (1/1) ... [2025-03-08 05:57:29,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@491c50c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:29, skipping insertion in model container [2025-03-08 05:57:29,033 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:57:29" (1/1) ... [2025-03-08 05:57:29,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:57:29,275 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/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c[12764,12777] [2025-03-08 05:57:29,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:57:29,287 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:57:29,323 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/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c[12764,12777] [2025-03-08 05:57:29,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:57:29,337 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:57:29,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:29 WrapperNode [2025-03-08 05:57:29,339 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:57:29,340 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:57:29,340 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:57:29,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:57:29,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:29" (1/1) ... [2025-03-08 05:57:29,360 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:29" (1/1) ... [2025-03-08 05:57:29,398 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 449 [2025-03-08 05:57:29,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:57:29,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:57:29,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:57:29,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:57:29,407 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:29" (1/1) ... [2025-03-08 05:57:29,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:29" (1/1) ... [2025-03-08 05:57:29,412 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:29" (1/1) ... [2025-03-08 05:57:29,431 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-08 05:57:29,434 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:29" (1/1) ... [2025-03-08 05:57:29,435 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:29" (1/1) ... [2025-03-08 05:57:29,440 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:29" (1/1) ... [2025-03-08 05:57:29,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:29" (1/1) ... [2025-03-08 05:57:29,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:29" (1/1) ... [2025-03-08 05:57:29,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:29" (1/1) ... [2025-03-08 05:57:29,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:57:29,455 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:57:29,455 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:57:29,455 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:57:29,456 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:29" (1/1) ... [2025-03-08 05:57:29,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:57:29,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:57:29,481 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-08 05:57:29,484 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-08 05:57:29,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:57:29,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:57:29,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:57:29,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:57:29,586 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:57:29,587 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:57:30,031 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-03-08 05:57:30,035 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:57:30,047 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:57:30,048 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:57:30,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:57:30 BoogieIcfgContainer [2025-03-08 05:57:30,049 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:57:30,051 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:57:30,051 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:57:30,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:57:30,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:57:29" (1/3) ... [2025-03-08 05:57:30,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74574563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:57:30, skipping insertion in model container [2025-03-08 05:57:30,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:29" (2/3) ... [2025-03-08 05:57:30,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74574563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:57:30, skipping insertion in model container [2025-03-08 05:57:30,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:57:30" (3/3) ... [2025-03-08 05:57:30,061 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.BOUNDED-6.pals.c [2025-03-08 05:57:30,074 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:57:30,078 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.3.3.ufo.BOUNDED-6.pals.c that has 1 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:57:30,123 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:57:30,131 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;@450bee2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:57:30,131 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:57:30,133 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 116 states have (on average 1.7844827586206897) internal successors, (207), 117 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:30,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 05:57:30,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:30,138 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:57:30,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:30,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:30,141 INFO L85 PathProgramCache]: Analyzing trace with hash -287906574, now seen corresponding path program 1 times [2025-03-08 05:57:30,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:30,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510152640] [2025-03-08 05:57:30,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:30,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:30,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 05:57:30,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 05:57:30,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:30,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:30,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:57:30,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:30,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510152640] [2025-03-08 05:57:30,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510152640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:30,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:30,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 05:57:30,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031482229] [2025-03-08 05:57:30,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:30,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 05:57:30,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:30,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 05:57:30,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:57:30,399 INFO L87 Difference]: Start difference. First operand has 118 states, 116 states have (on average 1.7844827586206897) internal successors, (207), 117 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:30,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:30,414 INFO L93 Difference]: Finished difference Result 180 states and 312 transitions. [2025-03-08 05:57:30,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 05:57:30,415 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-08 05:57:30,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:30,420 INFO L225 Difference]: With dead ends: 180 [2025-03-08 05:57:30,420 INFO L226 Difference]: Without dead ends: 115 [2025-03-08 05:57:30,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:57:30,423 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:30,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:30,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-08 05:57:30,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-08 05:57:30,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.7719298245614035) internal successors, (202), 114 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:30,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 202 transitions. [2025-03-08 05:57:30,448 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 202 transitions. Word has length 37 [2025-03-08 05:57:30,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:30,448 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 202 transitions. [2025-03-08 05:57:30,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:30,448 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 202 transitions. [2025-03-08 05:57:30,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 05:57:30,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:30,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:57:30,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:57:30,450 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:30,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:30,450 INFO L85 PathProgramCache]: Analyzing trace with hash -696730799, now seen corresponding path program 1 times [2025-03-08 05:57:30,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:30,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191339094] [2025-03-08 05:57:30,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:30,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:30,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 05:57:30,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 05:57:30,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:30,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:30,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:57:30,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:30,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191339094] [2025-03-08 05:57:30,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191339094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:30,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:30,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:57:30,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669614771] [2025-03-08 05:57:30,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:30,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:57:30,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:30,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:57:30,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:57:30,686 INFO L87 Difference]: Start difference. First operand 115 states and 202 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:30,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:30,768 INFO L93 Difference]: Finished difference Result 235 states and 406 transitions. [2025-03-08 05:57:30,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:57:30,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-08 05:57:30,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:30,770 INFO L225 Difference]: With dead ends: 235 [2025-03-08 05:57:30,770 INFO L226 Difference]: Without dead ends: 173 [2025-03-08 05:57:30,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:57:30,771 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 99 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:30,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 759 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:57:30,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-08 05:57:30,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 115. [2025-03-08 05:57:30,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.5350877192982457) internal successors, (175), 114 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:30,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 175 transitions. [2025-03-08 05:57:30,781 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 175 transitions. Word has length 37 [2025-03-08 05:57:30,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:30,781 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 175 transitions. [2025-03-08 05:57:30,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:30,781 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 175 transitions. [2025-03-08 05:57:30,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 05:57:30,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:30,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:57:30,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:57:30,784 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:30,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:30,784 INFO L85 PathProgramCache]: Analyzing trace with hash -327600201, now seen corresponding path program 1 times [2025-03-08 05:57:30,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:30,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220714091] [2025-03-08 05:57:30,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:30,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:30,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 05:57:30,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 05:57:30,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:30,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:30,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:57:30,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:30,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220714091] [2025-03-08 05:57:30,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220714091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:30,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:30,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:57:30,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884087853] [2025-03-08 05:57:30,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:30,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:57:30,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:30,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:57:30,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:30,907 INFO L87 Difference]: Start difference. First operand 115 states and 175 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:30,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:30,947 INFO L93 Difference]: Finished difference Result 222 states and 358 transitions. [2025-03-08 05:57:30,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:57:30,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-08 05:57:30,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:30,949 INFO L225 Difference]: With dead ends: 222 [2025-03-08 05:57:30,949 INFO L226 Difference]: Without dead ends: 164 [2025-03-08 05:57:30,949 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-08 05:57:30,949 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 75 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:30,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 373 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:30,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-08 05:57:30,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2025-03-08 05:57:30,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.565217391304348) internal successors, (252), 161 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:30,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 252 transitions. [2025-03-08 05:57:30,956 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 252 transitions. Word has length 63 [2025-03-08 05:57:30,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:30,956 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 252 transitions. [2025-03-08 05:57:30,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:30,956 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 252 transitions. [2025-03-08 05:57:30,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 05:57:30,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:30,957 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:57:30,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:57:30,958 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:30,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:30,958 INFO L85 PathProgramCache]: Analyzing trace with hash 926887085, now seen corresponding path program 1 times [2025-03-08 05:57:30,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:30,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732574319] [2025-03-08 05:57:30,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:30,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:30,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 05:57:30,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 05:57:30,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:30,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:31,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:57:31,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:31,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732574319] [2025-03-08 05:57:31,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732574319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:31,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:31,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:57:31,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324969804] [2025-03-08 05:57:31,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:31,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:57:31,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:31,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:57:31,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:31,028 INFO L87 Difference]: Start difference. First operand 162 states and 252 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:31,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:31,046 INFO L93 Difference]: Finished difference Result 269 states and 435 transitions. [2025-03-08 05:57:31,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:57:31,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-08 05:57:31,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:31,048 INFO L225 Difference]: With dead ends: 269 [2025-03-08 05:57:31,050 INFO L226 Difference]: Without dead ends: 211 [2025-03-08 05:57:31,050 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-08 05:57:31,050 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 84 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:31,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 399 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:31,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-08 05:57:31,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2025-03-08 05:57:31,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.5961538461538463) internal successors, (332), 208 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:31,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 332 transitions. [2025-03-08 05:57:31,061 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 332 transitions. Word has length 65 [2025-03-08 05:57:31,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:31,061 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 332 transitions. [2025-03-08 05:57:31,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:31,061 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 332 transitions. [2025-03-08 05:57:31,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 05:57:31,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:31,063 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:57:31,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:57:31,063 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:31,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:31,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1976340410, now seen corresponding path program 1 times [2025-03-08 05:57:31,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:31,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331653037] [2025-03-08 05:57:31,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:31,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:31,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 05:57:31,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 05:57:31,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:31,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:31,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:57:31,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:31,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331653037] [2025-03-08 05:57:31,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331653037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:31,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:31,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:57:31,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781315708] [2025-03-08 05:57:31,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:31,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:57:31,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:31,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:57:31,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:31,174 INFO L87 Difference]: Start difference. First operand 209 states and 332 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:31,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:31,196 INFO L93 Difference]: Finished difference Result 488 states and 803 transitions. [2025-03-08 05:57:31,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:57:31,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-08 05:57:31,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:31,198 INFO L225 Difference]: With dead ends: 488 [2025-03-08 05:57:31,198 INFO L226 Difference]: Without dead ends: 338 [2025-03-08 05:57:31,199 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-08 05:57:31,199 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 77 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:31,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 326 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:31,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-08 05:57:31,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2025-03-08 05:57:31,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 1.6238805970149253) internal successors, (544), 335 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:31,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 544 transitions. [2025-03-08 05:57:31,215 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 544 transitions. Word has length 65 [2025-03-08 05:57:31,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:31,216 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 544 transitions. [2025-03-08 05:57:31,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:31,216 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 544 transitions. [2025-03-08 05:57:31,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 05:57:31,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:31,220 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:57:31,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:57:31,220 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:31,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:31,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1502635164, now seen corresponding path program 1 times [2025-03-08 05:57:31,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:31,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401123983] [2025-03-08 05:57:31,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:31,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:31,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 05:57:31,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 05:57:31,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:31,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:31,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:57:31,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:31,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401123983] [2025-03-08 05:57:31,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401123983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:31,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:31,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:57:31,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498576665] [2025-03-08 05:57:31,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:31,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:57:31,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:31,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:57:31,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:31,324 INFO L87 Difference]: Start difference. First operand 336 states and 544 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:31,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:31,348 INFO L93 Difference]: Finished difference Result 848 states and 1400 transitions. [2025-03-08 05:57:31,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:57:31,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-08 05:57:31,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:31,351 INFO L225 Difference]: With dead ends: 848 [2025-03-08 05:57:31,351 INFO L226 Difference]: Without dead ends: 571 [2025-03-08 05:57:31,352 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-08 05:57:31,353 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 71 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:31,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 365 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:31,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-03-08 05:57:31,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 569. [2025-03-08 05:57:31,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.630281690140845) internal successors, (926), 568 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:31,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 926 transitions. [2025-03-08 05:57:31,372 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 926 transitions. Word has length 67 [2025-03-08 05:57:31,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:31,373 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 926 transitions. [2025-03-08 05:57:31,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:31,373 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 926 transitions. [2025-03-08 05:57:31,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 05:57:31,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:31,374 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:57:31,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:57:31,374 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:31,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:31,375 INFO L85 PathProgramCache]: Analyzing trace with hash -399372334, now seen corresponding path program 1 times [2025-03-08 05:57:31,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:31,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807406073] [2025-03-08 05:57:31,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:31,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:31,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 05:57:31,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 05:57:31,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:31,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:31,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:57:31,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:31,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807406073] [2025-03-08 05:57:31,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807406073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:31,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:31,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:57:31,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251571595] [2025-03-08 05:57:31,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:31,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:57:31,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:31,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:57:31,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:31,466 INFO L87 Difference]: Start difference. First operand 569 states and 926 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:31,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:31,490 INFO L93 Difference]: Finished difference Result 1078 states and 1774 transitions. [2025-03-08 05:57:31,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:57:31,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-08 05:57:31,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:31,494 INFO L225 Difference]: With dead ends: 1078 [2025-03-08 05:57:31,494 INFO L226 Difference]: Without dead ends: 801 [2025-03-08 05:57:31,494 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-08 05:57:31,496 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 72 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:31,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 370 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:31,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2025-03-08 05:57:31,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 799. [2025-03-08 05:57:31,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 798 states have (on average 1.6265664160401003) internal successors, (1298), 798 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:31,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1298 transitions. [2025-03-08 05:57:31,527 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1298 transitions. Word has length 69 [2025-03-08 05:57:31,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:31,527 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1298 transitions. [2025-03-08 05:57:31,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:31,528 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1298 transitions. [2025-03-08 05:57:31,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 05:57:31,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:31,529 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:57:31,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:57:31,529 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:31,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:31,529 INFO L85 PathProgramCache]: Analyzing trace with hash -821702689, now seen corresponding path program 1 times [2025-03-08 05:57:31,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:31,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16533052] [2025-03-08 05:57:31,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:31,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:31,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 05:57:31,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 05:57:31,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:31,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:31,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:57:31,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:31,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16533052] [2025-03-08 05:57:31,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16533052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:31,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:31,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:57:31,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278331893] [2025-03-08 05:57:31,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:31,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:57:31,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:31,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:57:31,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:57:31,642 INFO L87 Difference]: Start difference. First operand 799 states and 1298 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:31,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:31,806 INFO L93 Difference]: Finished difference Result 3751 states and 6256 transitions. [2025-03-08 05:57:31,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:57:31,807 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-08 05:57:31,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:31,817 INFO L225 Difference]: With dead ends: 3751 [2025-03-08 05:57:31,817 INFO L226 Difference]: Without dead ends: 3032 [2025-03-08 05:57:31,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:57:31,818 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 618 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:31,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 885 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:57:31,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3032 states. [2025-03-08 05:57:31,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3032 to 1466. [2025-03-08 05:57:31,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1466 states, 1465 states have (on average 1.627986348122867) internal successors, (2385), 1465 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:31,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 2385 transitions. [2025-03-08 05:57:31,869 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 2385 transitions. Word has length 69 [2025-03-08 05:57:31,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:31,869 INFO L471 AbstractCegarLoop]: Abstraction has 1466 states and 2385 transitions. [2025-03-08 05:57:31,870 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:31,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2385 transitions. [2025-03-08 05:57:31,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 05:57:31,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:31,870 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:57:31,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:57:31,871 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:31,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:31,871 INFO L85 PathProgramCache]: Analyzing trace with hash 347875612, now seen corresponding path program 1 times [2025-03-08 05:57:31,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:31,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409127402] [2025-03-08 05:57:31,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:31,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:31,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 05:57:31,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 05:57:31,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:31,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:31,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:57:31,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:31,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409127402] [2025-03-08 05:57:31,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409127402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:31,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:31,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:57:31,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044476947] [2025-03-08 05:57:31,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:31,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:57:31,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:31,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:57:31,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:57:31,992 INFO L87 Difference]: Start difference. First operand 1466 states and 2385 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:32,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:32,103 INFO L93 Difference]: Finished difference Result 4675 states and 7722 transitions. [2025-03-08 05:57:32,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:57:32,104 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-08 05:57:32,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:32,116 INFO L225 Difference]: With dead ends: 4675 [2025-03-08 05:57:32,116 INFO L226 Difference]: Without dead ends: 3292 [2025-03-08 05:57:32,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:57:32,120 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 284 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:32,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 462 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:32,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3292 states. [2025-03-08 05:57:32,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3292 to 2366. [2025-03-08 05:57:32,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 2365 states have (on average 1.6325581395348838) internal successors, (3861), 2365 states have internal predecessors, (3861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:32,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 3861 transitions. [2025-03-08 05:57:32,211 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 3861 transitions. Word has length 70 [2025-03-08 05:57:32,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:32,211 INFO L471 AbstractCegarLoop]: Abstraction has 2366 states and 3861 transitions. [2025-03-08 05:57:32,211 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:32,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 3861 transitions. [2025-03-08 05:57:32,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 05:57:32,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:32,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:57:32,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:57:32,212 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:32,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:32,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1666033767, now seen corresponding path program 1 times [2025-03-08 05:57:32,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:32,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579562443] [2025-03-08 05:57:32,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:32,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:32,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 05:57:32,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 05:57:32,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:32,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:32,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:57:32,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:32,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579562443] [2025-03-08 05:57:32,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579562443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:32,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:32,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:57:32,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125121804] [2025-03-08 05:57:32,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:32,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:57:32,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:32,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:57:32,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:32,290 INFO L87 Difference]: Start difference. First operand 2366 states and 3861 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:32,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:32,353 INFO L93 Difference]: Finished difference Result 4632 states and 7591 transitions. [2025-03-08 05:57:32,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:57:32,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-08 05:57:32,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:32,364 INFO L225 Difference]: With dead ends: 4632 [2025-03-08 05:57:32,364 INFO L226 Difference]: Without dead ends: 3322 [2025-03-08 05:57:32,367 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-08 05:57:32,367 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 78 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:32,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 400 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:32,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2025-03-08 05:57:32,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 3320. [2025-03-08 05:57:32,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3320 states, 3319 states have (on average 1.619764989454655) internal successors, (5376), 3319 states have internal predecessors, (5376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:32,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3320 states to 3320 states and 5376 transitions. [2025-03-08 05:57:32,475 INFO L78 Accepts]: Start accepts. Automaton has 3320 states and 5376 transitions. Word has length 70 [2025-03-08 05:57:32,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:32,476 INFO L471 AbstractCegarLoop]: Abstraction has 3320 states and 5376 transitions. [2025-03-08 05:57:32,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:32,476 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 5376 transitions. [2025-03-08 05:57:32,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 05:57:32,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:32,476 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:57:32,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:57:32,476 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:32,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:32,477 INFO L85 PathProgramCache]: Analyzing trace with hash -2051749763, now seen corresponding path program 1 times [2025-03-08 05:57:32,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:32,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203977710] [2025-03-08 05:57:32,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:32,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:32,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 05:57:32,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 05:57:32,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:32,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:32,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:57:32,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:32,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203977710] [2025-03-08 05:57:32,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203977710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:32,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:32,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:57:32,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469178340] [2025-03-08 05:57:32,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:32,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:57:32,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:32,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:57:32,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:57:32,545 INFO L87 Difference]: Start difference. First operand 3320 states and 5376 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:32,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:32,672 INFO L93 Difference]: Finished difference Result 10675 states and 17375 transitions. [2025-03-08 05:57:32,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:57:32,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-08 05:57:32,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:32,695 INFO L225 Difference]: With dead ends: 10675 [2025-03-08 05:57:32,695 INFO L226 Difference]: Without dead ends: 7426 [2025-03-08 05:57:32,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:57:32,701 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 282 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:32,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 551 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:32,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7426 states. [2025-03-08 05:57:32,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7426 to 5344. [2025-03-08 05:57:32,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5344 states, 5343 states have (on average 1.609208309938237) internal successors, (8598), 5343 states have internal predecessors, (8598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:32,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 8598 transitions. [2025-03-08 05:57:32,847 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 8598 transitions. Word has length 71 [2025-03-08 05:57:32,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:32,847 INFO L471 AbstractCegarLoop]: Abstraction has 5344 states and 8598 transitions. [2025-03-08 05:57:32,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:32,848 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 8598 transitions. [2025-03-08 05:57:32,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 05:57:32,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:32,848 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:57:32,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:57:32,848 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:32,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:32,849 INFO L85 PathProgramCache]: Analyzing trace with hash 867427898, now seen corresponding path program 1 times [2025-03-08 05:57:32,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:32,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908012332] [2025-03-08 05:57:32,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:32,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:32,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 05:57:32,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 05:57:32,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:32,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:32,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:57:32,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:32,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908012332] [2025-03-08 05:57:32,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908012332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:32,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:32,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:57:32,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942711747] [2025-03-08 05:57:32,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:32,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:57:32,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:32,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:57:32,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:57:32,954 INFO L87 Difference]: Start difference. First operand 5344 states and 8598 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:33,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:33,136 INFO L93 Difference]: Finished difference Result 16871 states and 27255 transitions. [2025-03-08 05:57:33,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:57:33,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-08 05:57:33,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:33,176 INFO L225 Difference]: With dead ends: 16871 [2025-03-08 05:57:33,176 INFO L226 Difference]: Without dead ends: 11598 [2025-03-08 05:57:33,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:57:33,186 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 280 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:33,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 553 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:33,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11598 states. [2025-03-08 05:57:33,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11598 to 8428. [2025-03-08 05:57:33,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8428 states, 8427 states have (on average 1.5981962738815711) internal successors, (13468), 8427 states have internal predecessors, (13468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:33,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8428 states to 8428 states and 13468 transitions. [2025-03-08 05:57:33,437 INFO L78 Accepts]: Start accepts. Automaton has 8428 states and 13468 transitions. Word has length 72 [2025-03-08 05:57:33,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:33,437 INFO L471 AbstractCegarLoop]: Abstraction has 8428 states and 13468 transitions. [2025-03-08 05:57:33,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:33,437 INFO L276 IsEmpty]: Start isEmpty. Operand 8428 states and 13468 transitions. [2025-03-08 05:57:33,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 05:57:33,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:33,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:57:33,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:57:33,438 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:33,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:33,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1822757720, now seen corresponding path program 1 times [2025-03-08 05:57:33,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:33,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321558252] [2025-03-08 05:57:33,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:33,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:33,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 05:57:33,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 05:57:33,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:33,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:57:33,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:33,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321558252] [2025-03-08 05:57:33,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321558252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:33,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:33,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:57:33,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395895782] [2025-03-08 05:57:33,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:33,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:57:33,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:33,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:57:33,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:57:33,604 INFO L87 Difference]: Start difference. First operand 8428 states and 13468 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:33,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:33,744 INFO L93 Difference]: Finished difference Result 16787 states and 26844 transitions. [2025-03-08 05:57:33,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:57:33,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-08 05:57:33,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:33,758 INFO L225 Difference]: With dead ends: 16787 [2025-03-08 05:57:33,759 INFO L226 Difference]: Without dead ends: 8430 [2025-03-08 05:57:33,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:57:33,769 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 141 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:33,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 459 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:33,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8430 states. [2025-03-08 05:57:34,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8430 to 8428. [2025-03-08 05:57:34,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8428 states, 8427 states have (on average 1.5833629998813339) internal successors, (13343), 8427 states have internal predecessors, (13343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:34,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8428 states to 8428 states and 13343 transitions. [2025-03-08 05:57:34,078 INFO L78 Accepts]: Start accepts. Automaton has 8428 states and 13343 transitions. Word has length 74 [2025-03-08 05:57:34,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:34,078 INFO L471 AbstractCegarLoop]: Abstraction has 8428 states and 13343 transitions. [2025-03-08 05:57:34,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:34,079 INFO L276 IsEmpty]: Start isEmpty. Operand 8428 states and 13343 transitions. [2025-03-08 05:57:34,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:57:34,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:34,079 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:57:34,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:57:34,079 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:34,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:34,080 INFO L85 PathProgramCache]: Analyzing trace with hash -2124876074, now seen corresponding path program 1 times [2025-03-08 05:57:34,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:34,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278079550] [2025-03-08 05:57:34,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:34,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:34,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:57:34,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:57:34,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:34,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:34,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:57:34,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:34,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278079550] [2025-03-08 05:57:34,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278079550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:34,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:34,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:57:34,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364023853] [2025-03-08 05:57:34,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:34,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:57:34,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:34,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:57:34,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:57:34,260 INFO L87 Difference]: Start difference. First operand 8428 states and 13343 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:34,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:34,551 INFO L93 Difference]: Finished difference Result 24145 states and 38378 transitions. [2025-03-08 05:57:34,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:57:34,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-08 05:57:34,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:34,583 INFO L225 Difference]: With dead ends: 24145 [2025-03-08 05:57:34,583 INFO L226 Difference]: Without dead ends: 15788 [2025-03-08 05:57:34,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:57:34,596 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 69 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:34,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 616 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:34,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15788 states. [2025-03-08 05:57:34,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15788 to 15786. [2025-03-08 05:57:34,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15786 states, 15785 states have (on average 1.5671840354767184) internal successors, (24738), 15785 states have internal predecessors, (24738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:35,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15786 states to 15786 states and 24738 transitions. [2025-03-08 05:57:35,111 INFO L78 Accepts]: Start accepts. Automaton has 15786 states and 24738 transitions. Word has length 77 [2025-03-08 05:57:35,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:35,111 INFO L471 AbstractCegarLoop]: Abstraction has 15786 states and 24738 transitions. [2025-03-08 05:57:35,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:35,111 INFO L276 IsEmpty]: Start isEmpty. Operand 15786 states and 24738 transitions. [2025-03-08 05:57:35,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 05:57:35,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:35,112 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:57:35,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:57:35,112 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:35,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:35,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1414264079, now seen corresponding path program 1 times [2025-03-08 05:57:35,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:35,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624060812] [2025-03-08 05:57:35,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:35,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:35,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 05:57:35,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 05:57:35,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:35,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:35,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:57:35,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:35,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624060812] [2025-03-08 05:57:35,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624060812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:35,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:35,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:57:35,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431863265] [2025-03-08 05:57:35,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:35,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:57:35,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:35,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:57:35,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:57:35,331 INFO L87 Difference]: Start difference. First operand 15786 states and 24738 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:35,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:35,469 INFO L93 Difference]: Finished difference Result 16874 states and 26187 transitions. [2025-03-08 05:57:35,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:57:35,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-08 05:57:35,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:35,564 INFO L225 Difference]: With dead ends: 16874 [2025-03-08 05:57:35,564 INFO L226 Difference]: Without dead ends: 16872 [2025-03-08 05:57:35,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:57:35,567 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:35,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 674 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:35,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16872 states. [2025-03-08 05:57:35,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16872 to 16872. [2025-03-08 05:57:35,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16872 states, 16871 states have (on average 1.5301404777428724) internal successors, (25815), 16871 states have internal predecessors, (25815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:35,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16872 states to 16872 states and 25815 transitions. [2025-03-08 05:57:35,885 INFO L78 Accepts]: Start accepts. Automaton has 16872 states and 25815 transitions. Word has length 78 [2025-03-08 05:57:35,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:35,885 INFO L471 AbstractCegarLoop]: Abstraction has 16872 states and 25815 transitions. [2025-03-08 05:57:35,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:35,885 INFO L276 IsEmpty]: Start isEmpty. Operand 16872 states and 25815 transitions. [2025-03-08 05:57:35,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 05:57:35,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:35,889 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:57:35,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:57:35,889 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:35,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:35,889 INFO L85 PathProgramCache]: Analyzing trace with hash -84241283, now seen corresponding path program 1 times [2025-03-08 05:57:35,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:35,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21615685] [2025-03-08 05:57:35,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:35,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:35,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 05:57:35,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 05:57:35,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:35,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:57:35,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:35,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21615685] [2025-03-08 05:57:35,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21615685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:35,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:35,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:57:35,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098662223] [2025-03-08 05:57:35,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:35,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:57:35,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:35,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:57:35,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:35,975 INFO L87 Difference]: Start difference. First operand 16872 states and 25815 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:36,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:36,360 INFO L93 Difference]: Finished difference Result 50355 states and 76975 transitions. [2025-03-08 05:57:36,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:57:36,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-03-08 05:57:36,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:36,425 INFO L225 Difference]: With dead ends: 50355 [2025-03-08 05:57:36,425 INFO L226 Difference]: Without dead ends: 33550 [2025-03-08 05:57:36,454 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-08 05:57:36,455 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 111 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:36,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 400 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:36,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33550 states. [2025-03-08 05:57:37,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33550 to 33548. [2025-03-08 05:57:37,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33548 states, 33547 states have (on average 1.5150982204071899) internal successors, (50827), 33547 states have internal predecessors, (50827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33548 states to 33548 states and 50827 transitions. [2025-03-08 05:57:37,118 INFO L78 Accepts]: Start accepts. Automaton has 33548 states and 50827 transitions. Word has length 103 [2025-03-08 05:57:37,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:37,118 INFO L471 AbstractCegarLoop]: Abstraction has 33548 states and 50827 transitions. [2025-03-08 05:57:37,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:37,118 INFO L276 IsEmpty]: Start isEmpty. Operand 33548 states and 50827 transitions. [2025-03-08 05:57:37,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 05:57:37,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:37,121 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:57:37,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:57:37,122 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:37,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:37,123 INFO L85 PathProgramCache]: Analyzing trace with hash 2104417837, now seen corresponding path program 1 times [2025-03-08 05:57:37,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:37,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590124372] [2025-03-08 05:57:37,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:37,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:37,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 05:57:37,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 05:57:37,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:37,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:37,190 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 05:57:37,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:37,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590124372] [2025-03-08 05:57:37,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590124372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:37,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:37,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:57:37,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133310500] [2025-03-08 05:57:37,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:37,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:57:37,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:37,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:57:37,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:37,194 INFO L87 Difference]: Start difference. First operand 33548 states and 50827 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:37,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:37,868 INFO L93 Difference]: Finished difference Result 100178 states and 151632 transitions. [2025-03-08 05:57:37,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:57:37,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-03-08 05:57:37,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:38,040 INFO L225 Difference]: With dead ends: 100178 [2025-03-08 05:57:38,041 INFO L226 Difference]: Without dead ends: 66733 [2025-03-08 05:57:38,092 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-08 05:57:38,093 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 110 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:38,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 401 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:38,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66733 states. [2025-03-08 05:57:39,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66733 to 66731. [2025-03-08 05:57:39,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66731 states, 66730 states have (on average 1.4999550427094261) internal successors, (100092), 66730 states have internal predecessors, (100092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:39,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66731 states to 66731 states and 100092 transitions. [2025-03-08 05:57:39,373 INFO L78 Accepts]: Start accepts. Automaton has 66731 states and 100092 transitions. Word has length 103 [2025-03-08 05:57:39,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:39,373 INFO L471 AbstractCegarLoop]: Abstraction has 66731 states and 100092 transitions. [2025-03-08 05:57:39,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:39,374 INFO L276 IsEmpty]: Start isEmpty. Operand 66731 states and 100092 transitions. [2025-03-08 05:57:39,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 05:57:39,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:39,380 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:57:39,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:57:39,380 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:39,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:39,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1177611716, now seen corresponding path program 1 times [2025-03-08 05:57:39,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:39,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801541969] [2025-03-08 05:57:39,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:39,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:39,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 05:57:39,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 05:57:39,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:39,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:39,460 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:57:39,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:39,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801541969] [2025-03-08 05:57:39,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801541969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:39,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:39,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:57:39,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908910856] [2025-03-08 05:57:39,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:39,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:57:39,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:39,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:57:39,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:39,461 INFO L87 Difference]: Start difference. First operand 66731 states and 100092 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:40,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:40,859 INFO L93 Difference]: Finished difference Result 199275 states and 298602 transitions. [2025-03-08 05:57:40,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:57:40,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-03-08 05:57:40,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:41,142 INFO L225 Difference]: With dead ends: 199275 [2025-03-08 05:57:41,143 INFO L226 Difference]: Without dead ends: 132729 [2025-03-08 05:57:41,194 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-08 05:57:41,195 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 96 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:41,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 386 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:41,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132729 states. [2025-03-08 05:57:43,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132729 to 132727. [2025-03-08 05:57:43,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132727 states, 132726 states have (on average 1.4846224552838179) internal successors, (197048), 132726 states have internal predecessors, (197048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:43,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132727 states to 132727 states and 197048 transitions. [2025-03-08 05:57:43,888 INFO L78 Accepts]: Start accepts. Automaton has 132727 states and 197048 transitions. Word has length 103 [2025-03-08 05:57:43,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:43,889 INFO L471 AbstractCegarLoop]: Abstraction has 132727 states and 197048 transitions. [2025-03-08 05:57:43,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand 132727 states and 197048 transitions. [2025-03-08 05:57:43,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 05:57:43,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:43,898 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:57:43,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:57:43,898 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:43,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:43,899 INFO L85 PathProgramCache]: Analyzing trace with hash -514330997, now seen corresponding path program 1 times [2025-03-08 05:57:43,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:43,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503204129] [2025-03-08 05:57:43,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:43,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:43,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 05:57:43,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 05:57:43,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:43,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:43,953 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:57:43,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:43,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503204129] [2025-03-08 05:57:43,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503204129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:43,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:43,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:57:43,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405732142] [2025-03-08 05:57:43,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:43,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:57:43,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:43,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:57:43,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:43,955 INFO L87 Difference]: Start difference. First operand 132727 states and 197048 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:46,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:46,546 INFO L93 Difference]: Finished difference Result 396375 states and 587895 transitions. [2025-03-08 05:57:46,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:57:46,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-03-08 05:57:46,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:47,233 INFO L225 Difference]: With dead ends: 396375 [2025-03-08 05:57:47,233 INFO L226 Difference]: Without dead ends: 264057 [2025-03-08 05:57:47,327 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-08 05:57:47,328 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 130 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:47,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 417 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:47,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264057 states. [2025-03-08 05:57:51,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264057 to 264055. [2025-03-08 05:57:51,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264055 states, 264054 states have (on average 1.4692184174449165) internal successors, (387953), 264054 states have internal predecessors, (387953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:52,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264055 states to 264055 states and 387953 transitions. [2025-03-08 05:57:52,452 INFO L78 Accepts]: Start accepts. Automaton has 264055 states and 387953 transitions. Word has length 103 [2025-03-08 05:57:52,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:52,452 INFO L471 AbstractCegarLoop]: Abstraction has 264055 states and 387953 transitions. [2025-03-08 05:57:52,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:52,453 INFO L276 IsEmpty]: Start isEmpty. Operand 264055 states and 387953 transitions. [2025-03-08 05:57:52,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 05:57:52,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:52,470 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:57:52,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:57:52,470 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:52,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:52,471 INFO L85 PathProgramCache]: Analyzing trace with hash -963027636, now seen corresponding path program 1 times [2025-03-08 05:57:52,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:52,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760228814] [2025-03-08 05:57:52,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:52,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:52,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 05:57:52,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 05:57:52,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:52,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:52,541 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 05:57:52,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:52,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760228814] [2025-03-08 05:57:52,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760228814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:52,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:52,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:57:52,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269779305] [2025-03-08 05:57:52,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:52,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:57:52,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:52,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:57:52,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:52,543 INFO L87 Difference]: Start difference. First operand 264055 states and 387953 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:57,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:57,024 INFO L93 Difference]: Finished difference Result 557067 states and 823483 transitions. [2025-03-08 05:57:57,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:57:57,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-03-08 05:57:57,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:57,911 INFO L225 Difference]: With dead ends: 557067 [2025-03-08 05:57:57,912 INFO L226 Difference]: Without dead ends: 427145 [2025-03-08 05:57:58,041 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-08 05:57:58,041 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 60 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:58,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 314 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:58,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427145 states. [2025-03-08 05:58:05,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427145 to 426379. [2025-03-08 05:58:05,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426379 states, 426378 states have (on average 1.4696560329097654) internal successors, (626629), 426378 states have internal predecessors, (626629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:58:06,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426379 states to 426379 states and 626629 transitions. [2025-03-08 05:58:06,382 INFO L78 Accepts]: Start accepts. Automaton has 426379 states and 626629 transitions. Word has length 103 [2025-03-08 05:58:06,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:58:06,383 INFO L471 AbstractCegarLoop]: Abstraction has 426379 states and 626629 transitions. [2025-03-08 05:58:06,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:58:06,383 INFO L276 IsEmpty]: Start isEmpty. Operand 426379 states and 626629 transitions. [2025-03-08 05:58:06,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 05:58:06,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:58:06,400 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:58:06,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:58:06,400 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:58:06,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:58:06,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1541189043, now seen corresponding path program 1 times [2025-03-08 05:58:06,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:58:06,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362691517] [2025-03-08 05:58:06,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:58:06,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:58:06,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 05:58:06,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 05:58:06,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:58:06,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:58:06,501 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:58:06,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:58:06,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362691517] [2025-03-08 05:58:06,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362691517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:58:06,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:58:06,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:58:06,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36128966] [2025-03-08 05:58:06,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:58:06,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:58:06,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:58:06,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:58:06,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:58:06,504 INFO L87 Difference]: Start difference. First operand 426379 states and 626629 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)