./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 1936862b5856707e80b1aa2b38aa8e033b3615fe51a16f40b8e11843db1147ca --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:19:18,302 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:19:18,382 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:19:18,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:19:18,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:19:18,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:19:18,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:19:18,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:19:18,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:19:18,421 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:19:18,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:19:18,422 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:19:18,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:19:18,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:19:18,423 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:19:18,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:19:18,423 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:19:18,423 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:19:18,423 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:19:18,423 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:19:18,423 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:19:18,423 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:19:18,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:19:18,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:19:18,424 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:19:18,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:19:18,424 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:19:18,424 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:19:18,424 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:19:18,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:19:18,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:19:18,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:19:18,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:19:18,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:19:18,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:19:18,424 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:19:18,424 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:19:18,424 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:19:18,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:19:18,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:19:18,425 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:19:18,425 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:19:18,425 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:19:18,425 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-jdk21/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 -> 1936862b5856707e80b1aa2b38aa8e033b3615fe51a16f40b8e11843db1147ca [2025-02-05 16:19:18,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:19:18,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:19:18,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:19:18,747 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:19:18,747 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:19:18,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c [2025-02-05 16:19:20,142 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ccf57d4e8/65ac0cfa135f48688c5da0c1506718cd/FLAG54f70af7e [2025-02-05 16:19:20,539 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:19:20,543 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c [2025-02-05 16:19:20,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ccf57d4e8/65ac0cfa135f48688c5da0c1506718cd/FLAG54f70af7e [2025-02-05 16:19:20,719 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ccf57d4e8/65ac0cfa135f48688c5da0c1506718cd [2025-02-05 16:19:20,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:19:20,723 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:19:20,724 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:19:20,725 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:19:20,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:19:20,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:19:20" (1/1) ... [2025-02-05 16:19:20,730 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76530039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:19:20, skipping insertion in model container [2025-02-05 16:19:20,730 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:19:20" (1/1) ... [2025-02-05 16:19:20,774 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:19:21,076 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c[30998,31011] [2025-02-05 16:19:21,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:19:21,092 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:19:21,186 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c[30998,31011] [2025-02-05 16:19:21,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:19:21,204 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:19:21,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:19:21 WrapperNode [2025-02-05 16:19:21,206 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:19:21,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:19:21,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:19:21,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:19:21,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:19:21" (1/1) ... [2025-02-05 16:19:21,239 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:19:21" (1/1) ... [2025-02-05 16:19:21,282 INFO L138 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 1019 [2025-02-05 16:19:21,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:19:21,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:19:21,285 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:19:21,285 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:19:21,306 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:19:21" (1/1) ... [2025-02-05 16:19:21,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:19:21" (1/1) ... [2025-02-05 16:19:21,314 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:19:21" (1/1) ... [2025-02-05 16:19:21,362 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-02-05 16:19:21,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:19:21" (1/1) ... [2025-02-05 16:19:21,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:19:21" (1/1) ... [2025-02-05 16:19:21,376 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:19:21" (1/1) ... [2025-02-05 16:19:21,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:19:21" (1/1) ... [2025-02-05 16:19:21,386 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:19:21" (1/1) ... [2025-02-05 16:19:21,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:19:21" (1/1) ... [2025-02-05 16:19:21,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:19:21,416 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:19:21,418 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:19:21,419 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:19:21,423 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:19:21" (1/1) ... [2025-02-05 16:19:21,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:19:21,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:19:21,495 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:19:21,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:19:21,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:19:21,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:19:21,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:19:21,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:19:21,808 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:19:21,810 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:19:23,293 INFO L? ?]: Removed 115 outVars from TransFormulas that were not future-live. [2025-02-05 16:19:23,294 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:19:23,315 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:19:23,318 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:19:23,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:19:23 BoogieIcfgContainer [2025-02-05 16:19:23,319 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:19:23,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:19:23,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:19:23,325 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:19:23,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:19:20" (1/3) ... [2025-02-05 16:19:23,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dad4a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:19:23, skipping insertion in model container [2025-02-05 16:19:23,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:19:21" (2/3) ... [2025-02-05 16:19:23,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dad4a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:19:23, skipping insertion in model container [2025-02-05 16:19:23,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:19:23" (3/3) ... [2025-02-05 16:19:23,329 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c [2025-02-05 16:19:23,344 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:19:23,348 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c that has 1 procedures, 299 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 16:19:23,419 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:19:23,432 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;@65eb35ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:19:23,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:19:23,437 INFO L276 IsEmpty]: Start isEmpty. Operand has 299 states, 297 states have (on average 1.8316498316498318) internal successors, (544), 298 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:19:23,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:19:23,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:19:23,453 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:19:23,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:19:23,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:19:23,459 INFO L85 PathProgramCache]: Analyzing trace with hash 833882801, now seen corresponding path program 1 times [2025-02-05 16:19:23,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:19:23,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831406011] [2025-02-05 16:19:23,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:19:23,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:19:23,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:19:23,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:19:23,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:19:23,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:19:24,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:19:24,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:19:24,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831406011] [2025-02-05 16:19:24,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831406011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:19:24,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:19:24,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 16:19:24,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626175426] [2025-02-05 16:19:24,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:19:24,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 16:19:24,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:19:24,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 16:19:24,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:19:24,045 INFO L87 Difference]: Start difference. First operand has 299 states, 297 states have (on average 1.8316498316498318) internal successors, (544), 298 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 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-02-05 16:19:24,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:19:24,082 INFO L93 Difference]: Finished difference Result 403 states and 726 transitions. [2025-02-05 16:19:24,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 16:19:24,084 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 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-02-05 16:19:24,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:19:24,092 INFO L225 Difference]: With dead ends: 403 [2025-02-05 16:19:24,093 INFO L226 Difference]: Without dead ends: 296 [2025-02-05 16:19:24,095 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-02-05 16:19:24,098 INFO L435 NwaCegarLoop]: 542 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, 542 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-02-05 16:19:24,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:19:24,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-02-05 16:19:24,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-02-05 16:19:24,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 1.8271186440677967) internal successors, (539), 295 states have internal predecessors, (539), 0 states have call successors, (0), 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-02-05 16:19:24,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 539 transitions. [2025-02-05 16:19:24,143 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 539 transitions. Word has length 77 [2025-02-05 16:19:24,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:19:24,143 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 539 transitions. [2025-02-05 16:19:24,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 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-02-05 16:19:24,143 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 539 transitions. [2025-02-05 16:19:24,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:19:24,146 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:19:24,146 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:19:24,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:19:24,147 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:19:24,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:19:24,148 INFO L85 PathProgramCache]: Analyzing trace with hash 766876048, now seen corresponding path program 1 times [2025-02-05 16:19:24,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:19:24,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573128881] [2025-02-05 16:19:24,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:19:24,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:19:24,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:19:24,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:19:24,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:19:24,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:19:24,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:19:24,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:19:24,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573128881] [2025-02-05 16:19:24,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573128881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:19:24,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:19:24,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:19:24,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283638316] [2025-02-05 16:19:24,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:19:24,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:19:24,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:19:24,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:19:24,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:19:24,717 INFO L87 Difference]: Start difference. First operand 296 states and 539 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:19:24,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:19:24,858 INFO L93 Difference]: Finished difference Result 400 states and 720 transitions. [2025-02-05 16:19:24,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:19:24,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 16:19:24,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:19:24,862 INFO L225 Difference]: With dead ends: 400 [2025-02-05 16:19:24,862 INFO L226 Difference]: Without dead ends: 296 [2025-02-05 16:19:24,863 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-02-05 16:19:24,864 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 0 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2097 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:19:24,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2097 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:19:24,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-02-05 16:19:24,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-02-05 16:19:24,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 1.6711864406779662) internal successors, (493), 295 states have internal predecessors, (493), 0 states have call successors, (0), 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-02-05 16:19:24,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 493 transitions. [2025-02-05 16:19:24,887 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 493 transitions. Word has length 77 [2025-02-05 16:19:24,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:19:24,887 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 493 transitions. [2025-02-05 16:19:24,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:19:24,887 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 493 transitions. [2025-02-05 16:19:24,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 16:19:24,890 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:19:24,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:19:24,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:19:24,891 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:19:24,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:19:24,891 INFO L85 PathProgramCache]: Analyzing trace with hash 897756116, now seen corresponding path program 1 times [2025-02-05 16:19:24,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:19:24,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757456727] [2025-02-05 16:19:24,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:19:24,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:19:24,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 16:19:25,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 16:19:25,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:19:25,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:19:25,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:19:25,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:19:25,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757456727] [2025-02-05 16:19:25,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757456727] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:19:25,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:19:25,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:19:25,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85781393] [2025-02-05 16:19:25,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:19:25,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:19:25,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:19:25,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:19:25,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:19:25,230 INFO L87 Difference]: Start difference. First operand 296 states and 493 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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-02-05 16:19:25,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:19:25,293 INFO L93 Difference]: Finished difference Result 484 states and 825 transitions. [2025-02-05 16:19:25,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:19:25,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2025-02-05 16:19:25,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:19:25,297 INFO L225 Difference]: With dead ends: 484 [2025-02-05 16:19:25,297 INFO L226 Difference]: Without dead ends: 384 [2025-02-05 16:19:25,298 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-02-05 16:19:25,299 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 147 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:19:25,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 930 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:19:25,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-02-05 16:19:25,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 382. [2025-02-05 16:19:25,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 1.68503937007874) internal successors, (642), 381 states have internal predecessors, (642), 0 states have call successors, (0), 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-02-05 16:19:25,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 642 transitions. [2025-02-05 16:19:25,326 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 642 transitions. Word has length 122 [2025-02-05 16:19:25,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:19:25,327 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 642 transitions. [2025-02-05 16:19:25,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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-02-05 16:19:25,327 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 642 transitions. [2025-02-05 16:19:25,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 16:19:25,329 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:19:25,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:19:25,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:19:25,329 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:19:25,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:19:25,330 INFO L85 PathProgramCache]: Analyzing trace with hash -242506133, now seen corresponding path program 1 times [2025-02-05 16:19:25,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:19:25,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282041609] [2025-02-05 16:19:25,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:19:25,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:19:25,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 16:19:25,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 16:19:25,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:19:25,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:19:25,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:19:25,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:19:25,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282041609] [2025-02-05 16:19:25,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282041609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:19:25,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:19:25,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:19:25,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845930792] [2025-02-05 16:19:25,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:19:25,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:19:25,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:19:25,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:19:25,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:19:25,549 INFO L87 Difference]: Start difference. First operand 382 states and 642 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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-02-05 16:19:25,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:19:25,629 INFO L93 Difference]: Finished difference Result 734 states and 1258 transitions. [2025-02-05 16:19:25,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:19:25,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-02-05 16:19:25,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:19:25,633 INFO L225 Difference]: With dead ends: 734 [2025-02-05 16:19:25,633 INFO L226 Difference]: Without dead ends: 548 [2025-02-05 16:19:25,634 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-02-05 16:19:25,637 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 148 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:19:25,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 938 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:19:25,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-02-05 16:19:25,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 546. [2025-02-05 16:19:25,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 1.7045871559633028) internal successors, (929), 545 states have internal predecessors, (929), 0 states have call successors, (0), 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-02-05 16:19:25,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 929 transitions. [2025-02-05 16:19:25,665 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 929 transitions. Word has length 125 [2025-02-05 16:19:25,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:19:25,666 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 929 transitions. [2025-02-05 16:19:25,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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-02-05 16:19:25,668 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 929 transitions. [2025-02-05 16:19:25,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 16:19:25,670 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:19:25,670 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:19:25,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:19:25,671 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:19:25,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:19:25,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1946019245, now seen corresponding path program 1 times [2025-02-05 16:19:25,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:19:25,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573091912] [2025-02-05 16:19:25,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:19:25,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:19:25,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 16:19:25,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 16:19:25,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:19:25,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:19:25,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:19:25,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:19:25,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573091912] [2025-02-05 16:19:25,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573091912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:19:25,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:19:25,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:19:25,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247122867] [2025-02-05 16:19:25,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:19:25,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:19:25,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:19:25,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:19:25,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:19:25,923 INFO L87 Difference]: Start difference. First operand 546 states and 929 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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-02-05 16:19:25,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:19:25,975 INFO L93 Difference]: Finished difference Result 1206 states and 2083 transitions. [2025-02-05 16:19:25,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:19:25,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2025-02-05 16:19:25,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:19:25,981 INFO L225 Difference]: With dead ends: 1206 [2025-02-05 16:19:25,981 INFO L226 Difference]: Without dead ends: 856 [2025-02-05 16:19:25,983 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-02-05 16:19:25,985 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 141 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:19:25,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 939 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:19:25,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2025-02-05 16:19:26,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 854. [2025-02-05 16:19:26,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 853 states have (on average 1.7174677608440798) internal successors, (1465), 853 states have internal predecessors, (1465), 0 states have call successors, (0), 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-02-05 16:19:26,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1465 transitions. [2025-02-05 16:19:26,017 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1465 transitions. Word has length 128 [2025-02-05 16:19:26,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:19:26,017 INFO L471 AbstractCegarLoop]: Abstraction has 854 states and 1465 transitions. [2025-02-05 16:19:26,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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-02-05 16:19:26,018 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1465 transitions. [2025-02-05 16:19:26,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 16:19:26,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:19:26,020 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:19:26,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:19:26,020 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:19:26,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:19:26,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1698930916, now seen corresponding path program 1 times [2025-02-05 16:19:26,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:19:26,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120092739] [2025-02-05 16:19:26,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:19:26,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:19:26,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 16:19:26,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 16:19:26,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:19:26,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:19:26,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:19:26,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:19:26,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120092739] [2025-02-05 16:19:26,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120092739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:19:26,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:19:26,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:19:26,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988642117] [2025-02-05 16:19:26,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:19:26,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:19:26,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:19:26,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:19:26,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:19:26,272 INFO L87 Difference]: Start difference. First operand 854 states and 1465 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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-02-05 16:19:26,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:19:26,321 INFO L93 Difference]: Finished difference Result 2090 states and 3619 transitions. [2025-02-05 16:19:26,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:19:26,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2025-02-05 16:19:26,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:19:26,328 INFO L225 Difference]: With dead ends: 2090 [2025-02-05 16:19:26,328 INFO L226 Difference]: Without dead ends: 1432 [2025-02-05 16:19:26,330 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-02-05 16:19:26,332 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 134 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:19:26,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 940 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:19:26,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2025-02-05 16:19:26,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1430. [2025-02-05 16:19:26,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1429 states have (on average 1.722183344996501) internal successors, (2461), 1429 states have internal predecessors, (2461), 0 states have call successors, (0), 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-02-05 16:19:26,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 2461 transitions. [2025-02-05 16:19:26,380 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 2461 transitions. Word has length 131 [2025-02-05 16:19:26,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:19:26,381 INFO L471 AbstractCegarLoop]: Abstraction has 1430 states and 2461 transitions. [2025-02-05 16:19:26,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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-02-05 16:19:26,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 2461 transitions. [2025-02-05 16:19:26,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 16:19:26,383 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:19:26,383 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:19:26,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:19:26,384 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:19:26,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:19:26,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1706351482, now seen corresponding path program 1 times [2025-02-05 16:19:26,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:19:26,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668995700] [2025-02-05 16:19:26,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:19:26,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:19:26,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 16:19:26,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 16:19:26,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:19:26,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:19:26,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:19:26,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:19:26,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668995700] [2025-02-05 16:19:26,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668995700] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:19:26,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:19:26,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:19:26,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984377565] [2025-02-05 16:19:26,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:19:26,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:19:26,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:19:26,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:19:26,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:19:26,684 INFO L87 Difference]: Start difference. First operand 1430 states and 2461 transitions. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 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-02-05 16:19:27,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:19:27,059 INFO L93 Difference]: Finished difference Result 7238 states and 12653 transitions. [2025-02-05 16:19:27,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:19:27,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-02-05 16:19:27,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:19:27,087 INFO L225 Difference]: With dead ends: 7238 [2025-02-05 16:19:27,088 INFO L226 Difference]: Without dead ends: 6004 [2025-02-05 16:19:27,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:19:27,097 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 1378 mSDsluCounter, 3750 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 4241 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:19:27,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 4241 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:19:27,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2025-02-05 16:19:27,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 2578. [2025-02-05 16:19:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2578 states, 2577 states have (on average 1.7283663174233606) internal successors, (4454), 2577 states have internal predecessors, (4454), 0 states have call successors, (0), 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-02-05 16:19:27,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 4454 transitions. [2025-02-05 16:19:27,246 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 4454 transitions. Word has length 134 [2025-02-05 16:19:27,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:19:27,247 INFO L471 AbstractCegarLoop]: Abstraction has 2578 states and 4454 transitions. [2025-02-05 16:19:27,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 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-02-05 16:19:27,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 4454 transitions. [2025-02-05 16:19:27,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 16:19:27,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:19:27,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:19:27,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:19:27,251 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:19:27,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:19:27,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1304586153, now seen corresponding path program 1 times [2025-02-05 16:19:27,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:19:27,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638417915] [2025-02-05 16:19:27,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:19:27,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:19:27,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 16:19:27,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 16:19:27,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:19:27,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:19:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:19:27,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:19:27,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638417915] [2025-02-05 16:19:27,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638417915] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:19:27,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:19:27,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:19:27,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616467799] [2025-02-05 16:19:27,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:19:27,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:19:27,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:19:27,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:19:27,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:19:27,457 INFO L87 Difference]: Start difference. First operand 2578 states and 4454 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 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-02-05 16:19:27,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:19:27,617 INFO L93 Difference]: Finished difference Result 7484 states and 13044 transitions. [2025-02-05 16:19:27,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:19:27,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 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) Word has length 135 [2025-02-05 16:19:27,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:19:27,642 INFO L225 Difference]: With dead ends: 7484 [2025-02-05 16:19:27,643 INFO L226 Difference]: Without dead ends: 5102 [2025-02-05 16:19:27,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:19:27,650 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 510 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:19:27,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1458 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:19:27,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5102 states. [2025-02-05 16:19:27,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5102 to 3823. [2025-02-05 16:19:27,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3823 states, 3822 states have (on average 1.7318158032443747) internal successors, (6619), 3822 states have internal predecessors, (6619), 0 states have call successors, (0), 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-02-05 16:19:27,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3823 states to 3823 states and 6619 transitions. [2025-02-05 16:19:27,803 INFO L78 Accepts]: Start accepts. Automaton has 3823 states and 6619 transitions. Word has length 135 [2025-02-05 16:19:27,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:19:27,804 INFO L471 AbstractCegarLoop]: Abstraction has 3823 states and 6619 transitions. [2025-02-05 16:19:27,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 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-02-05 16:19:27,804 INFO L276 IsEmpty]: Start isEmpty. Operand 3823 states and 6619 transitions. [2025-02-05 16:19:27,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 16:19:27,811 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:19:27,811 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:19:27,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:19:27,812 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:19:27,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:19:27,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1275585413, now seen corresponding path program 1 times [2025-02-05 16:19:27,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:19:27,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528144002] [2025-02-05 16:19:27,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:19:27,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:19:27,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 16:19:27,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 16:19:27,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:19:27,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:19:27,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:19:27,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:19:27,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528144002] [2025-02-05 16:19:27,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528144002] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:19:27,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:19:27,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:19:27,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35772432] [2025-02-05 16:19:27,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:19:27,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:19:27,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:19:27,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:19:27,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:19:27,954 INFO L87 Difference]: Start difference. First operand 3823 states and 6619 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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-02-05 16:19:28,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:19:28,047 INFO L93 Difference]: Finished difference Result 8432 states and 14679 transitions. [2025-02-05 16:19:28,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:19:28,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2025-02-05 16:19:28,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:19:28,074 INFO L225 Difference]: With dead ends: 8432 [2025-02-05 16:19:28,074 INFO L226 Difference]: Without dead ends: 5857 [2025-02-05 16:19:28,081 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-02-05 16:19:28,082 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 156 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1085 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-02-05 16:19:28,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1085 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:19:28,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5857 states. [2025-02-05 16:19:28,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5857 to 5855. [2025-02-05 16:19:28,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5855 states, 5854 states have (on average 1.7289033139733516) internal successors, (10121), 5854 states have internal predecessors, (10121), 0 states have call successors, (0), 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-02-05 16:19:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5855 states to 5855 states and 10121 transitions. [2025-02-05 16:19:28,305 INFO L78 Accepts]: Start accepts. Automaton has 5855 states and 10121 transitions. Word has length 136 [2025-02-05 16:19:28,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:19:28,306 INFO L471 AbstractCegarLoop]: Abstraction has 5855 states and 10121 transitions. [2025-02-05 16:19:28,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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-02-05 16:19:28,306 INFO L276 IsEmpty]: Start isEmpty. Operand 5855 states and 10121 transitions. [2025-02-05 16:19:28,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 16:19:28,308 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:19:28,308 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:19:28,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:19:28,309 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:19:28,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:19:28,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1629440408, now seen corresponding path program 1 times [2025-02-05 16:19:28,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:19:28,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463290233] [2025-02-05 16:19:28,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:19:28,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:19:28,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 16:19:28,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 16:19:28,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:19:28,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:19:28,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:19:28,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:19:28,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463290233] [2025-02-05 16:19:28,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463290233] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:19:28,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:19:28,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:19:28,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140672072] [2025-02-05 16:19:28,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:19:28,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:19:28,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:19:28,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:19:28,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:19:28,443 INFO L87 Difference]: Start difference. First operand 5855 states and 10121 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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-02-05 16:19:28,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:19:28,609 INFO L93 Difference]: Finished difference Result 11373 states and 19668 transitions. [2025-02-05 16:19:28,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:19:28,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2025-02-05 16:19:28,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:19:28,646 INFO L225 Difference]: With dead ends: 11373 [2025-02-05 16:19:28,646 INFO L226 Difference]: Without dead ends: 8259 [2025-02-05 16:19:28,655 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-02-05 16:19:28,655 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 149 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1079 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:19:28,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1079 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:19:28,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8259 states. [2025-02-05 16:19:28,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8259 to 8257. [2025-02-05 16:19:28,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8257 states, 8256 states have (on average 1.7200823643410852) internal successors, (14201), 8256 states have internal predecessors, (14201), 0 states have call successors, (0), 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-02-05 16:19:28,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8257 states to 8257 states and 14201 transitions. [2025-02-05 16:19:28,972 INFO L78 Accepts]: Start accepts. Automaton has 8257 states and 14201 transitions. Word has length 136 [2025-02-05 16:19:28,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:19:28,972 INFO L471 AbstractCegarLoop]: Abstraction has 8257 states and 14201 transitions. [2025-02-05 16:19:28,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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-02-05 16:19:28,973 INFO L276 IsEmpty]: Start isEmpty. Operand 8257 states and 14201 transitions. [2025-02-05 16:19:28,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 16:19:28,974 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:19:28,974 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:19:28,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:19:28,975 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:19:28,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:19:28,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1477195900, now seen corresponding path program 1 times [2025-02-05 16:19:28,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:19:28,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55759814] [2025-02-05 16:19:28,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:19:28,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:19:28,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 16:19:29,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 16:19:29,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:19:29,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:19:29,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:19:29,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:19:29,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55759814] [2025-02-05 16:19:29,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55759814] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:19:29,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:19:29,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:19:29,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019246201] [2025-02-05 16:19:29,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:19:29,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:19:29,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:19:29,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:19:29,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:19:29,123 INFO L87 Difference]: Start difference. First operand 8257 states and 14201 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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-02-05 16:19:29,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:19:29,323 INFO L93 Difference]: Finished difference Result 16007 states and 27532 transitions. [2025-02-05 16:19:29,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:19:29,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2025-02-05 16:19:29,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:19:29,358 INFO L225 Difference]: With dead ends: 16007 [2025-02-05 16:19:29,359 INFO L226 Difference]: Without dead ends: 11597 [2025-02-05 16:19:29,370 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-02-05 16:19:29,372 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 142 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1064 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-02-05 16:19:29,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1064 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:19:29,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11597 states. [2025-02-05 16:19:29,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11597 to 11595. [2025-02-05 16:19:29,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11595 states, 11594 states have (on average 1.70976367086424) internal successors, (19823), 11594 states have internal predecessors, (19823), 0 states have call successors, (0), 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-02-05 16:19:29,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11595 states to 11595 states and 19823 transitions. [2025-02-05 16:19:29,681 INFO L78 Accepts]: Start accepts. Automaton has 11595 states and 19823 transitions. Word has length 136 [2025-02-05 16:19:29,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:19:29,681 INFO L471 AbstractCegarLoop]: Abstraction has 11595 states and 19823 transitions. [2025-02-05 16:19:29,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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-02-05 16:19:29,682 INFO L276 IsEmpty]: Start isEmpty. Operand 11595 states and 19823 transitions. [2025-02-05 16:19:29,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 16:19:29,683 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:19:29,683 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:19:29,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:19:29,684 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:19:29,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:19:29,684 INFO L85 PathProgramCache]: Analyzing trace with hash -392331800, now seen corresponding path program 1 times [2025-02-05 16:19:29,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:19:29,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389405618] [2025-02-05 16:19:29,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:19:29,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:19:29,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 16:19:29,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 16:19:29,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:19:29,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:19:29,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:19:29,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:19:29,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389405618] [2025-02-05 16:19:29,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389405618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:19:29,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:19:29,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:19:29,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896029190] [2025-02-05 16:19:29,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:19:29,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:19:29,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:19:29,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:19:29,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:19:29,887 INFO L87 Difference]: Start difference. First operand 11595 states and 19823 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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-02-05 16:19:30,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:19:30,102 INFO L93 Difference]: Finished difference Result 22433 states and 38340 transitions. [2025-02-05 16:19:30,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:19:30,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2025-02-05 16:19:30,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:19:30,152 INFO L225 Difference]: With dead ends: 22433 [2025-02-05 16:19:30,152 INFO L226 Difference]: Without dead ends: 16209 [2025-02-05 16:19:30,168 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-02-05 16:19:30,169 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 135 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1049 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-02-05 16:19:30,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1049 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:19:30,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16209 states. [2025-02-05 16:19:30,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16209 to 16207. [2025-02-05 16:19:30,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16207 states, 16206 states have (on average 1.6977045538689375) internal successors, (27513), 16206 states have internal predecessors, (27513), 0 states have call successors, (0), 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-02-05 16:19:30,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16207 states to 16207 states and 27513 transitions. [2025-02-05 16:19:30,687 INFO L78 Accepts]: Start accepts. Automaton has 16207 states and 27513 transitions. Word has length 136 [2025-02-05 16:19:30,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:19:30,688 INFO L471 AbstractCegarLoop]: Abstraction has 16207 states and 27513 transitions. [2025-02-05 16:19:30,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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-02-05 16:19:30,688 INFO L276 IsEmpty]: Start isEmpty. Operand 16207 states and 27513 transitions. [2025-02-05 16:19:30,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 16:19:30,689 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:19:30,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:19:30,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:19:30,690 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:19:30,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:19:30,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1736609884, now seen corresponding path program 1 times [2025-02-05 16:19:30,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:19:30,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995658912] [2025-02-05 16:19:30,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:19:30,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:19:30,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 16:19:30,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 16:19:30,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:19:30,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:19:30,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:19:30,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:19:30,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995658912] [2025-02-05 16:19:30,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995658912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:19:30,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:19:30,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:19:30,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659668469] [2025-02-05 16:19:30,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:19:30,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:19:30,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:19:30,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:19:30,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:19:30,858 INFO L87 Difference]: Start difference. First operand 16207 states and 27513 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 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-02-05 16:19:31,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:19:31,430 INFO L93 Difference]: Finished difference Result 53150 states and 90310 transitions. [2025-02-05 16:19:31,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:19:31,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2025-02-05 16:19:31,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:19:31,543 INFO L225 Difference]: With dead ends: 53150 [2025-02-05 16:19:31,544 INFO L226 Difference]: Without dead ends: 37171 [2025-02-05 16:19:31,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:19:31,575 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 509 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:19:31,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1569 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:19:31,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37171 states. [2025-02-05 16:19:32,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37171 to 26600. [2025-02-05 16:19:32,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26600 states, 26599 states have (on average 1.6881085755103575) internal successors, (44902), 26599 states have internal predecessors, (44902), 0 states have call successors, (0), 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-02-05 16:19:32,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26600 states to 26600 states and 44902 transitions. [2025-02-05 16:19:32,567 INFO L78 Accepts]: Start accepts. Automaton has 26600 states and 44902 transitions. Word has length 136 [2025-02-05 16:19:32,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:19:32,568 INFO L471 AbstractCegarLoop]: Abstraction has 26600 states and 44902 transitions. [2025-02-05 16:19:32,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 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-02-05 16:19:32,568 INFO L276 IsEmpty]: Start isEmpty. Operand 26600 states and 44902 transitions. [2025-02-05 16:19:32,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-05 16:19:32,570 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:19:32,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:19:32,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:19:32,570 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:19:32,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:19:32,571 INFO L85 PathProgramCache]: Analyzing trace with hash 2048676597, now seen corresponding path program 1 times [2025-02-05 16:19:32,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:19:32,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209848174] [2025-02-05 16:19:32,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:19:32,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:19:32,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 16:19:32,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 16:19:32,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:19:32,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:19:32,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:19:32,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:19:32,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209848174] [2025-02-05 16:19:32,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209848174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:19:32,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:19:32,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:19:32,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581020222] [2025-02-05 16:19:32,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:19:32,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:19:32,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:19:32,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:19:32,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:19:32,782 INFO L87 Difference]: Start difference. First operand 26600 states and 44902 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 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-02-05 16:19:33,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:19:33,749 INFO L93 Difference]: Finished difference Result 86940 states and 146868 transitions. [2025-02-05 16:19:33,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:19:33,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-02-05 16:19:33,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:19:33,944 INFO L225 Difference]: With dead ends: 86940 [2025-02-05 16:19:33,944 INFO L226 Difference]: Without dead ends: 60568 [2025-02-05 16:19:33,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:19:33,996 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 507 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:19:33,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1571 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:19:34,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60568 states. [2025-02-05 16:19:34,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60568 to 43441. [2025-02-05 16:19:35,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43441 states, 43440 states have (on average 1.6784300184162062) internal successors, (72911), 43440 states have internal predecessors, (72911), 0 states have call successors, (0), 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-02-05 16:19:35,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43441 states to 43441 states and 72911 transitions. [2025-02-05 16:19:35,215 INFO L78 Accepts]: Start accepts. Automaton has 43441 states and 72911 transitions. Word has length 137 [2025-02-05 16:19:35,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:19:35,215 INFO L471 AbstractCegarLoop]: Abstraction has 43441 states and 72911 transitions. [2025-02-05 16:19:35,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 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-02-05 16:19:35,216 INFO L276 IsEmpty]: Start isEmpty. Operand 43441 states and 72911 transitions. [2025-02-05 16:19:35,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 16:19:35,217 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:19:35,217 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:19:35,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:19:35,217 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:19:35,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:19:35,218 INFO L85 PathProgramCache]: Analyzing trace with hash -868373822, now seen corresponding path program 1 times [2025-02-05 16:19:35,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:19:35,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009074299] [2025-02-05 16:19:35,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:19:35,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:19:35,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 16:19:35,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 16:19:35,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:19:35,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:19:35,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:19:35,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:19:35,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009074299] [2025-02-05 16:19:35,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009074299] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:19:35,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:19:35,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:19:35,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249202189] [2025-02-05 16:19:35,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:19:35,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:19:35,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:19:35,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:19:35,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:19:35,530 INFO L87 Difference]: Start difference. First operand 43441 states and 72911 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 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-02-05 16:19:36,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:19:36,789 INFO L93 Difference]: Finished difference Result 140394 states and 235818 transitions. [2025-02-05 16:19:36,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:19:36,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-02-05 16:19:36,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:19:37,111 INFO L225 Difference]: With dead ends: 140394 [2025-02-05 16:19:37,111 INFO L226 Difference]: Without dead ends: 97181 [2025-02-05 16:19:37,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:19:37,169 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 505 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:19:37,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1573 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:19:37,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97181 states. [2025-02-05 16:19:38,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97181 to 70086. [2025-02-05 16:19:38,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70086 states, 70085 states have (on average 1.6690589997859742) internal successors, (116976), 70085 states have internal predecessors, (116976), 0 states have call successors, (0), 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-02-05 16:19:38,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70086 states to 70086 states and 116976 transitions. [2025-02-05 16:19:38,929 INFO L78 Accepts]: Start accepts. Automaton has 70086 states and 116976 transitions. Word has length 138 [2025-02-05 16:19:38,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:19:38,930 INFO L471 AbstractCegarLoop]: Abstraction has 70086 states and 116976 transitions. [2025-02-05 16:19:38,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 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-02-05 16:19:38,930 INFO L276 IsEmpty]: Start isEmpty. Operand 70086 states and 116976 transitions. [2025-02-05 16:19:38,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 16:19:38,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:19:38,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:19:38,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:19:38,932 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:19:38,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:19:38,932 INFO L85 PathProgramCache]: Analyzing trace with hash 164615648, now seen corresponding path program 1 times [2025-02-05 16:19:38,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:19:38,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739887595] [2025-02-05 16:19:38,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:19:38,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:19:38,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 16:19:38,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 16:19:38,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:19:38,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:19:39,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:19:39,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:19:39,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739887595] [2025-02-05 16:19:39,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739887595] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:19:39,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:19:39,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:19:39,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285098592] [2025-02-05 16:19:39,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:19:39,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:19:39,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:19:39,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:19:39,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:19:39,369 INFO L87 Difference]: Start difference. First operand 70086 states and 116976 transitions. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 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-02-05 16:19:40,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:19:40,796 INFO L93 Difference]: Finished difference Result 139946 states and 233587 transitions. [2025-02-05 16:19:40,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:19:40,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 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) Word has length 140 [2025-02-05 16:19:40,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:19:41,013 INFO L225 Difference]: With dead ends: 139946 [2025-02-05 16:19:41,013 INFO L226 Difference]: Without dead ends: 70088 [2025-02-05 16:19:41,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:19:41,067 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 408 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:19:41,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 1845 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:19:41,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70088 states. [2025-02-05 16:19:42,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70088 to 70086. [2025-02-05 16:19:42,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70086 states, 70085 states have (on average 1.6601412570450167) internal successors, (116351), 70085 states have internal predecessors, (116351), 0 states have call successors, (0), 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-02-05 16:19:42,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70086 states to 70086 states and 116351 transitions. [2025-02-05 16:19:42,651 INFO L78 Accepts]: Start accepts. Automaton has 70086 states and 116351 transitions. Word has length 140 [2025-02-05 16:19:42,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:19:42,652 INFO L471 AbstractCegarLoop]: Abstraction has 70086 states and 116351 transitions. [2025-02-05 16:19:42,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 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-02-05 16:19:42,652 INFO L276 IsEmpty]: Start isEmpty. Operand 70086 states and 116351 transitions. [2025-02-05 16:19:42,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 16:19:42,653 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:19:42,653 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:19:42,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:19:42,654 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:19:42,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:19:42,655 INFO L85 PathProgramCache]: Analyzing trace with hash 878495566, now seen corresponding path program 1 times [2025-02-05 16:19:42,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:19:42,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012805177] [2025-02-05 16:19:42,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:19:42,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:19:42,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 16:19:42,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 16:19:42,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:19:42,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:19:43,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:19:43,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:19:43,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012805177] [2025-02-05 16:19:43,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012805177] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:19:43,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:19:43,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:19:43,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751403825] [2025-02-05 16:19:43,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:19:43,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:19:43,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:19:43,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:19:43,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:19:43,288 INFO L87 Difference]: Start difference. First operand 70086 states and 116351 transitions. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:19:45,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:19:45,744 INFO L93 Difference]: Finished difference Result 204952 states and 340663 transitions. [2025-02-05 16:19:45,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:19:45,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2025-02-05 16:19:45,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:19:46,214 INFO L225 Difference]: With dead ends: 204952 [2025-02-05 16:19:46,215 INFO L226 Difference]: Without dead ends: 135094 [2025-02-05 16:19:46,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:19:46,352 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 535 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1858 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:19:46,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1858 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:19:46,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135094 states. [2025-02-05 16:19:49,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135094 to 135092. [2025-02-05 16:19:49,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135092 states, 135091 states have (on average 1.648222309406252) internal successors, (222660), 135091 states have internal predecessors, (222660), 0 states have call successors, (0), 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-02-05 16:19:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135092 states to 135092 states and 222660 transitions. [2025-02-05 16:19:49,664 INFO L78 Accepts]: Start accepts. Automaton has 135092 states and 222660 transitions. Word has length 143 [2025-02-05 16:19:49,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:19:49,664 INFO L471 AbstractCegarLoop]: Abstraction has 135092 states and 222660 transitions. [2025-02-05 16:19:49,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:19:49,665 INFO L276 IsEmpty]: Start isEmpty. Operand 135092 states and 222660 transitions. [2025-02-05 16:19:49,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 16:19:49,666 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:19:49,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:19:49,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:19:49,666 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:19:49,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:19:49,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1495943545, now seen corresponding path program 1 times [2025-02-05 16:19:49,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:19:49,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928985014] [2025-02-05 16:19:49,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:19:49,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:19:49,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 16:19:49,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 16:19:49,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:19:49,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:19:50,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:19:50,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:19:50,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928985014] [2025-02-05 16:19:50,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928985014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:19:50,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:19:50,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:19:50,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255810974] [2025-02-05 16:19:50,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:19:50,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:19:50,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:19:50,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:19:50,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:19:50,263 INFO L87 Difference]: Start difference. First operand 135092 states and 222660 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 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-02-05 16:19:51,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:19:51,529 INFO L93 Difference]: Finished difference Result 140902 states and 230405 transitions. [2025-02-05 16:19:51,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:19:51,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2025-02-05 16:19:51,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:19:51,755 INFO L225 Difference]: With dead ends: 140902 [2025-02-05 16:19:51,755 INFO L226 Difference]: Without dead ends: 140900 [2025-02-05 16:19:51,790 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-02-05 16:19:51,791 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 0 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1945 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:19:51,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1945 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:19:51,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140900 states. [2025-02-05 16:19:54,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140900 to 140900. [2025-02-05 16:19:54,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140900 states, 140899 states have (on average 1.6213103002860205) internal successors, (228441), 140899 states have internal predecessors, (228441), 0 states have call successors, (0), 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-02-05 16:19:55,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140900 states to 140900 states and 228441 transitions. [2025-02-05 16:19:55,092 INFO L78 Accepts]: Start accepts. Automaton has 140900 states and 228441 transitions. Word has length 144 [2025-02-05 16:19:55,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:19:55,096 INFO L471 AbstractCegarLoop]: Abstraction has 140900 states and 228441 transitions. [2025-02-05 16:19:55,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 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-02-05 16:19:55,097 INFO L276 IsEmpty]: Start isEmpty. Operand 140900 states and 228441 transitions. [2025-02-05 16:19:55,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-05 16:19:55,111 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:19:55,111 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:19:55,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:19:55,112 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:19:55,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:19:55,113 INFO L85 PathProgramCache]: Analyzing trace with hash 838342086, now seen corresponding path program 1 times [2025-02-05 16:19:55,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:19:55,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772481134] [2025-02-05 16:19:55,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:19:55,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:19:55,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-05 16:19:55,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-05 16:19:55,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:19:55,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:19:55,491 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:19:55,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:19:55,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772481134] [2025-02-05 16:19:55,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772481134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:19:55,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:19:55,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:19:55,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340241367] [2025-02-05 16:19:55,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:19:55,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:19:55,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:19:55,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:19:55,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:19:55,493 INFO L87 Difference]: Start difference. First operand 140900 states and 228441 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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-02-05 16:19:58,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:19:58,535 INFO L93 Difference]: Finished difference Result 321679 states and 523089 transitions. [2025-02-05 16:19:58,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:19:58,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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 180 [2025-02-05 16:19:58,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:19:59,085 INFO L225 Difference]: With dead ends: 321679 [2025-02-05 16:19:59,085 INFO L226 Difference]: Without dead ends: 257877 [2025-02-05 16:19:59,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:19:59,200 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 123 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:19:59,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 937 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:19:59,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257877 states. [2025-02-05 16:20:04,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257877 to 257625. [2025-02-05 16:20:04,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257625 states, 257624 states have (on average 1.622663261186846) internal successors, (418037), 257624 states have internal predecessors, (418037), 0 states have call successors, (0), 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-02-05 16:20:05,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257625 states to 257625 states and 418037 transitions. [2025-02-05 16:20:05,787 INFO L78 Accepts]: Start accepts. Automaton has 257625 states and 418037 transitions. Word has length 180 [2025-02-05 16:20:05,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:20:05,788 INFO L471 AbstractCegarLoop]: Abstraction has 257625 states and 418037 transitions. [2025-02-05 16:20:05,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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-02-05 16:20:05,789 INFO L276 IsEmpty]: Start isEmpty. Operand 257625 states and 418037 transitions. [2025-02-05 16:20:05,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-05 16:20:05,803 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:20:05,804 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:20:05,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:20:05,808 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:20:05,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:20:05,808 INFO L85 PathProgramCache]: Analyzing trace with hash -2066683735, now seen corresponding path program 1 times [2025-02-05 16:20:05,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:20:05,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670948015] [2025-02-05 16:20:05,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:20:05,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:20:05,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-05 16:20:05,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-05 16:20:05,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:20:05,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:20:06,086 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:20:06,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:20:06,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670948015] [2025-02-05 16:20:06,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670948015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:20:06,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:20:06,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:20:06,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672006024] [2025-02-05 16:20:06,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:20:06,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:20:06,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:20:06,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:20:06,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:20:06,089 INFO L87 Difference]: Start difference. First operand 257625 states and 418037 transitions. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 0 states have call successors, (0), 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-02-05 16:20:12,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:20:12,069 INFO L93 Difference]: Finished difference Result 715162 states and 1162763 transitions. [2025-02-05 16:20:12,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:20:12,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 0 states have call successors, (0), 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 180 [2025-02-05 16:20:12,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:20:13,335 INFO L225 Difference]: With dead ends: 715162 [2025-02-05 16:20:13,335 INFO L226 Difference]: Without dead ends: 601600 [2025-02-05 16:20:13,535 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-02-05 16:20:13,535 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 1026 mSDsluCounter, 1860 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 2515 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:20:13,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 2515 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:20:14,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601600 states.