./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label11.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7c2a5ace26f36583b09a306c2edaa0573f422d931cc3959f8aefc935152706cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:53:40,566 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:53:40,617 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:53:40,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:53:40,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:53:40,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:53:40,646 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:53:40,646 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:53:40,646 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:53:40,646 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:53:40,646 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:53:40,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:53:40,646 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:53:40,646 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:53:40,646 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:53:40,647 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:53:40,647 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:53:40,647 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:53:40,647 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:53:40,647 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:53:40,647 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:53:40,647 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:53:40,647 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:53:40,647 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:53:40,647 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:53:40,647 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:53:40,647 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:53:40,647 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:53:40,647 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:53:40,647 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:53:40,647 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:53:40,647 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:53:40,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:53:40,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:53:40,648 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:53:40,648 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:53:40,648 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:53:40,648 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:53:40,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:53:40,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:53:40,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:53:40,648 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:53:40,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:53:40,648 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7c2a5ace26f36583b09a306c2edaa0573f422d931cc3959f8aefc935152706cf [2025-03-16 14:53:40,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:53:40,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:53:40,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:53:40,884 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:53:40,884 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:53:40,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label11.c [2025-03-16 14:53:42,088 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a13b33597/212b856ecf8e4688bb5a39fe3666b7d1/FLAGfb4ddd4a2 [2025-03-16 14:53:42,531 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:53:42,532 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label11.c [2025-03-16 14:53:42,559 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a13b33597/212b856ecf8e4688bb5a39fe3666b7d1/FLAGfb4ddd4a2 [2025-03-16 14:53:42,660 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a13b33597/212b856ecf8e4688bb5a39fe3666b7d1 [2025-03-16 14:53:42,661 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:53:42,662 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:53:42,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:53:42,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:53:42,666 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:53:42,667 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:53:42" (1/1) ... [2025-03-16 14:53:42,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1998856b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:53:42, skipping insertion in model container [2025-03-16 14:53:42,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:53:42" (1/1) ... [2025-03-16 14:53:42,729 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:53:42,937 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label11.c[5009,5022] [2025-03-16 14:53:43,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:53:43,452 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:53:43,464 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label11.c[5009,5022] [2025-03-16 14:53:43,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:53:43,736 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:53:43,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:53:43 WrapperNode [2025-03-16 14:53:43,738 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:53:43,738 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:53:43,738 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:53:43,739 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:53:43,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:53:43" (1/1) ... [2025-03-16 14:53:43,780 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:53:43" (1/1) ... [2025-03-16 14:53:44,014 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-03-16 14:53:44,015 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:53:44,016 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:53:44,016 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:53:44,016 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:53:44,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:53:43" (1/1) ... [2025-03-16 14:53:44,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:53:43" (1/1) ... [2025-03-16 14:53:44,062 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:53:43" (1/1) ... [2025-03-16 14:53:44,218 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 14:53:44,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:53:43" (1/1) ... [2025-03-16 14:53:44,219 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:53:43" (1/1) ... [2025-03-16 14:53:44,342 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:53:43" (1/1) ... [2025-03-16 14:53:44,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:53:43" (1/1) ... [2025-03-16 14:53:44,377 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:53:43" (1/1) ... [2025-03-16 14:53:44,394 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:53:43" (1/1) ... [2025-03-16 14:53:44,430 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:53:44,432 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:53:44,432 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:53:44,433 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:53:44,433 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:53:43" (1/1) ... [2025-03-16 14:53:44,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:53:44,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:53:44,462 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 14:53:44,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 14:53:44,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:53:44,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:53:44,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:53:44,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:53:44,545 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:53:44,547 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:53:47,909 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-03-16 14:53:47,910 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-03-16 14:53:47,910 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-03-16 14:53:48,038 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-03-16 14:53:48,038 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:53:48,063 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:53:48,064 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:53:48,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:53:48 BoogieIcfgContainer [2025-03-16 14:53:48,064 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:53:48,069 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:53:48,069 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:53:48,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:53:48,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:53:42" (1/3) ... [2025-03-16 14:53:48,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60024a35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:53:48, skipping insertion in model container [2025-03-16 14:53:48,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:53:43" (2/3) ... [2025-03-16 14:53:48,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60024a35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:53:48, skipping insertion in model container [2025-03-16 14:53:48,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:53:48" (3/3) ... [2025-03-16 14:53:48,076 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label11.c [2025-03-16 14:53:48,090 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:53:48,092 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label11.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:53:48,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:53:48,173 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;@39253559, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:53:48,174 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:53:48,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9907284768211921) internal successors, (1503), 756 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:48,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 14:53:48,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:48,185 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] [2025-03-16 14:53:48,185 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:48,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:48,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1628046856, now seen corresponding path program 1 times [2025-03-16 14:53:48,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:48,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991706464] [2025-03-16 14:53:48,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:48,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:48,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-16 14:53:48,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 14:53:48,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:48,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:48,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:53:48,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:48,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991706464] [2025-03-16 14:53:48,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991706464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:48,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:48,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:53:48,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763503248] [2025-03-16 14:53:48,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:48,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:53:48,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:48,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:53:48,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:53:48,335 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9907284768211921) internal successors, (1503), 756 states have internal predecessors, (1503), 0 states have call successors, (0), 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 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:48,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:48,403 INFO L93 Difference]: Finished difference Result 1513 states and 3005 transitions. [2025-03-16 14:53:48,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:53:48,406 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-16 14:53:48,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:48,416 INFO L225 Difference]: With dead ends: 1513 [2025-03-16 14:53:48,416 INFO L226 Difference]: Without dead ends: 754 [2025-03-16 14:53:48,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:53:48,426 INFO L435 NwaCegarLoop]: 1441 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, 1441 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:48,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:53:48,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-03-16 14:53:48,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2025-03-16 14:53:48,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.9096945551128819) internal successors, (1438), 753 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:48,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2025-03-16 14:53:48,492 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 38 [2025-03-16 14:53:48,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:48,492 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2025-03-16 14:53:48,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:48,492 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2025-03-16 14:53:48,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 14:53:48,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:48,493 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] [2025-03-16 14:53:48,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:53:48,493 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:48,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:48,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1419871303, now seen corresponding path program 1 times [2025-03-16 14:53:48,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:48,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372790889] [2025-03-16 14:53:48,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:48,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:48,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-16 14:53:48,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 14:53:48,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:48,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:48,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:53:48,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:48,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372790889] [2025-03-16 14:53:48,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372790889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:48,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:48,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:53:48,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841335599] [2025-03-16 14:53:48,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:48,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:53:48,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:48,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:53:48,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:48,642 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:51,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:51,488 INFO L93 Difference]: Finished difference Result 2258 states and 4311 transitions. [2025-03-16 14:53:51,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:53:51,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-16 14:53:51,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:51,496 INFO L225 Difference]: With dead ends: 2258 [2025-03-16 14:53:51,496 INFO L226 Difference]: Without dead ends: 1505 [2025-03-16 14:53:51,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:51,498 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 754 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2440 mSolverCounterSat, 704 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 3144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 704 IncrementalHoareTripleChecker+Valid, 2440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:51,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 85 Invalid, 3144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [704 Valid, 2440 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 14:53:51,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2025-03-16 14:53:51,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2025-03-16 14:53:51,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1504 states have (on average 1.8663563829787233) internal successors, (2807), 1504 states have internal predecessors, (2807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:51,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2807 transitions. [2025-03-16 14:53:51,557 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2807 transitions. Word has length 38 [2025-03-16 14:53:51,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:51,557 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 2807 transitions. [2025-03-16 14:53:51,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:51,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2807 transitions. [2025-03-16 14:53:51,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 14:53:51,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:51,560 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, 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] [2025-03-16 14:53:51,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:53:51,560 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:51,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:51,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1266137530, now seen corresponding path program 1 times [2025-03-16 14:53:51,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:51,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541426702] [2025-03-16 14:53:51,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:51,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:51,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 14:53:51,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 14:53:51,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:51,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:51,812 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:53:51,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:51,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541426702] [2025-03-16 14:53:51,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541426702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:51,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:51,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:53:51,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770298361] [2025-03-16 14:53:51,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:51,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:53:51,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:51,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:53:51,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:51,818 INFO L87 Difference]: Start difference. First operand 1505 states and 2807 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:54,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:54,587 INFO L93 Difference]: Finished difference Result 4513 states and 8419 transitions. [2025-03-16 14:53:54,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:53:54,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-03-16 14:53:54,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:54,598 INFO L225 Difference]: With dead ends: 4513 [2025-03-16 14:53:54,599 INFO L226 Difference]: Without dead ends: 3009 [2025-03-16 14:53:54,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:54,601 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 926 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:54,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 352 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 14:53:54,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3009 states. [2025-03-16 14:53:54,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3009 to 3007. [2025-03-16 14:53:54,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3007 states, 3006 states have (on average 1.6513639387890884) internal successors, (4964), 3006 states have internal predecessors, (4964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:54,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4964 transitions. [2025-03-16 14:53:54,653 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4964 transitions. Word has length 103 [2025-03-16 14:53:54,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:54,653 INFO L471 AbstractCegarLoop]: Abstraction has 3007 states and 4964 transitions. [2025-03-16 14:53:54,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:54,653 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4964 transitions. [2025-03-16 14:53:54,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 14:53:54,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:54,655 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, 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] [2025-03-16 14:53:54,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:53:54,656 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:54,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:54,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1851592983, now seen corresponding path program 1 times [2025-03-16 14:53:54,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:54,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872211676] [2025-03-16 14:53:54,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:54,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:54,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 14:53:54,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 14:53:54,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:54,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:54,932 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:53:54,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:54,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872211676] [2025-03-16 14:53:54,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872211676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:54,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:54,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:53:54,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962020528] [2025-03-16 14:53:54,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:54,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:53:54,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:54,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:53:54,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:53:54,934 INFO L87 Difference]: Start difference. First operand 3007 states and 4964 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:57,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:57,631 INFO L93 Difference]: Finished difference Result 7554 states and 12122 transitions. [2025-03-16 14:53:57,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:53:57,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-16 14:53:57,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:57,645 INFO L225 Difference]: With dead ends: 7554 [2025-03-16 14:53:57,645 INFO L226 Difference]: Without dead ends: 4511 [2025-03-16 14:53:57,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:53:57,649 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 690 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3677 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 4004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 3677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:57,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 608 Invalid, 4004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 3677 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 14:53:57,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4511 states. [2025-03-16 14:53:57,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4511 to 4509. [2025-03-16 14:53:57,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4509 states, 4508 states have (on average 1.4516415261756876) internal successors, (6544), 4508 states have internal predecessors, (6544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:57,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4509 states to 4509 states and 6544 transitions. [2025-03-16 14:53:57,794 INFO L78 Accepts]: Start accepts. Automaton has 4509 states and 6544 transitions. Word has length 109 [2025-03-16 14:53:57,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:57,796 INFO L471 AbstractCegarLoop]: Abstraction has 4509 states and 6544 transitions. [2025-03-16 14:53:57,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:57,796 INFO L276 IsEmpty]: Start isEmpty. Operand 4509 states and 6544 transitions. [2025-03-16 14:53:57,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-16 14:53:57,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:57,801 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, 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] [2025-03-16 14:53:57,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:53:57,802 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:57,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:57,805 INFO L85 PathProgramCache]: Analyzing trace with hash 945489819, now seen corresponding path program 1 times [2025-03-16 14:53:57,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:57,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959705432] [2025-03-16 14:53:57,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:57,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:57,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-16 14:53:57,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-16 14:53:57,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:57,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:58,151 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:53:58,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:58,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959705432] [2025-03-16 14:53:58,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959705432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:58,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:58,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:53:58,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964007685] [2025-03-16 14:53:58,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:58,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:53:58,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:58,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:53:58,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:53:58,153 INFO L87 Difference]: Start difference. First operand 4509 states and 6544 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:01,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:01,354 INFO L93 Difference]: Finished difference Result 14282 states and 20462 transitions. [2025-03-16 14:54:01,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:54:01,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2025-03-16 14:54:01,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:01,377 INFO L225 Difference]: With dead ends: 14282 [2025-03-16 14:54:01,378 INFO L226 Difference]: Without dead ends: 9774 [2025-03-16 14:54:01,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:54:01,383 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 2129 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3777 mSolverCounterSat, 842 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2129 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 4619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 842 IncrementalHoareTripleChecker+Valid, 3777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:01,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2129 Valid, 382 Invalid, 4619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [842 Valid, 3777 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-16 14:54:01,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9774 states. [2025-03-16 14:54:01,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9774 to 9766. [2025-03-16 14:54:01,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9766 states, 9765 states have (on average 1.3653865847414235) internal successors, (13333), 9765 states have internal predecessors, (13333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9766 states to 9766 states and 13333 transitions. [2025-03-16 14:54:01,511 INFO L78 Accepts]: Start accepts. Automaton has 9766 states and 13333 transitions. Word has length 154 [2025-03-16 14:54:01,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:01,511 INFO L471 AbstractCegarLoop]: Abstraction has 9766 states and 13333 transitions. [2025-03-16 14:54:01,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:01,512 INFO L276 IsEmpty]: Start isEmpty. Operand 9766 states and 13333 transitions. [2025-03-16 14:54:01,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-16 14:54:01,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:01,515 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:54:01,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:54:01,515 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:01,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:01,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1807853545, now seen corresponding path program 1 times [2025-03-16 14:54:01,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:01,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169282596] [2025-03-16 14:54:01,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:01,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:01,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-16 14:54:01,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-16 14:54:01,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:01,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:01,728 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-03-16 14:54:01,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:01,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169282596] [2025-03-16 14:54:01,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169282596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:01,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:01,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:54:01,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008065643] [2025-03-16 14:54:01,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:01,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:54:01,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:01,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:54:01,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:01,732 INFO L87 Difference]: Start difference. First operand 9766 states and 13333 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:04,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:04,077 INFO L93 Difference]: Finished difference Result 27041 states and 37584 transitions. [2025-03-16 14:54:04,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:54:04,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 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 301 [2025-03-16 14:54:04,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:04,131 INFO L225 Difference]: With dead ends: 27041 [2025-03-16 14:54:04,131 INFO L226 Difference]: Without dead ends: 17276 [2025-03-16 14:54:04,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:04,138 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 697 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 860 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 2833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 860 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:04,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 426 Invalid, 2833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [860 Valid, 1973 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 14:54:04,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17276 states. [2025-03-16 14:54:04,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17276 to 15774. [2025-03-16 14:54:04,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15774 states, 15773 states have (on average 1.2816204907119761) internal successors, (20215), 15773 states have internal predecessors, (20215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:04,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15774 states to 15774 states and 20215 transitions. [2025-03-16 14:54:04,336 INFO L78 Accepts]: Start accepts. Automaton has 15774 states and 20215 transitions. Word has length 301 [2025-03-16 14:54:04,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:04,337 INFO L471 AbstractCegarLoop]: Abstraction has 15774 states and 20215 transitions. [2025-03-16 14:54:04,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:04,339 INFO L276 IsEmpty]: Start isEmpty. Operand 15774 states and 20215 transitions. [2025-03-16 14:54:04,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2025-03-16 14:54:04,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:04,347 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:54:04,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:54:04,347 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:04,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:04,348 INFO L85 PathProgramCache]: Analyzing trace with hash 262443343, now seen corresponding path program 1 times [2025-03-16 14:54:04,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:04,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889698850] [2025-03-16 14:54:04,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:04,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:04,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-03-16 14:54:04,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-03-16 14:54:04,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:04,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:04,918 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-16 14:54:04,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:04,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889698850] [2025-03-16 14:54:04,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889698850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:04,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:04,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:54:04,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82314096] [2025-03-16 14:54:04,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:04,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:54:04,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:04,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:54:04,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:04,921 INFO L87 Difference]: Start difference. First operand 15774 states and 20215 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:07,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:07,707 INFO L93 Difference]: Finished difference Result 39808 states and 52169 transitions. [2025-03-16 14:54:07,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:54:07,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 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 380 [2025-03-16 14:54:07,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:07,749 INFO L225 Difference]: With dead ends: 39808 [2025-03-16 14:54:07,749 INFO L226 Difference]: Without dead ends: 24035 [2025-03-16 14:54:07,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:07,757 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 775 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2037 mSolverCounterSat, 1093 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 3130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1093 IncrementalHoareTripleChecker+Valid, 2037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:07,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 141 Invalid, 3130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1093 Valid, 2037 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 14:54:07,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24035 states. [2025-03-16 14:54:07,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24035 to 23284. [2025-03-16 14:54:07,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23284 states, 23283 states have (on average 1.3032684791478761) internal successors, (30344), 23283 states have internal predecessors, (30344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:07,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23284 states to 23284 states and 30344 transitions. [2025-03-16 14:54:07,985 INFO L78 Accepts]: Start accepts. Automaton has 23284 states and 30344 transitions. Word has length 380 [2025-03-16 14:54:07,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:07,985 INFO L471 AbstractCegarLoop]: Abstraction has 23284 states and 30344 transitions. [2025-03-16 14:54:07,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:07,986 INFO L276 IsEmpty]: Start isEmpty. Operand 23284 states and 30344 transitions. [2025-03-16 14:54:07,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2025-03-16 14:54:07,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:07,991 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 14:54:07,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:54:07,992 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:07,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:07,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1668068772, now seen corresponding path program 1 times [2025-03-16 14:54:07,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:07,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357700856] [2025-03-16 14:54:07,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:07,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:08,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 397 statements into 1 equivalence classes. [2025-03-16 14:54:08,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 397 of 397 statements. [2025-03-16 14:54:08,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:08,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:08,306 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-03-16 14:54:08,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:08,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357700856] [2025-03-16 14:54:08,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357700856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:08,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:08,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:54:08,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468429240] [2025-03-16 14:54:08,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:08,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:54:08,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:08,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:54:08,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:08,309 INFO L87 Difference]: Start difference. First operand 23284 states and 30344 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:10,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:10,831 INFO L93 Difference]: Finished difference Result 57081 states and 74477 transitions. [2025-03-16 14:54:10,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:54:10,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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 397 [2025-03-16 14:54:10,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:10,894 INFO L225 Difference]: With dead ends: 57081 [2025-03-16 14:54:10,894 INFO L226 Difference]: Without dead ends: 33798 [2025-03-16 14:54:10,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:10,910 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 733 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2271 mSolverCounterSat, 758 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 3029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 758 IncrementalHoareTripleChecker+Valid, 2271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:10,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 216 Invalid, 3029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [758 Valid, 2271 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 14:54:10,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33798 states. [2025-03-16 14:54:11,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33798 to 33047. [2025-03-16 14:54:11,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33047 states, 33046 states have (on average 1.2908067542213884) internal successors, (42656), 33046 states have internal predecessors, (42656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:11,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33047 states to 33047 states and 42656 transitions. [2025-03-16 14:54:11,206 INFO L78 Accepts]: Start accepts. Automaton has 33047 states and 42656 transitions. Word has length 397 [2025-03-16 14:54:11,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:11,207 INFO L471 AbstractCegarLoop]: Abstraction has 33047 states and 42656 transitions. [2025-03-16 14:54:11,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:11,210 INFO L276 IsEmpty]: Start isEmpty. Operand 33047 states and 42656 transitions. [2025-03-16 14:54:11,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-16 14:54:11,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:11,215 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 14:54:11,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:54:11,216 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:11,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:11,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1096083263, now seen corresponding path program 1 times [2025-03-16 14:54:11,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:11,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449165010] [2025-03-16 14:54:11,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:11,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:11,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-16 14:54:11,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-16 14:54:11,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:11,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:11,547 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-16 14:54:11,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:11,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449165010] [2025-03-16 14:54:11,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449165010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:11,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:11,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:54:11,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102933181] [2025-03-16 14:54:11,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:11,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:54:11,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:11,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:54:11,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:11,549 INFO L87 Difference]: Start difference. First operand 33047 states and 42656 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:13,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:13,863 INFO L93 Difference]: Finished difference Result 80362 states and 103506 transitions. [2025-03-16 14:54:13,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:54:13,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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 408 [2025-03-16 14:54:13,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:13,922 INFO L225 Difference]: With dead ends: 80362 [2025-03-16 14:54:13,922 INFO L226 Difference]: Without dead ends: 47316 [2025-03-16 14:54:13,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:13,947 INFO L435 NwaCegarLoop]: 1318 mSDtfsCounter, 719 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2165 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 2697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 2165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:13,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 1325 Invalid, 2697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 2165 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 14:54:13,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47316 states. [2025-03-16 14:54:14,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47316 to 45814. [2025-03-16 14:54:14,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45814 states, 45813 states have (on average 1.2487503547028136) internal successors, (57209), 45813 states have internal predecessors, (57209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45814 states to 45814 states and 57209 transitions. [2025-03-16 14:54:14,698 INFO L78 Accepts]: Start accepts. Automaton has 45814 states and 57209 transitions. Word has length 408 [2025-03-16 14:54:14,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:14,699 INFO L471 AbstractCegarLoop]: Abstraction has 45814 states and 57209 transitions. [2025-03-16 14:54:14,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:14,699 INFO L276 IsEmpty]: Start isEmpty. Operand 45814 states and 57209 transitions. [2025-03-16 14:54:14,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2025-03-16 14:54:14,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:14,705 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 14:54:14,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:54:14,706 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:14,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:14,706 INFO L85 PathProgramCache]: Analyzing trace with hash 2052577706, now seen corresponding path program 1 times [2025-03-16 14:54:14,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:14,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533925310] [2025-03-16 14:54:14,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:14,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:14,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-03-16 14:54:14,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-03-16 14:54:14,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:14,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:14,943 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-16 14:54:14,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:14,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533925310] [2025-03-16 14:54:14,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533925310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:14,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:14,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:54:14,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179049839] [2025-03-16 14:54:14,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:14,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:54:14,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:14,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:54:14,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:14,945 INFO L87 Difference]: Start difference. First operand 45814 states and 57209 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:17,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:17,315 INFO L93 Difference]: Finished difference Result 93880 states and 116713 transitions. [2025-03-16 14:54:17,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:54:17,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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 417 [2025-03-16 14:54:17,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:17,377 INFO L225 Difference]: With dead ends: 93880 [2025-03-16 14:54:17,378 INFO L226 Difference]: Without dead ends: 47316 [2025-03-16 14:54:17,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:17,415 INFO L435 NwaCegarLoop]: 1136 mSDtfsCounter, 792 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2129 mSolverCounterSat, 647 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 2776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 647 IncrementalHoareTripleChecker+Valid, 2129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:17,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 1142 Invalid, 2776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [647 Valid, 2129 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 14:54:17,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47316 states. [2025-03-16 14:54:17,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47316 to 45063. [2025-03-16 14:54:17,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45063 states, 45062 states have (on average 1.2062713594602992) internal successors, (54357), 45062 states have internal predecessors, (54357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:17,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45063 states to 45063 states and 54357 transitions. [2025-03-16 14:54:17,967 INFO L78 Accepts]: Start accepts. Automaton has 45063 states and 54357 transitions. Word has length 417 [2025-03-16 14:54:17,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:17,968 INFO L471 AbstractCegarLoop]: Abstraction has 45063 states and 54357 transitions. [2025-03-16 14:54:17,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:17,968 INFO L276 IsEmpty]: Start isEmpty. Operand 45063 states and 54357 transitions. [2025-03-16 14:54:17,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-03-16 14:54:17,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:17,976 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:54:17,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:54:17,976 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:17,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:17,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1110619661, now seen corresponding path program 1 times [2025-03-16 14:54:17,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:17,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572191420] [2025-03-16 14:54:17,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:17,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:18,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-16 14:54:18,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-16 14:54:18,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:18,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:18,241 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2025-03-16 14:54:18,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:18,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572191420] [2025-03-16 14:54:18,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572191420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:18,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:18,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:54:18,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210579208] [2025-03-16 14:54:18,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:18,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:54:18,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:18,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:54:18,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:18,243 INFO L87 Difference]: Start difference. First operand 45063 states and 54357 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:20,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:20,719 INFO L93 Difference]: Finished difference Result 92378 states and 111192 transitions. [2025-03-16 14:54:20,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:54:20,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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 430 [2025-03-16 14:54:20,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:20,771 INFO L225 Difference]: With dead ends: 92378 [2025-03-16 14:54:20,771 INFO L226 Difference]: Without dead ends: 48067 [2025-03-16 14:54:20,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:20,807 INFO L435 NwaCegarLoop]: 1247 mSDtfsCounter, 649 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2628 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 2928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 2628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:20,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 1254 Invalid, 2928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 2628 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 14:54:20,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48067 states. [2025-03-16 14:54:21,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48067 to 47316. [2025-03-16 14:54:21,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47316 states, 47315 states have (on average 1.1867483884603192) internal successors, (56151), 47315 states have internal predecessors, (56151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47316 states to 47316 states and 56151 transitions. [2025-03-16 14:54:21,183 INFO L78 Accepts]: Start accepts. Automaton has 47316 states and 56151 transitions. Word has length 430 [2025-03-16 14:54:21,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:21,183 INFO L471 AbstractCegarLoop]: Abstraction has 47316 states and 56151 transitions. [2025-03-16 14:54:21,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:21,183 INFO L276 IsEmpty]: Start isEmpty. Operand 47316 states and 56151 transitions. [2025-03-16 14:54:21,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-03-16 14:54:21,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:21,189 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:54:21,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:54:21,189 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:21,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:21,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1371160855, now seen corresponding path program 1 times [2025-03-16 14:54:21,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:21,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563983472] [2025-03-16 14:54:21,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:21,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:21,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-03-16 14:54:21,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-03-16 14:54:21,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:21,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:21,927 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-16 14:54:21,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:21,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563983472] [2025-03-16 14:54:21,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563983472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:21,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:21,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 14:54:21,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848446507] [2025-03-16 14:54:21,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:21,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:54:21,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:21,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:54:21,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:54:21,928 INFO L87 Difference]: Start difference. First operand 47316 states and 56151 transitions. Second operand has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:24,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:24,442 INFO L93 Difference]: Finished difference Result 104536 states and 123264 transitions. [2025-03-16 14:54:24,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:54:24,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 0 states have call successors, (0), 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 434 [2025-03-16 14:54:24,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:24,502 INFO L225 Difference]: With dead ends: 104536 [2025-03-16 14:54:24,502 INFO L226 Difference]: Without dead ends: 54217 [2025-03-16 14:54:24,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:54:24,535 INFO L435 NwaCegarLoop]: 1323 mSDtfsCounter, 2321 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2855 mSolverCounterSat, 1458 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2321 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 4313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1458 IncrementalHoareTripleChecker+Valid, 2855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:24,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2321 Valid, 1333 Invalid, 4313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1458 Valid, 2855 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 14:54:24,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54217 states. [2025-03-16 14:54:25,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54217 to 54075. [2025-03-16 14:54:25,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54075 states, 54074 states have (on average 1.1470947220475645) internal successors, (62028), 54074 states have internal predecessors, (62028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:25,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54075 states to 54075 states and 62028 transitions. [2025-03-16 14:54:25,101 INFO L78 Accepts]: Start accepts. Automaton has 54075 states and 62028 transitions. Word has length 434 [2025-03-16 14:54:25,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:25,101 INFO L471 AbstractCegarLoop]: Abstraction has 54075 states and 62028 transitions. [2025-03-16 14:54:25,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:25,102 INFO L276 IsEmpty]: Start isEmpty. Operand 54075 states and 62028 transitions. [2025-03-16 14:54:25,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-03-16 14:54:25,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:25,106 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:54:25,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:54:25,107 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:25,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:25,107 INFO L85 PathProgramCache]: Analyzing trace with hash -566278511, now seen corresponding path program 1 times [2025-03-16 14:54:25,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:25,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049227933] [2025-03-16 14:54:25,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:25,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:25,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-16 14:54:25,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-16 14:54:25,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:25,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:25,300 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 423 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-03-16 14:54:25,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:25,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049227933] [2025-03-16 14:54:25,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049227933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:25,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:25,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:54:25,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995076281] [2025-03-16 14:54:25,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:25,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:54:25,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:25,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:54:25,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:25,302 INFO L87 Difference]: Start difference. First operand 54075 states and 62028 transitions. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:27,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:27,508 INFO L93 Difference]: Finished difference Result 123920 states and 142645 transitions. [2025-03-16 14:54:27,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:54:27,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 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 435 [2025-03-16 14:54:27,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:27,584 INFO L225 Difference]: With dead ends: 123920 [2025-03-16 14:54:27,584 INFO L226 Difference]: Without dead ends: 70597 [2025-03-16 14:54:27,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:27,618 INFO L435 NwaCegarLoop]: 1179 mSDtfsCounter, 698 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2210 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 2583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 2210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:27,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 1186 Invalid, 2583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 2210 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 14:54:27,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70597 states. [2025-03-16 14:54:28,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70597 to 70597. [2025-03-16 14:54:28,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70597 states, 70596 states have (on average 1.1275709671936087) internal successors, (79602), 70596 states have internal predecessors, (79602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:28,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70597 states to 70597 states and 79602 transitions. [2025-03-16 14:54:28,375 INFO L78 Accepts]: Start accepts. Automaton has 70597 states and 79602 transitions. Word has length 435 [2025-03-16 14:54:28,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:28,376 INFO L471 AbstractCegarLoop]: Abstraction has 70597 states and 79602 transitions. [2025-03-16 14:54:28,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:28,376 INFO L276 IsEmpty]: Start isEmpty. Operand 70597 states and 79602 transitions. [2025-03-16 14:54:28,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-03-16 14:54:28,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:28,383 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:54:28,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:54:28,383 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:28,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:28,384 INFO L85 PathProgramCache]: Analyzing trace with hash -104090314, now seen corresponding path program 1 times [2025-03-16 14:54:28,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:28,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043769679] [2025-03-16 14:54:28,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:28,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:28,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-03-16 14:54:28,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-03-16 14:54:28,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:28,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:28,712 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-03-16 14:54:28,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:28,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043769679] [2025-03-16 14:54:28,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043769679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:28,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:28,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:54:28,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366074238] [2025-03-16 14:54:28,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:28,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:54:28,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:28,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:54:28,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:28,714 INFO L87 Difference]: Start difference. First operand 70597 states and 79602 transitions. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:31,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:31,224 INFO L93 Difference]: Finished difference Result 184751 states and 208855 transitions. [2025-03-16 14:54:31,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:54:31,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 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 437 [2025-03-16 14:54:31,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:31,365 INFO L225 Difference]: With dead ends: 184751 [2025-03-16 14:54:31,365 INFO L226 Difference]: Without dead ends: 114906 [2025-03-16 14:54:31,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:31,421 INFO L435 NwaCegarLoop]: 1281 mSDtfsCounter, 684 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 497 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 2774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 497 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:31,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1288 Invalid, 2774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [497 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 14:54:31,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114906 states. [2025-03-16 14:54:32,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114906 to 102139. [2025-03-16 14:54:32,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102139 states, 102138 states have (on average 1.1083827762439054) internal successors, (113208), 102138 states have internal predecessors, (113208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:32,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102139 states to 102139 states and 113208 transitions. [2025-03-16 14:54:32,795 INFO L78 Accepts]: Start accepts. Automaton has 102139 states and 113208 transitions. Word has length 437 [2025-03-16 14:54:32,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:32,795 INFO L471 AbstractCegarLoop]: Abstraction has 102139 states and 113208 transitions. [2025-03-16 14:54:32,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:32,795 INFO L276 IsEmpty]: Start isEmpty. Operand 102139 states and 113208 transitions. [2025-03-16 14:54:32,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-03-16 14:54:32,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:32,801 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 14:54:32,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 14:54:32,801 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:32,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:32,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2018388363, now seen corresponding path program 1 times [2025-03-16 14:54:32,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:32,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894264284] [2025-03-16 14:54:32,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:32,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:32,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-03-16 14:54:32,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-03-16 14:54:32,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:32,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:32,961 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 590 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-16 14:54:32,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:32,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894264284] [2025-03-16 14:54:32,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894264284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:32,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:32,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:54:32,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735543335] [2025-03-16 14:54:32,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:32,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:54:32,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:32,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:54:32,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:32,963 INFO L87 Difference]: Start difference. First operand 102139 states and 113208 transitions. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:35,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:35,252 INFO L93 Difference]: Finished difference Result 204277 states and 226413 transitions. [2025-03-16 14:54:35,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:54:35,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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 487 [2025-03-16 14:54:35,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:35,366 INFO L225 Difference]: With dead ends: 204277 [2025-03-16 14:54:35,366 INFO L226 Difference]: Without dead ends: 102890 [2025-03-16 14:54:35,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:35,429 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 790 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2172 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 2586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 2172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:35,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 218 Invalid, 2586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 2172 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 14:54:35,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102890 states. [2025-03-16 14:54:36,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102890 to 95380. [2025-03-16 14:54:36,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95380 states, 95379 states have (on average 1.0788957737028066) internal successors, (102904), 95379 states have internal predecessors, (102904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95380 states to 95380 states and 102904 transitions. [2025-03-16 14:54:36,735 INFO L78 Accepts]: Start accepts. Automaton has 95380 states and 102904 transitions. Word has length 487 [2025-03-16 14:54:36,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:36,735 INFO L471 AbstractCegarLoop]: Abstraction has 95380 states and 102904 transitions. [2025-03-16 14:54:36,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:36,736 INFO L276 IsEmpty]: Start isEmpty. Operand 95380 states and 102904 transitions. [2025-03-16 14:54:36,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-03-16 14:54:36,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:36,741 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:54:36,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:54:36,741 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:36,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:36,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1114832007, now seen corresponding path program 1 times [2025-03-16 14:54:36,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:36,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579200078] [2025-03-16 14:54:36,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:36,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:36,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-16 14:54:36,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-16 14:54:36,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:36,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-16 14:54:36,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:36,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579200078] [2025-03-16 14:54:36,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579200078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:36,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:36,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:54:36,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459102941] [2025-03-16 14:54:36,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:36,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:54:36,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:36,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:54:36,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:36,953 INFO L87 Difference]: Start difference. First operand 95380 states and 102904 transitions. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:39,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:39,740 INFO L93 Difference]: Finished difference Result 190008 states and 205051 transitions. [2025-03-16 14:54:39,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:54:39,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 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 500 [2025-03-16 14:54:39,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:39,857 INFO L225 Difference]: With dead ends: 190008 [2025-03-16 14:54:39,857 INFO L226 Difference]: Without dead ends: 95380 [2025-03-16 14:54:39,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:39,915 INFO L435 NwaCegarLoop]: 1234 mSDtfsCounter, 567 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2187 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 2676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 2187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:39,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1241 Invalid, 2676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 2187 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 14:54:40,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95380 states. [2025-03-16 14:54:40,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95380 to 91625. [2025-03-16 14:54:40,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91625 states, 91624 states have (on average 1.056382607177159) internal successors, (96790), 91624 states have internal predecessors, (96790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:40,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91625 states to 91625 states and 96790 transitions. [2025-03-16 14:54:40,967 INFO L78 Accepts]: Start accepts. Automaton has 91625 states and 96790 transitions. Word has length 500 [2025-03-16 14:54:40,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:40,967 INFO L471 AbstractCegarLoop]: Abstraction has 91625 states and 96790 transitions. [2025-03-16 14:54:40,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:40,967 INFO L276 IsEmpty]: Start isEmpty. Operand 91625 states and 96790 transitions. [2025-03-16 14:54:40,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-03-16 14:54:40,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:40,975 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:54:40,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 14:54:40,976 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:40,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:40,976 INFO L85 PathProgramCache]: Analyzing trace with hash 2025938427, now seen corresponding path program 1 times [2025-03-16 14:54:40,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:40,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090318485] [2025-03-16 14:54:40,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:40,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:41,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-03-16 14:54:41,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-03-16 14:54:41,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:41,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:41,213 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2025-03-16 14:54:41,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:41,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090318485] [2025-03-16 14:54:41,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090318485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:41,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:41,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:54:41,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487688942] [2025-03-16 14:54:41,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:41,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:54:41,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:41,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:54:41,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:41,216 INFO L87 Difference]: Start difference. First operand 91625 states and 96790 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:43,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:43,805 INFO L93 Difference]: Finished difference Result 199020 states and 210436 transitions. [2025-03-16 14:54:43,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:54:43,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 518 [2025-03-16 14:54:43,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:43,939 INFO L225 Difference]: With dead ends: 199020 [2025-03-16 14:54:43,939 INFO L226 Difference]: Without dead ends: 108147 [2025-03-16 14:54:43,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:43,991 INFO L435 NwaCegarLoop]: 1108 mSDtfsCounter, 835 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2114 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 2517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 2114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:43,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 1115 Invalid, 2517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 2114 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 14:54:44,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108147 states. [2025-03-16 14:54:44,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108147 to 103641. [2025-03-16 14:54:45,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103641 states, 103640 states have (on average 1.0534253184098803) internal successors, (109177), 103640 states have internal predecessors, (109177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:45,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103641 states to 103641 states and 109177 transitions. [2025-03-16 14:54:45,103 INFO L78 Accepts]: Start accepts. Automaton has 103641 states and 109177 transitions. Word has length 518 [2025-03-16 14:54:45,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:45,103 INFO L471 AbstractCegarLoop]: Abstraction has 103641 states and 109177 transitions. [2025-03-16 14:54:45,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:45,103 INFO L276 IsEmpty]: Start isEmpty. Operand 103641 states and 109177 transitions. [2025-03-16 14:54:45,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2025-03-16 14:54:45,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:45,118 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:54:45,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 14:54:45,118 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:45,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:45,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1345906209, now seen corresponding path program 1 times [2025-03-16 14:54:45,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:45,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442822403] [2025-03-16 14:54:45,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:45,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:45,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 696 statements into 1 equivalence classes. [2025-03-16 14:54:45,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 696 of 696 statements. [2025-03-16 14:54:45,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:45,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:45,367 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-03-16 14:54:45,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:45,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442822403] [2025-03-16 14:54:45,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442822403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:45,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:45,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:54:45,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248283677] [2025-03-16 14:54:45,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:45,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:54:45,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:45,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:54:45,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:45,370 INFO L87 Difference]: Start difference. First operand 103641 states and 109177 transitions. Second operand has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:48,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:48,459 INFO L93 Difference]: Finished difference Result 254594 states and 269054 transitions. [2025-03-16 14:54:48,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:54:48,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 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 696 [2025-03-16 14:54:48,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:48,624 INFO L225 Difference]: With dead ends: 254594 [2025-03-16 14:54:48,625 INFO L226 Difference]: Without dead ends: 151705 [2025-03-16 14:54:48,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:48,674 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 607 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2196 mSolverCounterSat, 644 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 2840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 644 IncrementalHoareTripleChecker+Valid, 2196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:48,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 407 Invalid, 2840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [644 Valid, 2196 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 14:54:48,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151705 states. [2025-03-16 14:54:50,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151705 to 147199. [2025-03-16 14:54:50,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147199 states, 147198 states have (on average 1.051502058451881) internal successors, (154779), 147198 states have internal predecessors, (154779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:50,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147199 states to 147199 states and 154779 transitions. [2025-03-16 14:54:50,311 INFO L78 Accepts]: Start accepts. Automaton has 147199 states and 154779 transitions. Word has length 696 [2025-03-16 14:54:50,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:50,312 INFO L471 AbstractCegarLoop]: Abstraction has 147199 states and 154779 transitions. [2025-03-16 14:54:50,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:50,312 INFO L276 IsEmpty]: Start isEmpty. Operand 147199 states and 154779 transitions. [2025-03-16 14:54:50,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2025-03-16 14:54:50,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:50,331 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:54:50,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 14:54:50,331 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:50,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:50,331 INFO L85 PathProgramCache]: Analyzing trace with hash 927173520, now seen corresponding path program 1 times [2025-03-16 14:54:50,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:50,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061937056] [2025-03-16 14:54:50,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:50,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:50,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 784 statements into 1 equivalence classes. [2025-03-16 14:54:50,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 784 of 784 statements. [2025-03-16 14:54:50,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:50,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:51,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1511 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 1327 trivial. 0 not checked. [2025-03-16 14:54:51,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:51,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061937056] [2025-03-16 14:54:51,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061937056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:51,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:51,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:54:51,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657173914] [2025-03-16 14:54:51,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:51,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:54:51,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:51,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:54:51,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:51,365 INFO L87 Difference]: Start difference. First operand 147199 states and 154779 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:53,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:54:53,950 INFO L93 Difference]: Finished difference Result 293646 states and 308801 transitions. [2025-03-16 14:54:53,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:54:53,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 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 784 [2025-03-16 14:54:53,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:54:54,115 INFO L225 Difference]: With dead ends: 293646 [2025-03-16 14:54:54,116 INFO L226 Difference]: Without dead ends: 147199 [2025-03-16 14:54:54,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:54:54,199 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 829 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2236 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 2577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 2236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:54:54,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 86 Invalid, 2577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 2236 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 14:54:54,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147199 states. [2025-03-16 14:54:55,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147199 to 141942. [2025-03-16 14:54:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141942 states, 141941 states have (on average 1.044293051338232) internal successors, (148228), 141941 states have internal predecessors, (148228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:55,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141942 states to 141942 states and 148228 transitions. [2025-03-16 14:54:55,982 INFO L78 Accepts]: Start accepts. Automaton has 141942 states and 148228 transitions. Word has length 784 [2025-03-16 14:54:55,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:54:55,982 INFO L471 AbstractCegarLoop]: Abstraction has 141942 states and 148228 transitions. [2025-03-16 14:54:55,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:54:55,982 INFO L276 IsEmpty]: Start isEmpty. Operand 141942 states and 148228 transitions. [2025-03-16 14:54:56,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1438 [2025-03-16 14:54:56,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:54:56,069 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:54:56,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 14:54:56,069 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:54:56,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:54:56,070 INFO L85 PathProgramCache]: Analyzing trace with hash 809818954, now seen corresponding path program 1 times [2025-03-16 14:54:56,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:54:56,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152743216] [2025-03-16 14:54:56,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:54:56,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:54:56,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1437 statements into 1 equivalence classes. [2025-03-16 14:54:56,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1437 of 1437 statements. [2025-03-16 14:54:56,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:54:56,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:54:59,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1700 backedges. 1662 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-16 14:54:59,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:54:59,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152743216] [2025-03-16 14:54:59,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152743216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:54:59,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:54:59,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 14:54:59,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443581905] [2025-03-16 14:54:59,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:54:59,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:54:59,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:54:59,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:54:59,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:54:59,469 INFO L87 Difference]: Start difference. First operand 141942 states and 148228 transitions. Second operand has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)