./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.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_lcr-var-start-time.4.1.ufo.BOUNDED-8.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 308b0e1adc3ae7348985993203af7f0b3a83352e3d43ffbdb40ed727e63d4081 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:59:18,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:59:18,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:59:18,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:59:18,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:59:18,327 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:59:18,327 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:59:18,327 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:59:18,327 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:59:18,327 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:59:18,327 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:59:18,327 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:59:18,328 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:59:18,328 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:59:18,328 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:59:18,328 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:59:18,328 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:59:18,328 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:59:18,328 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:59:18,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:59:18,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:59:18,328 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:59:18,328 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:59:18,328 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:59:18,328 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:59:18,328 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:59:18,329 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:59:18,329 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:59:18,329 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:59:18,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:59:18,329 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:59:18,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:59:18,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:59:18,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:59:18,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:59:18,329 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:59:18,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:59:18,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:59:18,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:59:18,329 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:59:18,329 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:59:18,329 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:59:18,330 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:59:18,330 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 -> 308b0e1adc3ae7348985993203af7f0b3a83352e3d43ffbdb40ed727e63d4081 [2025-03-08 05:59:18,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:59:18,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:59:18,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:59:18,547 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:59:18,547 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:59:18,547 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c [2025-03-08 05:59:19,625 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b6e57fb0/5d849cb21dc44dd5b71aca27ab6b26fb/FLAG38b03e4cd [2025-03-08 05:59:19,849 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:59:19,849 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c [2025-03-08 05:59:19,856 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b6e57fb0/5d849cb21dc44dd5b71aca27ab6b26fb/FLAG38b03e4cd [2025-03-08 05:59:20,196 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b6e57fb0/5d849cb21dc44dd5b71aca27ab6b26fb [2025-03-08 05:59:20,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:59:20,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:59:20,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:59:20,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:59:20,203 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:59:20,204 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:59:20" (1/1) ... [2025-03-08 05:59:20,204 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f713cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:20, skipping insertion in model container [2025-03-08 05:59:20,204 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:59:20" (1/1) ... [2025-03-08 05:59:20,223 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:59:20,369 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_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c[9433,9446] [2025-03-08 05:59:20,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:59:20,379 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:59:20,421 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_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c[9433,9446] [2025-03-08 05:59:20,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:59:20,437 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:59:20,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:20 WrapperNode [2025-03-08 05:59:20,438 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:59:20,439 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:59:20,439 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:59:20,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:59:20,444 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:59:20" (1/1) ... [2025-03-08 05:59:20,451 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:59:20" (1/1) ... [2025-03-08 05:59:20,472 INFO L138 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 313 [2025-03-08 05:59:20,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:59:20,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:59:20,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:59:20,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:59:20,478 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:20" (1/1) ... [2025-03-08 05:59:20,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:20" (1/1) ... [2025-03-08 05:59:20,486 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:20" (1/1) ... [2025-03-08 05:59:20,503 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:59:20,503 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:20" (1/1) ... [2025-03-08 05:59:20,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:20" (1/1) ... [2025-03-08 05:59:20,508 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:20" (1/1) ... [2025-03-08 05:59:20,509 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:20" (1/1) ... [2025-03-08 05:59:20,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:20" (1/1) ... [2025-03-08 05:59:20,510 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:20" (1/1) ... [2025-03-08 05:59:20,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:59:20,513 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:59:20,513 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:59:20,513 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:59:20,516 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:20" (1/1) ... [2025-03-08 05:59:20,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:59:20,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:59:20,543 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:59:20,547 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:59:20,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:59:20,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:59:20,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:59:20,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:59:20,646 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:59:20,648 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:59:20,985 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-03-08 05:59:20,985 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:59:20,992 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:59:20,992 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:59:20,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:59:20 BoogieIcfgContainer [2025-03-08 05:59:20,993 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:59:20,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:59:20,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:59:20,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:59:20,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:59:20" (1/3) ... [2025-03-08 05:59:20,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6363b8b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:59:20, skipping insertion in model container [2025-03-08 05:59:20,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:20" (2/3) ... [2025-03-08 05:59:20,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6363b8b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:59:20, skipping insertion in model container [2025-03-08 05:59:20,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:59:20" (3/3) ... [2025-03-08 05:59:20,999 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c [2025-03-08 05:59:21,011 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:59:21,015 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c that has 1 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:59:21,061 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:59:21,069 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;@25f0a068, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:59:21,069 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:59:21,073 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 81 states have (on average 1.728395061728395) internal successors, (140), 82 states have internal predecessors, (140), 0 states have call successors, (0), 0 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:59:21,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 05:59:21,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:21,078 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] [2025-03-08 05:59:21,078 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:21,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:21,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1607638684, now seen corresponding path program 1 times [2025-03-08 05:59:21,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:21,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332857584] [2025-03-08 05:59:21,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:21,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:21,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 05:59:21,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 05:59:21,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:21,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:21,262 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:59:21,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:21,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332857584] [2025-03-08 05:59:21,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332857584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:21,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:21,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 05:59:21,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314425075] [2025-03-08 05:59:21,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:21,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 05:59:21,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:21,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 05:59:21,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:59:21,282 INFO L87 Difference]: Start difference. First operand has 83 states, 81 states have (on average 1.728395061728395) internal successors, (140), 82 states have internal predecessors, (140), 0 states have call successors, (0), 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 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 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:59:21,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:21,295 INFO L93 Difference]: Finished difference Result 137 states and 226 transitions. [2025-03-08 05:59:21,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 05:59:21,297 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-03-08 05:59:21,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:21,301 INFO L225 Difference]: With dead ends: 137 [2025-03-08 05:59:21,301 INFO L226 Difference]: Without dead ends: 80 [2025-03-08 05:59:21,303 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:59:21,304 INFO L435 NwaCegarLoop]: 138 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, 138 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:59:21,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:21,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-08 05:59:21,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-08 05:59:21,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.7088607594936709) internal successors, (135), 79 states have internal predecessors, (135), 0 states have call successors, (0), 0 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:59:21,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 135 transitions. [2025-03-08 05:59:21,328 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 135 transitions. Word has length 29 [2025-03-08 05:59:21,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:21,328 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 135 transitions. [2025-03-08 05:59:21,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 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:59:21,328 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 135 transitions. [2025-03-08 05:59:21,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 05:59:21,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:21,329 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] [2025-03-08 05:59:21,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:59:21,330 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:21,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:21,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1674645437, now seen corresponding path program 1 times [2025-03-08 05:59:21,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:21,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494471966] [2025-03-08 05:59:21,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:21,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:21,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 05:59:21,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 05:59:21,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:21,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:21,545 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:59:21,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:21,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494471966] [2025-03-08 05:59:21,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494471966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:21,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:21,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:59:21,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633492784] [2025-03-08 05:59:21,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:21,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:59:21,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:21,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:59:21,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:59:21,548 INFO L87 Difference]: Start difference. First operand 80 states and 135 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 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:59:21,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:21,625 INFO L93 Difference]: Finished difference Result 184 states and 301 transitions. [2025-03-08 05:59:21,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:59:21,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-03-08 05:59:21,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:21,627 INFO L225 Difference]: With dead ends: 184 [2025-03-08 05:59:21,627 INFO L226 Difference]: Without dead ends: 130 [2025-03-08 05:59:21,628 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:59:21,628 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 80 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:21,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 494 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:59:21,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-08 05:59:21,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 80. [2025-03-08 05:59:21,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:21,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 111 transitions. [2025-03-08 05:59:21,636 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 111 transitions. Word has length 29 [2025-03-08 05:59:21,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:21,636 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 111 transitions. [2025-03-08 05:59:21,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 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:59:21,636 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 111 transitions. [2025-03-08 05:59:21,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 05:59:21,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:21,637 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] [2025-03-08 05:59:21,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:59:21,637 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:21,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:21,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1404675940, now seen corresponding path program 1 times [2025-03-08 05:59:21,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:21,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438235071] [2025-03-08 05:59:21,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:21,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:21,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 05:59:21,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 05:59:21,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:21,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:21,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:21,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:21,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438235071] [2025-03-08 05:59:21,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438235071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:21,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:21,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:59:21,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878537084] [2025-03-08 05:59:21,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:21,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:59:21,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:21,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:59:21,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:21,741 INFO L87 Difference]: Start difference. First operand 80 states and 111 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 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:59:21,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:21,768 INFO L93 Difference]: Finished difference Result 172 states and 259 transitions. [2025-03-08 05:59:21,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:59:21,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-08 05:59:21,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:21,770 INFO L225 Difference]: With dead ends: 172 [2025-03-08 05:59:21,770 INFO L226 Difference]: Without dead ends: 122 [2025-03-08 05:59:21,770 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:59:21,771 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 69 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 252 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:59:21,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 252 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:21,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-08 05:59:21,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2025-03-08 05:59:21,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.4789915966386555) internal successors, (176), 119 states have internal predecessors, (176), 0 states have call successors, (0), 0 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:59:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2025-03-08 05:59:21,778 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 52 [2025-03-08 05:59:21,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:21,778 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2025-03-08 05:59:21,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 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:59:21,779 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2025-03-08 05:59:21,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 05:59:21,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:21,779 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] [2025-03-08 05:59:21,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:59:21,780 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:21,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:21,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1217827255, now seen corresponding path program 1 times [2025-03-08 05:59:21,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:21,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917816429] [2025-03-08 05:59:21,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:21,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:21,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 05:59:21,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 05:59:21,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:21,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:21,863 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:59:21,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:21,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917816429] [2025-03-08 05:59:21,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917816429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:21,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:21,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:59:21,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418880027] [2025-03-08 05:59:21,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:21,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:59:21,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:21,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:59:21,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:21,866 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 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:59:21,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:21,888 INFO L93 Difference]: Finished difference Result 284 states and 440 transitions. [2025-03-08 05:59:21,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:59:21,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-08 05:59:21,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:21,890 INFO L225 Difference]: With dead ends: 284 [2025-03-08 05:59:21,890 INFO L226 Difference]: Without dead ends: 194 [2025-03-08 05:59:21,890 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:59:21,893 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 65 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 249 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:59:21,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 249 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:21,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-08 05:59:21,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2025-03-08 05:59:21,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.5235602094240839) internal successors, (291), 191 states have internal predecessors, (291), 0 states have call successors, (0), 0 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:59:21,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 291 transitions. [2025-03-08 05:59:21,909 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 291 transitions. Word has length 52 [2025-03-08 05:59:21,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:21,909 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 291 transitions. [2025-03-08 05:59:21,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 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:59:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 291 transitions. [2025-03-08 05:59:21,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 05:59:21,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:21,909 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] [2025-03-08 05:59:21,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:59:21,910 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:21,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:21,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1028889994, now seen corresponding path program 1 times [2025-03-08 05:59:21,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:21,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813859726] [2025-03-08 05:59:21,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:21,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:21,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 05:59:21,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 05:59:21,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:21,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:22,062 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:59:22,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:22,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813859726] [2025-03-08 05:59:22,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813859726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:22,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:22,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:59:22,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823264693] [2025-03-08 05:59:22,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:22,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:59:22,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:22,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:59:22,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:59:22,064 INFO L87 Difference]: Start difference. First operand 192 states and 291 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 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:59:22,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:22,160 INFO L93 Difference]: Finished difference Result 1002 states and 1596 transitions. [2025-03-08 05:59:22,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:59:22,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-08 05:59:22,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:22,165 INFO L225 Difference]: With dead ends: 1002 [2025-03-08 05:59:22,165 INFO L226 Difference]: Without dead ends: 840 [2025-03-08 05:59:22,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:59:22,168 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 782 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:22,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 518 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:22,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2025-03-08 05:59:22,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 352. [2025-03-08 05:59:22,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 351 states have (on average 1.547008547008547) internal successors, (543), 351 states have internal predecessors, (543), 0 states have call successors, (0), 0 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:59:22,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 543 transitions. [2025-03-08 05:59:22,202 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 543 transitions. Word has length 52 [2025-03-08 05:59:22,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:22,202 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 543 transitions. [2025-03-08 05:59:22,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 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:59:22,203 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 543 transitions. [2025-03-08 05:59:22,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 05:59:22,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:22,203 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] [2025-03-08 05:59:22,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:59:22,203 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:22,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:22,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1801204530, now seen corresponding path program 1 times [2025-03-08 05:59:22,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:22,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272988690] [2025-03-08 05:59:22,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:22,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:22,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 05:59:22,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 05:59:22,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:22,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:22,432 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:59:22,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:22,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272988690] [2025-03-08 05:59:22,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272988690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:22,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:22,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:59:22,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553189965] [2025-03-08 05:59:22,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:22,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:59:22,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:22,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:59:22,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:59:22,433 INFO L87 Difference]: Start difference. First operand 352 states and 543 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:22,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:22,455 INFO L93 Difference]: Finished difference Result 378 states and 576 transitions. [2025-03-08 05:59:22,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:59:22,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-08 05:59:22,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:22,458 INFO L225 Difference]: With dead ends: 378 [2025-03-08 05:59:22,458 INFO L226 Difference]: Without dead ends: 376 [2025-03-08 05:59:22,459 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:59:22,459 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:22,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 424 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:22,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-08 05:59:22,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2025-03-08 05:59:22,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 375 states have (on average 1.512) internal successors, (567), 375 states have internal predecessors, (567), 0 states have call successors, (0), 0 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:59:22,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 567 transitions. [2025-03-08 05:59:22,477 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 567 transitions. Word has length 53 [2025-03-08 05:59:22,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:22,477 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 567 transitions. [2025-03-08 05:59:22,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:22,477 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 567 transitions. [2025-03-08 05:59:22,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 05:59:22,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:22,478 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] [2025-03-08 05:59:22,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:59:22,478 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:22,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:22,480 INFO L85 PathProgramCache]: Analyzing trace with hash 85953974, now seen corresponding path program 1 times [2025-03-08 05:59:22,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:22,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152189728] [2025-03-08 05:59:22,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:22,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:22,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 05:59:22,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 05:59:22,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:22,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:22,550 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:59:22,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:22,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152189728] [2025-03-08 05:59:22,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152189728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:22,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:22,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:59:22,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512665373] [2025-03-08 05:59:22,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:22,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:59:22,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:22,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:59:22,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:22,551 INFO L87 Difference]: Start difference. First operand 376 states and 567 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:59:22,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:22,573 INFO L93 Difference]: Finished difference Result 884 states and 1355 transitions. [2025-03-08 05:59:22,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:59:22,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-03-08 05:59:22,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:22,576 INFO L225 Difference]: With dead ends: 884 [2025-03-08 05:59:22,576 INFO L226 Difference]: Without dead ends: 538 [2025-03-08 05:59:22,576 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:59:22,577 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 50 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:22,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 197 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:22,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-03-08 05:59:22,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 536. [2025-03-08 05:59:22,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 1.519626168224299) internal successors, (813), 535 states have internal predecessors, (813), 0 states have call successors, (0), 0 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:59:22,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 813 transitions. [2025-03-08 05:59:22,593 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 813 transitions. Word has length 54 [2025-03-08 05:59:22,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:22,593 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 813 transitions. [2025-03-08 05:59:22,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:59:22,593 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 813 transitions. [2025-03-08 05:59:22,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 05:59:22,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:22,596 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] [2025-03-08 05:59:22,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:59:22,596 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:22,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:22,597 INFO L85 PathProgramCache]: Analyzing trace with hash -594926501, now seen corresponding path program 1 times [2025-03-08 05:59:22,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:22,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421247339] [2025-03-08 05:59:22,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:22,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:22,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 05:59:22,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 05:59:22,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:22,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:22,665 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:59:22,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:22,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421247339] [2025-03-08 05:59:22,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421247339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:22,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:22,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:59:22,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976069738] [2025-03-08 05:59:22,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:22,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:59:22,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:22,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:59:22,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:22,666 INFO L87 Difference]: Start difference. First operand 536 states and 813 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:22,693 INFO L93 Difference]: Finished difference Result 1448 states and 2207 transitions. [2025-03-08 05:59:22,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:59:22,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-08 05:59:22,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:22,697 INFO L225 Difference]: With dead ends: 1448 [2025-03-08 05:59:22,697 INFO L226 Difference]: Without dead ends: 944 [2025-03-08 05:59:22,698 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:59:22,698 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 57 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 233 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:59:22,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 233 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:22,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-03-08 05:59:22,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 942. [2025-03-08 05:59:22,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 941 states have (on average 1.5015940488841657) internal successors, (1413), 941 states have internal predecessors, (1413), 0 states have call successors, (0), 0 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:59:22,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1413 transitions. [2025-03-08 05:59:22,742 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1413 transitions. Word has length 55 [2025-03-08 05:59:22,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:22,742 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1413 transitions. [2025-03-08 05:59:22,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:22,742 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1413 transitions. [2025-03-08 05:59:22,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 05:59:22,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:22,746 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] [2025-03-08 05:59:22,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:59:22,746 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:22,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:22,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1753602391, now seen corresponding path program 1 times [2025-03-08 05:59:22,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:22,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851627377] [2025-03-08 05:59:22,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:22,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:22,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 05:59:22,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 05:59:22,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:22,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:22,809 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:59:22,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:22,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851627377] [2025-03-08 05:59:22,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851627377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:22,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:22,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:59:22,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46453944] [2025-03-08 05:59:22,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:22,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:59:22,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:22,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:59:22,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:22,812 INFO L87 Difference]: Start difference. First operand 942 states and 1413 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:22,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:22,848 INFO L93 Difference]: Finished difference Result 2570 states and 3839 transitions. [2025-03-08 05:59:22,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:59:22,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-08 05:59:22,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:22,853 INFO L225 Difference]: With dead ends: 2570 [2025-03-08 05:59:22,854 INFO L226 Difference]: Without dead ends: 1660 [2025-03-08 05:59:22,856 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:59:22,857 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 61 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 246 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:59:22,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 246 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:22,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2025-03-08 05:59:22,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1658. [2025-03-08 05:59:22,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1657 states have (on average 1.468316234158117) internal successors, (2433), 1657 states have internal predecessors, (2433), 0 states have call successors, (0), 0 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:59:22,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2433 transitions. [2025-03-08 05:59:22,902 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2433 transitions. Word has length 55 [2025-03-08 05:59:22,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:22,902 INFO L471 AbstractCegarLoop]: Abstraction has 1658 states and 2433 transitions. [2025-03-08 05:59:22,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:22,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2433 transitions. [2025-03-08 05:59:22,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:59:22,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:22,904 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] [2025-03-08 05:59:22,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:59:22,904 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:22,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:22,905 INFO L85 PathProgramCache]: Analyzing trace with hash -84435292, now seen corresponding path program 1 times [2025-03-08 05:59:22,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:22,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229205945] [2025-03-08 05:59:22,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:22,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:22,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:59:22,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:59:22,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:22,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:22,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:22,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229205945] [2025-03-08 05:59:22,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229205945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:22,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:22,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:59:22,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713083596] [2025-03-08 05:59:22,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:22,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:59:22,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:22,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:59:22,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:22,995 INFO L87 Difference]: Start difference. First operand 1658 states and 2433 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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:59:23,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:23,028 INFO L93 Difference]: Finished difference Result 3286 states and 4835 transitions. [2025-03-08 05:59:23,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:59:23,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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:59:23,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:23,033 INFO L225 Difference]: With dead ends: 3286 [2025-03-08 05:59:23,034 INFO L226 Difference]: Without dead ends: 1660 [2025-03-08 05:59:23,036 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:59:23,036 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 54 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:23,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 237 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:23,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2025-03-08 05:59:23,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1658. [2025-03-08 05:59:23,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1657 states have (on average 1.4538322269161135) internal successors, (2409), 1657 states have internal predecessors, (2409), 0 states have call successors, (0), 0 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:59:23,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2409 transitions. [2025-03-08 05:59:23,091 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2409 transitions. Word has length 77 [2025-03-08 05:59:23,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:23,091 INFO L471 AbstractCegarLoop]: Abstraction has 1658 states and 2409 transitions. [2025-03-08 05:59:23,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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:59:23,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2409 transitions. [2025-03-08 05:59:23,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:59:23,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:23,092 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] [2025-03-08 05:59:23,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:59:23,093 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:23,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:23,093 INFO L85 PathProgramCache]: Analyzing trace with hash -384072905, now seen corresponding path program 1 times [2025-03-08 05:59:23,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:23,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776686952] [2025-03-08 05:59:23,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:23,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:23,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:59:23,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:59:23,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:23,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:23,172 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:23,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:23,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776686952] [2025-03-08 05:59:23,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776686952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:23,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:23,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:59:23,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861111008] [2025-03-08 05:59:23,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:23,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:59:23,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:23,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:59:23,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:23,174 INFO L87 Difference]: Start difference. First operand 1658 states and 2409 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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:59:23,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:23,197 INFO L93 Difference]: Finished difference Result 2474 states and 3599 transitions. [2025-03-08 05:59:23,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:59:23,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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:59:23,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:23,201 INFO L225 Difference]: With dead ends: 2474 [2025-03-08 05:59:23,201 INFO L226 Difference]: Without dead ends: 848 [2025-03-08 05:59:23,202 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:59:23,203 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 48 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:23,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 218 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:23,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2025-03-08 05:59:23,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 846. [2025-03-08 05:59:23,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 845 states have (on average 1.4307692307692308) internal successors, (1209), 845 states have internal predecessors, (1209), 0 states have call successors, (0), 0 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:59:23,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1209 transitions. [2025-03-08 05:59:23,221 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1209 transitions. Word has length 77 [2025-03-08 05:59:23,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:23,221 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 1209 transitions. [2025-03-08 05:59:23,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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:59:23,221 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1209 transitions. [2025-03-08 05:59:23,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:59:23,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:23,222 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:23,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:59:23,222 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:23,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:23,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1003050678, now seen corresponding path program 1 times [2025-03-08 05:59:23,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:23,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386418851] [2025-03-08 05:59:23,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:23,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:23,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:59:23,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:59:23,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:23,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:23,570 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:23,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:23,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386418851] [2025-03-08 05:59:23,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386418851] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:59:23,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913222141] [2025-03-08 05:59:23,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:23,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:59:23,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:59:23,572 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:59:23,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:59:23,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:59:23,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:59:23,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:23,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:23,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 05:59:23,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:59:24,092 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:24,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:59:24,600 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:24,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913222141] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:59:24,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:59:24,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 8] total 20 [2025-03-08 05:59:24,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965530320] [2025-03-08 05:59:24,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:59:24,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 05:59:24,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:24,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 05:59:24,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:59:24,602 INFO L87 Difference]: Start difference. First operand 846 states and 1209 transitions. Second operand has 20 states, 20 states have (on average 11.2) internal successors, (224), 20 states have internal predecessors, (224), 0 states have call successors, (0), 0 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:59:29,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:29,295 INFO L93 Difference]: Finished difference Result 8314 states and 11889 transitions. [2025-03-08 05:59:29,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2025-03-08 05:59:29,295 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 11.2) internal successors, (224), 20 states have internal predecessors, (224), 0 states have call successors, (0), 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:59:29,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:29,318 INFO L225 Difference]: With dead ends: 8314 [2025-03-08 05:59:29,318 INFO L226 Difference]: Without dead ends: 7752 [2025-03-08 05:59:29,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8800 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3244, Invalid=19106, Unknown=0, NotChecked=0, Total=22350 [2025-03-08 05:59:29,327 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 3029 mSDsluCounter, 1821 mSDsCounter, 0 mSdLazyCounter, 1757 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3029 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 1815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:29,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3029 Valid, 1976 Invalid, 1815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1757 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 05:59:29,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7752 states. [2025-03-08 05:59:29,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7752 to 6814. [2025-03-08 05:59:29,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6814 states, 6813 states have (on average 1.4180243651842066) internal successors, (9661), 6813 states have internal predecessors, (9661), 0 states have call successors, (0), 0 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:59:29,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6814 states to 6814 states and 9661 transitions. [2025-03-08 05:59:29,473 INFO L78 Accepts]: Start accepts. Automaton has 6814 states and 9661 transitions. Word has length 77 [2025-03-08 05:59:29,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:29,473 INFO L471 AbstractCegarLoop]: Abstraction has 6814 states and 9661 transitions. [2025-03-08 05:59:29,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.2) internal successors, (224), 20 states have internal predecessors, (224), 0 states have call successors, (0), 0 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:59:29,474 INFO L276 IsEmpty]: Start isEmpty. Operand 6814 states and 9661 transitions. [2025-03-08 05:59:29,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 05:59:29,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:29,478 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:59:29,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:59:29,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 05:59:29,682 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:29,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:29,683 INFO L85 PathProgramCache]: Analyzing trace with hash 7678710, now seen corresponding path program 1 times [2025-03-08 05:59:29,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:29,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450173593] [2025-03-08 05:59:29,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:29,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:29,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 05:59:29,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 05:59:29,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:29,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:29,780 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 05:59:29,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:29,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450173593] [2025-03-08 05:59:29,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450173593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:29,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:29,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:59:29,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383933097] [2025-03-08 05:59:29,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:29,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:59:29,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:29,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:59:29,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:59:29,782 INFO L87 Difference]: Start difference. First operand 6814 states and 9661 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 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:59:29,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:29,993 INFO L93 Difference]: Finished difference Result 20052 states and 28610 transitions. [2025-03-08 05:59:29,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:59:29,994 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 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 78 [2025-03-08 05:59:29,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:30,037 INFO L225 Difference]: With dead ends: 20052 [2025-03-08 05:59:30,037 INFO L226 Difference]: Without dead ends: 17004 [2025-03-08 05:59:30,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:59:30,045 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 446 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:30,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 764 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:30,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17004 states. [2025-03-08 05:59:30,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17004 to 9856. [2025-03-08 05:59:30,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9856 states, 9855 states have (on average 1.4119736174530695) internal successors, (13915), 9855 states have internal predecessors, (13915), 0 states have call successors, (0), 0 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:59:30,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9856 states to 9856 states and 13915 transitions. [2025-03-08 05:59:30,313 INFO L78 Accepts]: Start accepts. Automaton has 9856 states and 13915 transitions. Word has length 78 [2025-03-08 05:59:30,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:30,313 INFO L471 AbstractCegarLoop]: Abstraction has 9856 states and 13915 transitions. [2025-03-08 05:59:30,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 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:59:30,313 INFO L276 IsEmpty]: Start isEmpty. Operand 9856 states and 13915 transitions. [2025-03-08 05:59:30,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 05:59:30,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:30,314 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:59:30,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:59:30,315 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:30,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:30,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1961866539, now seen corresponding path program 1 times [2025-03-08 05:59:30,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:30,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509785143] [2025-03-08 05:59:30,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:30,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:30,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 05:59:30,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 05:59:30,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:30,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:30,436 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:59:30,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:30,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509785143] [2025-03-08 05:59:30,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509785143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:30,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:30,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:59:30,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164491024] [2025-03-08 05:59:30,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:30,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:59:30,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:30,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:59:30,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:59:30,438 INFO L87 Difference]: Start difference. First operand 9856 states and 13915 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 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:59:30,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:30,780 INFO L93 Difference]: Finished difference Result 23588 states and 33586 transitions. [2025-03-08 05:59:30,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:59:30,782 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 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:59:30,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:30,812 INFO L225 Difference]: With dead ends: 23588 [2025-03-08 05:59:30,812 INFO L226 Difference]: Without dead ends: 20016 [2025-03-08 05:59:30,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:59:30,818 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 450 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:30,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 699 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:30,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20016 states. [2025-03-08 05:59:31,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20016 to 13192. [2025-03-08 05:59:31,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13192 states, 13191 states have (on average 1.4098248806004094) internal successors, (18597), 13191 states have internal predecessors, (18597), 0 states have call successors, (0), 0 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:59:31,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13192 states to 13192 states and 18597 transitions. [2025-03-08 05:59:31,108 INFO L78 Accepts]: Start accepts. Automaton has 13192 states and 18597 transitions. Word has length 78 [2025-03-08 05:59:31,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:31,109 INFO L471 AbstractCegarLoop]: Abstraction has 13192 states and 18597 transitions. [2025-03-08 05:59:31,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 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:59:31,109 INFO L276 IsEmpty]: Start isEmpty. Operand 13192 states and 18597 transitions. [2025-03-08 05:59:31,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 05:59:31,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:31,110 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:59:31,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:59:31,110 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:31,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:31,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1572916863, now seen corresponding path program 1 times [2025-03-08 05:59:31,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:31,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87483218] [2025-03-08 05:59:31,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:31,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:31,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 05:59:31,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 05:59:31,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:31,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:31,212 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:59:31,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:31,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87483218] [2025-03-08 05:59:31,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87483218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:31,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:31,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:59:31,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683274483] [2025-03-08 05:59:31,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:31,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:59:31,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:31,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:59:31,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:59:31,214 INFO L87 Difference]: Start difference. First operand 13192 states and 18597 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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:59:31,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:31,538 INFO L93 Difference]: Finished difference Result 26924 states and 38268 transitions. [2025-03-08 05:59:31,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:59:31,542 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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 78 [2025-03-08 05:59:31,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:31,586 INFO L225 Difference]: With dead ends: 26924 [2025-03-08 05:59:31,586 INFO L226 Difference]: Without dead ends: 23352 [2025-03-08 05:59:31,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:59:31,595 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 509 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:31,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 665 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:31,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23352 states. [2025-03-08 05:59:32,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23352 to 16528. [2025-03-08 05:59:32,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16528 states, 16527 states have (on average 1.4085435953288559) internal successors, (23279), 16527 states have internal predecessors, (23279), 0 states have call successors, (0), 0 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:59:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16528 states to 16528 states and 23279 transitions. [2025-03-08 05:59:32,063 INFO L78 Accepts]: Start accepts. Automaton has 16528 states and 23279 transitions. Word has length 78 [2025-03-08 05:59:32,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:32,063 INFO L471 AbstractCegarLoop]: Abstraction has 16528 states and 23279 transitions. [2025-03-08 05:59:32,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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:59:32,064 INFO L276 IsEmpty]: Start isEmpty. Operand 16528 states and 23279 transitions. [2025-03-08 05:59:32,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 05:59:32,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:32,065 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:59:32,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:59:32,066 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:32,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:32,066 INFO L85 PathProgramCache]: Analyzing trace with hash 2145668653, now seen corresponding path program 1 times [2025-03-08 05:59:32,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:32,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751915232] [2025-03-08 05:59:32,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:32,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:32,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 05:59:32,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 05:59:32,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:32,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:59:32,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:32,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751915232] [2025-03-08 05:59:32,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751915232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:32,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:32,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:59:32,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962824006] [2025-03-08 05:59:32,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:32,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:59:32,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:32,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:59:32,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:59:32,180 INFO L87 Difference]: Start difference. First operand 16528 states and 23279 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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:59:32,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:32,641 INFO L93 Difference]: Finished difference Result 30260 states and 42950 transitions. [2025-03-08 05:59:32,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:59:32,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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 78 [2025-03-08 05:59:32,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:32,689 INFO L225 Difference]: With dead ends: 30260 [2025-03-08 05:59:32,689 INFO L226 Difference]: Without dead ends: 26688 [2025-03-08 05:59:32,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:59:32,698 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 472 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:32,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 725 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:32,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26688 states. [2025-03-08 05:59:33,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26688 to 19864. [2025-03-08 05:59:33,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19864 states, 19863 states have (on average 1.4076926949604793) internal successors, (27961), 19863 states have internal predecessors, (27961), 0 states have call successors, (0), 0 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:59:33,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19864 states to 19864 states and 27961 transitions. [2025-03-08 05:59:33,162 INFO L78 Accepts]: Start accepts. Automaton has 19864 states and 27961 transitions. Word has length 78 [2025-03-08 05:59:33,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:33,163 INFO L471 AbstractCegarLoop]: Abstraction has 19864 states and 27961 transitions. [2025-03-08 05:59:33,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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:59:33,163 INFO L276 IsEmpty]: Start isEmpty. Operand 19864 states and 27961 transitions. [2025-03-08 05:59:33,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 05:59:33,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:33,164 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:59:33,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:59:33,164 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:33,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:33,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1204350006, now seen corresponding path program 1 times [2025-03-08 05:59:33,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:33,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406349865] [2025-03-08 05:59:33,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:33,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:33,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 05:59:33,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 05:59:33,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:33,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:33,471 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:33,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:33,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406349865] [2025-03-08 05:59:33,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406349865] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:59:33,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776850349] [2025-03-08 05:59:33,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:33,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:59:33,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:59:33,474 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:59:33,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:59:33,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 05:59:33,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 05:59:33,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:33,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:33,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 05:59:33,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:59:34,060 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:34,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:59:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:35,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776850349] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:59:35,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:59:35,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 30 [2025-03-08 05:59:35,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707027888] [2025-03-08 05:59:35,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:59:35,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 05:59:35,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:35,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 05:59:35,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2025-03-08 05:59:35,498 INFO L87 Difference]: Start difference. First operand 19864 states and 27961 transitions. Second operand has 30 states, 30 states have (on average 6.966666666666667) internal successors, (209), 30 states have internal predecessors, (209), 0 states have call successors, (0), 0 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:59:45,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:45,476 INFO L93 Difference]: Finished difference Result 235424 states and 330370 transitions. [2025-03-08 05:59:45,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2025-03-08 05:59:45,476 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 6.966666666666667) internal successors, (209), 30 states have internal predecessors, (209), 0 states have call successors, (0), 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 81 [2025-03-08 05:59:45,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:45,792 INFO L225 Difference]: With dead ends: 235424 [2025-03-08 05:59:45,792 INFO L226 Difference]: Without dead ends: 215592 [2025-03-08 05:59:45,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13711 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=5328, Invalid=27978, Unknown=0, NotChecked=0, Total=33306 [2025-03-08 05:59:45,838 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 7969 mSDsluCounter, 2038 mSDsCounter, 0 mSdLazyCounter, 2565 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7969 SdHoareTripleChecker+Valid, 2136 SdHoareTripleChecker+Invalid, 2696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 2565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:45,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7969 Valid, 2136 Invalid, 2696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 2565 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 05:59:45,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215592 states. [2025-03-08 05:59:48,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215592 to 78261. [2025-03-08 05:59:48,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78261 states, 78260 states have (on average 1.3870559672885254) internal successors, (108551), 78260 states have internal predecessors, (108551), 0 states have call successors, (0), 0 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:59:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78261 states to 78261 states and 108551 transitions. [2025-03-08 05:59:48,661 INFO L78 Accepts]: Start accepts. Automaton has 78261 states and 108551 transitions. Word has length 81 [2025-03-08 05:59:48,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:48,662 INFO L471 AbstractCegarLoop]: Abstraction has 78261 states and 108551 transitions. [2025-03-08 05:59:48,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.966666666666667) internal successors, (209), 30 states have internal predecessors, (209), 0 states have call successors, (0), 0 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:59:48,662 INFO L276 IsEmpty]: Start isEmpty. Operand 78261 states and 108551 transitions. [2025-03-08 05:59:48,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 05:59:48,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:48,664 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:59:48,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 05:59:48,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 05:59:48,865 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:48,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:48,865 INFO L85 PathProgramCache]: Analyzing trace with hash 419017379, now seen corresponding path program 1 times [2025-03-08 05:59:48,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:48,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872131255] [2025-03-08 05:59:48,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:48,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:48,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 05:59:48,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 05:59:48,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:48,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:48,937 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:59:48,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:48,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872131255] [2025-03-08 05:59:48,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872131255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:48,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:48,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:59:48,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147174071] [2025-03-08 05:59:48,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:48,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:59:48,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:48,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:59:48,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:48,939 INFO L87 Difference]: Start difference. First operand 78261 states and 108551 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 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:59:49,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:49,790 INFO L93 Difference]: Finished difference Result 100616 states and 138920 transitions. [2025-03-08 05:59:49,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:59:49,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-08 05:59:49,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:49,824 INFO L225 Difference]: With dead ends: 100616 [2025-03-08 05:59:49,824 INFO L226 Difference]: Without dead ends: 22387 [2025-03-08 05:59:49,875 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:59:49,875 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 34 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:49,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 211 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:49,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22387 states. [2025-03-08 05:59:50,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22387 to 19925. [2025-03-08 05:59:50,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19925 states, 19924 states have (on average 1.358060630395503) internal successors, (27058), 19924 states have internal predecessors, (27058), 0 states have call successors, (0), 0 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:59:50,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19925 states to 19925 states and 27058 transitions. [2025-03-08 05:59:50,583 INFO L78 Accepts]: Start accepts. Automaton has 19925 states and 27058 transitions. Word has length 81 [2025-03-08 05:59:50,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:50,583 INFO L471 AbstractCegarLoop]: Abstraction has 19925 states and 27058 transitions. [2025-03-08 05:59:50,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 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:59:50,583 INFO L276 IsEmpty]: Start isEmpty. Operand 19925 states and 27058 transitions. [2025-03-08 05:59:50,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 05:59:50,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:50,584 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:59:50,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:59:50,585 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:50,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:50,585 INFO L85 PathProgramCache]: Analyzing trace with hash -558502801, now seen corresponding path program 1 times [2025-03-08 05:59:50,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:50,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559869536] [2025-03-08 05:59:50,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:50,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:50,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 05:59:50,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 05:59:50,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:50,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:50,958 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:50,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:50,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559869536] [2025-03-08 05:59:50,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559869536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:59:50,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503260483] [2025-03-08 05:59:50,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:50,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:59:50,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:59:50,961 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:59:50,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:59:51,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 05:59:51,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 05:59:51,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:51,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:51,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 05:59:51,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:59:51,570 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:51,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:59:52,525 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:52,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503260483] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:59:52,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:59:52,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2025-03-08 05:59:52,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881460839] [2025-03-08 05:59:52,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:59:52,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 05:59:52,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:52,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 05:59:52,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=668, Unknown=0, NotChecked=0, Total=812 [2025-03-08 05:59:52,526 INFO L87 Difference]: Start difference. First operand 19925 states and 27058 transitions. Second operand has 29 states, 29 states have (on average 7.827586206896552) internal successors, (227), 29 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:54,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:54,956 INFO L93 Difference]: Finished difference Result 118612 states and 160848 transitions. [2025-03-08 05:59:54,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 05:59:54,957 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.827586206896552) internal successors, (227), 29 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-08 05:59:54,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:55,071 INFO L225 Difference]: With dead ends: 118612 [2025-03-08 05:59:55,072 INFO L226 Difference]: Without dead ends: 98736 [2025-03-08 05:59:55,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=661, Invalid=2419, Unknown=0, NotChecked=0, Total=3080 [2025-03-08 05:59:55,100 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 1539 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1539 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:55,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1539 Valid, 1373 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:59:55,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98736 states. [2025-03-08 05:59:57,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98736 to 95117. [2025-03-08 05:59:57,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95117 states, 95116 states have (on average 1.3430127423356744) internal successors, (127742), 95116 states have internal predecessors, (127742), 0 states have call successors, (0), 0 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:59:57,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95117 states to 95117 states and 127742 transitions. [2025-03-08 05:59:57,456 INFO L78 Accepts]: Start accepts. Automaton has 95117 states and 127742 transitions. Word has length 82 [2025-03-08 05:59:57,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:57,457 INFO L471 AbstractCegarLoop]: Abstraction has 95117 states and 127742 transitions. [2025-03-08 05:59:57,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.827586206896552) internal successors, (227), 29 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:57,457 INFO L276 IsEmpty]: Start isEmpty. Operand 95117 states and 127742 transitions. [2025-03-08 05:59:57,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 05:59:57,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:57,458 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:59:57,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 05:59:57,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:59:57,659 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:57,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:57,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1756851473, now seen corresponding path program 1 times [2025-03-08 05:59:57,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:57,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322363588] [2025-03-08 05:59:57,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:57,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:57,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 05:59:57,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 05:59:57,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:57,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:57,694 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:57,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:57,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322363588] [2025-03-08 05:59:57,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322363588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:57,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:57,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:59:57,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150523188] [2025-03-08 05:59:57,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:57,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:59:57,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:57,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:59:57,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:57,696 INFO L87 Difference]: Start difference. First operand 95117 states and 127742 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 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 06:00:00,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:00,486 INFO L93 Difference]: Finished difference Result 229159 states and 308942 transitions. [2025-03-08 06:00:00,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:00:00,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-03-08 06:00:00,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:00,661 INFO L225 Difference]: With dead ends: 229159 [2025-03-08 06:00:00,661 INFO L226 Difference]: Without dead ends: 134443 [2025-03-08 06:00:00,716 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 06:00:00,717 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 47 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:00,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 255 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:00:00,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134443 states. [2025-03-08 06:00:04,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134443 to 122826. [2025-03-08 06:00:04,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122826 states, 122825 states have (on average 1.3355994300834522) internal successors, (164045), 122825 states have internal predecessors, (164045), 0 states have call successors, (0), 0 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 06:00:04,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122826 states to 122826 states and 164045 transitions. [2025-03-08 06:00:04,963 INFO L78 Accepts]: Start accepts. Automaton has 122826 states and 164045 transitions. Word has length 82 [2025-03-08 06:00:04,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:04,963 INFO L471 AbstractCegarLoop]: Abstraction has 122826 states and 164045 transitions. [2025-03-08 06:00:04,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 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 06:00:04,963 INFO L276 IsEmpty]: Start isEmpty. Operand 122826 states and 164045 transitions. [2025-03-08 06:00:04,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 06:00:04,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:04,966 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:00:04,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 06:00:04,966 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:04,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:04,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1510525985, now seen corresponding path program 1 times [2025-03-08 06:00:04,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:04,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539449806] [2025-03-08 06:00:04,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:04,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:04,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 06:00:04,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 06:00:04,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:04,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:05,000 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:05,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:05,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539449806] [2025-03-08 06:00:05,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539449806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:05,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:05,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:00:05,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346538561] [2025-03-08 06:00:05,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:05,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:00:05,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:05,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:00:05,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:00:05,002 INFO L87 Difference]: Start difference. First operand 122826 states and 164045 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)